How to reduce your enemy's information
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Elements of information theory
Elements of information theory
Experimental quantum cryptography
Journal of Cryptology - Eurocrypt '90
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
25 years of quantum cryptography
ACM SIGACT News
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Extracting Randomness: How and Why - A survey
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Pairwise Independence and Derandomization
Pairwise Independence and Derandomization
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Oblivious transfers and privacy amplification
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Generating random bits from an arbitrary source: fundamental limits
IEEE Transactions on Information Theory
Unconditionally-Secure Oblivious Transfer
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
The effect of side-information on smooth entropy
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Bayesian estimates in cryptography
ICCOM'05 Proceedings of the 9th WSEAS International Conference on Communications
Oblivious Transfer from Weak Noisy Channels
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Smooth entropies and the quantum information spectrum
IEEE Transactions on Information Theory
Oblivious transfers and privacy amplification
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
High-level secured signature scheme
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Simple and tight bounds for information reconciliation and privacy amplification
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
| Hi-index | 0.06 |
The notion of smooth entropy allows a unifying, generalized formulation of privacy amplification and entropy smoothing. Smooth entropy is a measure for the number of almost uniform random bits that can be extracted from a random source by probabilistic algorithms. It is known that the Rényi entropy of order at least 2 of a random variable is a lower bound for its smooth entropy. On the other hand, an assumption about Shannon entropy (which is Rényi entropy of order 1) is too weak to guarantee any non-trivial amount of smooth entropy. In this work we close the gap between Rényi entropy of order 1 and 2. In particular, we show that Rényi entropy of order o for any 1