Entropic security and the encryption of high entropy messages

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 556-577

  Dodis, Yevgeniy ^a   Smith, Adam ^b  

^a NEW YORK UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY; GRAPH THEORY; INFORMATION THEORY; SEMANTICS;

ENTROPIC SECURITY; NON-UNIFORM DISTRIBUTIONS; SEMANTIC SECURITY;

CRYPTOGRAPHY;

EID: 24144460521     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_30     Document Type: Conference Paper

References (25)

1. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta: Simple Constructions of Almost k-Wise Independent Random Variables. FOCS 1990: 544-553
2. Noga Alon and Yuval Roichman. Random Cayley graphs and expanders. Random Structures & Algorithms 5 (1994), 271-284.
3. C. Bennett, G. Brassard, and J. Robert. Privacy Amplification by Public Discussion. SIAM J. on Computing, 17(2), pp. 210-229, 1988.
4. C. Bennett, G. Brassard, G. Crépeau, and U. Maurer. Generalized Privacy Amplification. IEEE Transactions on Information Theory, 41(6), pp. 1915-1923, 1995.
5. R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information. In Crypto 1997.
6. R. Canetti, D. Micciancio, O. Reingold. Perfectly One-Way Probabilistic Hash Functions. In Proc. 30th ACM Symp. on Theory of Computing, 1998, pp. 131-140.
7. Ran Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. Proc. IEEE Symp. on Foundations of Computer Science, 2001, pp. 136-145.
8. T. Cover, J. Thomas. Elements of Information Theory. Wiley series in telecommunication, 1991, 542 pp.
9. Y. Dodis, and A. Smith. Entropic Security and the Encryption of High Entropy Messages. Full version of this paper. Available at IACR Cryptology ePrint Archive, report 2004/219, at http://eprint.iacr.org/2004/219/.
10. S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28(2), pp. 270-299, April 1984.
11. Oded Goldreich, Salil Vadhan and Avi Wigderson. On Interactive Proofs with a Laconic Prover. Computational Complexity, 11(1-2): 1-53 (2002).
12. Oded Goldreich, Avi Wigderson: Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Structures and Algorithms 11(4): 315-343 (1997)
13. J. Håstad, R. Impagliazzo, L. Levin, M. Luby. A Pseudorandom generator from any one-way function. In Proc. 21st ACM Symp. on Theory of Computing, 1989.
14. Jonathan Herzog. Computational Soundness for Standard Assumptions of Formal Cryptography. Ph.D. Thesis, Massachusetts Institute of Technology, May 2004.
15. R. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. In Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989.
16. H. Krawczyk. LFSR-Based Hashing and Authentication. In Proc. CRYPTO'94, p. 129-139, 1994.
17. A. Lubotzky, R. Phillips, P. Sarnak: Ramanujan graphs. Combinatorica 8(3): 261-277 (1988).
18. U. Maurer. Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. J. Cryptology, 5(1), pp. 53-66, 1992.
19. U. Maurer. Secret Key Agreement by Public Discussion. IEEE Trans. on Info. Theory, 39(3):733-742, 1993.
20. J. Naor, M. Naor. Small-Bias Probability Spaces: Efficient Constructions and Applications. In SIAM J. Comput. 22(4): 838-856 (1993).
21. N. Nisan, D. Zuckerman. Randomness is Linear in Space. In JCSS, 52(1), pp. 43-52, 1996.
22. B. Pfitzmann, M. Waidner. A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In Proc. IEEE Symp. on Security and Privacy, 2001, 184-200.
23. J. Radhakrishnan and A. Ta-Shma. Tight bounds for depth-two superconcentrators. In Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 585-594.
24. A. Russell and Wang. How to Fool an Unbounded Adversary with a Short Key. In Advances in Cryptology - EUROCRYPT 2002.
25. C. Shannon. Communication Theory of Secrecy systems. In Bell Systems Technical J., 28:656-715, 1949. Note: The material in this paper appeared originally in a confidential report 'A Mathematical Theory of Cryptography', dated Sept. 1, 1945, which has now been declassified.