Proceedings ArticleDOI
Smooth Histograms for Sliding Windows
Vladimir Braverman,Rafail Ostrovsky +1 more
- pp 283-293
Reads0
Chats0
TLDR
This paper presents a new smooth histograms method that improves the approximation error rate obtained via exponential histograms and provides the first approximation algorithms for the following functions: Lp norms for p notin, frequency moments, length of increasing subsequence and geometric mean.Abstract:
In the streaming model elements arrive sequentially and can be observed only once. Maintaining statistics and aggregates is an important and non-trivial task in the model. This becomes even more challenging in the sliding windows model, where statistics must be maintained only over the most recent n elements. In their pioneering paper, Datar, Gionis, Indyk and Motwani [15] presented exponential histograms, an effective method for estimating statistics on sliding windows. In this paper we present a new smooth histograms method that improves the approximation error rate obtained via exponential histograms. Furthermore, our smooth histograms method not only captures and improves multiple previous results on sliding windows bur also extends the class functions that can be approximated on sliding windows. In particular, we provide the first approximation algorithms for the following functions: Lp norms for p notin [1,2], frequency moments, length of increasing subsequence and geometric mean.read more
Citations
More filters
Proceedings ArticleDOI
Leakage-Resilient Cryptography
TL;DR: In this article, a stream-cipher S whose implementation is secure even if a bounded amount of arbitrary (adversarially chosen) information on the internal state ofS is leaked during computation is presented.
Journal ArticleDOI
Graph stream algorithms: a survey
TL;DR: The techniques developed in this area are now finding applications in other areas including data structures for dynamic graphs, approximation algorithms, and distributed and parallel computation.
Book ChapterDOI
A Leakage-Resilient Mode of Operation
TL;DR: It is shown that unlike "normal" PRFs, wPRFs are seed-incompressible, in the sense that the output of a wPRF is pseudorandom even if a bounded amount of information about the key is leaked.
Book ChapterDOI
Achieving leakage resilience through dual system encryption
TL;DR: In this paper, the authors show that strong leakage resilience for cryptosystems with advanced functionalities can be obtained quite naturally within the methodology of dual system encryption, recently introduced by Waters.
Book ChapterDOI
Position Based Cryptography
TL;DR: The main contribution in this paper is to place the problem of secure positioning on a sound theoretical footing, to prove a strong impossibility result that simultaneously shows the insecurity of previous attempts at the problem, and to present positive results by showing that the bounded-storage framework is one of the "right" frameworks to study the foundations of position-based cryptography.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Algorithms on strings, trees, and sequences
TL;DR: Ukkonen’s method is the method of choice for most problems requiring the construction of a suffix tree, and it will be presented first because it is easier to understand.