How to fool an unbounded adversary with a short key

IEEE Transactions on Information Theory

Volumn 52, Issue 3, 2006, Pages 1130-1140

  Russell, Alexander ^a   Hong, Wang ^a  

^a University of Connecticut   (United States)

Author keywords

Cryptography; Encryption; Information theoretic encryption; Symmetric encryption

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

INFORMATION-THEORETIC ENCRYPTION; SYMMETRIC ENCRYPTION;

PROBLEM SOLVING;

EID: 33947422097     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.864438     Document Type: Article

References (29)

1. D. Welsh, Codes and Cryptography. New York: The Clarendon/Oxford Univ. Press, 1988.
2. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comp. Syst. Sci., vol. 28, no. 2, pp. 270-299, Apr. 1984.
3. M. Bellare, A. Desai, A. Pointcheval, and P. Rogaway, "Relations among notions of public-key cryptosystems," in Advances in Cryptology - CRYPTO'98 (Lecture Notes in Computer Science), H. Krawczyk, Ed. Berlin, Germany: Springer-Verlag, 1998, p. 540.
4. D. Dolev, C. Dwork, and M. Naor, "Non-malleable cryptography (extended abstract)," in Proc. 23rd Annu. ACM Symp.Theory of Computing, New Orleans, LA, May 1991, pp. 542-552.
5. M. Naor and M. Yung, "Public-key cryptosystems provably secure against chosen ciphertext attacks," in Proc. 22nd Annu. ACM Symp. Theory of Computing, Baltimore, MD, May 1990, pp. 427-437.
6. C. Rackoff and D. R. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack," in Advances in Cryptohgy - CRYPTO'91 (Lecture Notes in Computer Science), I. Feigenbaum, Ed. Berlin, Germny: Springer-Verlag, 1992, vol. 576, pp. 433-444.
7. U. M. Maurer, "Conditionally-perfect secrecy and a provably-secure randomized cipher," J. Cryptol, vol. 5, no. 1, pp. 53-66, 1992.
8. Y. Aumann and M. O. Rabin, "Information theoretically secure communication in the limited storage space model," in Advances in Cryptology - CRYPTO '99 (Lecture Notes in Computer Science), M. Wiener, Ed. Berlin, Germany: Springer-Verlag, 1999, vol. 1666, pp. 65-79.
9. C. Cachin and U. Maurer, "Unconditional security against memory-bounded adversaries," in Advances in Cryptology - CRYPTO'97 (Lecture Notes in Computer Science), B. S. Kaliski Jr., Ed. Berlin, Germany: Springer-Verlag, 1997, vol. 1294, pp. 292-306.
10. Y. Z. Ding and M. O. Rabin, "Hyper-encryption and everlasting security," in Proc. 19th Annu. Symp. Theoretical Aspects of Computer Science (STAGS) (Lecture Notes in Computer Science), vol. 2285. Berlin, Germany, 2002, pp. 1-26.
11. Y. Aumann, Y. Zong Ding, and M. O. Rabin, "Everlasting security in the bounded storage model," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1668-1680, Jun. 2002.
12. M. Bellare and P. Rogaway, "Optimal asymmetric encryption," in Advances in Cryptology-EUROCRYPT 94 (Lecture Notes in Computer Science), A. De Santis, Ed. Berlin, Germany: Springer-Verlag, 1995, vol. 950, pp. 92-111.
13. J. Naor and M. Naor, "Small-bias probability spaces: Efficient constructions and applications," SIAM J. Comput., vol. 22, no. 4, pp. 838-856, Aug. 1993.
14. R. Peralta, "On the distribution of quadratic residues and nonresidues modulo a prime number," Math. Comput., vol. 58, no. 197, pp. 433-440, 1992.
15. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, "Simple constructions of almost k-wise independent random variables," in Proc. IEEE 31st Annu. Symp. Foundations of Computer Science, vol. II, St. Louis, MO, Oct. 1990, pp. 544-553.
16. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison-Wesley, 1983. vol. 20 of Encyclopedia of Mathematics and its Applications.
17. A. Schönhage, "Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2," Acta Informat., vol. 7, no. 4, pp. 395-398, 1976/77.
18. E. Bach and J. Shallit, Algorithmic Number Theory. Cambridge, MA: MIT Press, 1996, vol. 1. Efficient algorithms.
19. M. N. Wegman and J. L. Carter, "New classes and applications of hash functions," in Proc. IEEE 20th Annu. Symp. Foundations of Computer Science, San Juan, PR, Oct. 1979, pp. 175-182.
20. E. G. Rees, Notes on Geometry. Berlin, Germany: Springer-Verlag, 1983.
21. A, Schönhage and V. Strassen, "Schnelle multiplikation großer zahlen," Computing, vol. 7, pp. 281-292, 1971.
22. A. Schönhage, "Schnelle berechnung von kettenbruchentwicklungen," Acta Inform., vol. I, pp. 139-144, 1971.
23. M. Blum and S, Micali, "How to generate cryptographically strong sequences of pseudo-random bits," SIAM J. Comput., vol. 13, no. 4, pp. 850-864, Nov. 1984.
24. M. Blum and S. Goldwasser, "An efficient probabilistic public-key encryption scheme which hides all partial information," in Advances in Cryptology: Proceedings of CRYPTO 84 (Lecture Notes in Computer Science), G. R. Blakley and D. Chaum, Eds. Berlin, Germany: Springer-Verlag, 1985, vol. 196, pp. 289-299.
25. R. Cramer and V. Shoup, "A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack," in Advances in Cryptology - CRYPTO '98 (Lecture Notes in Computer Science), H. Krawczyk, Ed. Berlin, Germany: Springer-Verlag, 1998, vol. 1462, pp. 13-25.
26. S. Goldwasser, S. Micali, and R. L. Rivest, "A digital signature scheme secure against adaptive chosen-message attacks," SIAM J. Comput., vol. 17, no. 2, pp. 281-308, Apr. 1988.
27. O. Goldreich, "A uniform-complexity treatment of encryption and zeroknowledge," J. Cryptol., vol. 6, no. 1, pp. 21-53, 1993.
28. H. Krawczyk, Ed., Advances in Cryptology - CRYPTO'98 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1998, vol. 1462.
29. S. Micali, C. Rackoff, and B. Sloan, "The notion of security for probabilistic cryptosystems," SIAM J. Comput., vol. 17, no. 2, pp. 412-426, Apr. 1988.