On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Interpolation of symmetric functions and a new type of combinatorial design
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
A Randomnesss-Rounds Tradeoff in Private Computation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
How to Fool an Unbounded Adversary with a Short Key
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Post-Processing Functions for a Biased Physical Random Number Generator
Fast Software Encryption
An efficient cryptosystem Delta for stream cipher applications
Computers and Electrical Engineering
Perturbed identity matrices have high rank: Proof and applications
Combinatorics, Probability and Computing
Entropic security in quantum cryptography
Quantum Information Processing
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Local randomness in candidate one-way functions
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
New hash functions for message authentication
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
On the complexity of powering in finite fields
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Entropic security and the encryption of high entropy messages
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Hiding secret points amidst chaff
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.06 |
The authors present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is O(log log n+k+log 1/ epsilon ), where epsilon is the statistical difference between the distribution induced on any k-bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by J. Naor and M. Naor (1990). An advantage of the present constructions is their simplicity. Two of the constructions are based on bit sequences that are widely believed to possess randomness properties, and the results can be viewed as an explanation and establishment of these beliefs.