The Differential Privacy Frontier (Extended Abstract)
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
A Leakage-Resilient Mode of Operation
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Dense model theorems and their applications
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Separating succinct non-interactive arguments from all falsifiable assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Some notions of entropy for cryptography
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The maximum size of a Sidon set contained in a sparse random set of integers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Practical leakage-resilient symmetric cryptography
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Barriers in cryptography with weak, correlated and leaky sources
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Practical leakage-resilient pseudorandom objects with minimum public randomness
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Robust pseudorandom generators
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
A theorem of Green, Tao, and Ziegler can be stated (roughly) as follows: if$R$ is a pseudorandom set, and $D$ is a dense subset of $R$, then $D$ maybe modeled by a set $M$ that is dense in the entire domain such that $D$and $M$ are indistinguishable. (The precise statement refers to``measures'' ordistributions rather than sets.) The proof of this theorem is very general,and it applies to notions of pseudorandomness and indistinguishability definedin terms of any family of distinguishers with some mild closure properties.% \snote{added `with appropriate closure properties'}The proof proceeds via iterative partitioningand an energy increment argument, in the spirit of the proof of theweak Szemer\'edi regularity lemma. The ``reduction'' involved in the proofhas exponential complexity in the distinguishing probability.We present a new proof inspired by Nisan's proof of Impagliazzo's hardcoreset theorem. The reduction in our proof has polynomial complexity in thedistinguishing probability and provides a new characterization of thenotion of ``pseudoentropy'' of a distribution. A proof similar to ours hasalso been independently discovered by Gowers \cite{G08}.We also follow the connection between the two theorems and obtain a new proof ofImpagliazzo's hardcore set theorem via iterative partitioning andenergy increment. While our reduction has exponential complexity in someparameters, it has the advantage that the hardcore set is efficiently recognizable.