Smooth entropy and rényi entropy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1233, Issue , 1997, Pages 193-208

  Cachin, Christian ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM CRYPTOGRAPHY;

BIT COMMITMENT; FAILURE PROBABILITY; OBLIVIOUS TRANSFER; PRIVACY AMPLIFICATION; PROBABILISTIC ALGORITHM; RANDOM SOURCES; SHANNON ENTROPY; UNCONDITIONALLY SECURE;

CRYPTOGRAPHY;

EID: 84957375876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69053-0_14     Document Type: Conference Paper

References (20)

1. C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental quantum cryptography,” Journal of Cryptology, vol. 5, no. 1, pp. 3-28, 1992.
2. C. H. Bennett, G. Brassard, C. Crepeau, and U. M. Maurer, “Generalized privacy amplification,” IEEE Transactions on Information Theory, vol. 41, pp. 1915-1923, Nov. 1995.
3. C. H. Bennett, G. Brassard, and J.-M. Robert, “How to reduce your enemy’s information,” in Advances in Cryptology–CRYPTO’85 (H. C. Williams, ed.), vol. 218 of Lecture Notes in Computer Science, pp. 468-476, Springer-Verlag, 1986.
4. C. H. Bennett, G. Brassard, and J.-M. Robert, “Privacy amplification by public discussion,” SIAM Journal on Computing, vol. 17, pp. 210-229, Apr. 1988.
5. G. Brassard and C. Crepeau, “25 years of quantum cryptography,” SIG ACT News, vol. 27, no. 3, pp. 13-24, 1996.
6. G. Brassard and C. Crepeau, “Oblivions transfers and privacy amplification.” Proceedings of EUROCRYPT’97, 1997.
7. C. Cachin and U. Maurer, “Smoothing probability distributions and smooth entropy.” Preprint (abstract to appear in Proceedings of International Symposium on Information Theory, ISIT 97), 1997.
8. J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” Journal of Computer and System Sciences, vol. 18, pp. 143-154, 1979.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
10. C. Crepeau, “Efficient cryptographic protocols based on noisy channels.” Proceedings of EUROCRYPT’97, 1997.
11. T. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby, “Construction of a pseudorandom generator from any one-way function,” Tech. Rep. 91-068, International Computer Science Institute (ICSI), Berkeley, 1991.
12. R. Impagliazzo, L. A. Levin, and M. Luby, “Pseudo-random generation from oneway functions,” in Proc. 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 12-24, 1989.
13. M. Kharitonov, “Cryptographic hardness of distribution-specific learning,” in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 372-381, 1993.
14. M. Luby, Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
15. M. Luby and A. Wigderson, “Pairwise independence and derandomization,” Tech. Rep. 95-035, International Computer Science Institute (ICSI), Berkeley, 1995.
16. U. M. Maurer, “Secret key agreement by public discussion from common information,” IEEE Transactions on Information Theory, vol. 39, pp. 733-742, May 1993.
17. N. Nisan, “Extracting randomness: How and why–a survey,” in Proc. 11th Annual IEEE ConfereTice on Computational Complexity, 1996.
18. A. Renyi, “On measures of entropy and information,” in Proc. 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, (Berkeley), pp. 547-561, Univ. of Calif. Press, 1961.
19. S. Vembu and S. Verdu, “Generating random bits from an arbitrary source: Fundamental limits,” IEEE Transactions on Information Theory, vol. 41, pp. 1322-1332, Sept. 1995.
20. D. Zuckerman, “Simulating BPP using a general weak random source,” Algorith-mica, vol. 16, pp. 367-391, 1996. Preliminary version presented at 32nd FOCS (1991).