Smoothing probability distributions and smooth entropy

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1997, Pages 91-

  Cachin, Christian ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILITY; RANDOM PROCESSES;

RENYI ENTROPY; SMOOTH ENTROPY;

INFORMATION THEORY;

EID: 0030651429     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.613006     Document Type: Conference Paper

References (5)

1. C. H. Bennett, G. Brassard, C. Crbpeau, and U. M. Maurer, "Generalized privacy amplification," IEEE Tkansactions on Information Theory, vol. 41, pp. 1915-1923, Nov. 1995.
2. C. Cachin, "Smooth entropy and RBnyi entropy," in Advances in Cryptology-EUROCRYPT '97 (W. Fumy, ed.), Lecture Notes in Computer Science, Springer-Verlag, 1997.
3. J. Hktad, R. Impagliazzo, L. A. Levin, and M. Luby, L'Construction of a pseudo-random generator from any one-way function," Tech. Rep. 91-068, International Computer Science Institute (ICSI), Berkeley, 1991.
4. N. Nisan, "Extracting randomness: How and why-a survey," in P m. f lth Annual IEEE Conference on Computational Complexity, 1996.
5. S. Vembu and S. Verdli, "Generating random bits from an arbitrary source: Fundamental limits," IEEE Tkansactions on Information Theory, vol. 41, pp. 1322-1332, Sept. 1995.