How to fool an unbounded adversary with a short key

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

Volumn 2332, Issue , 2002, Pages 133-148

  Russell, Alexander ^a   Wang, Hong ^a  

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; SECURITY OF DATA;

CIPHERTEXTS; ENCRYPTION SCHEMES; MESSAGE SPACE; SHARED SECRETS; SYMMETRIC ENCRYPTION;

CRYPTOGRAPHY;

EID: 84947270656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_9     Document Type: Conference Paper

References (25)

1. Noga Alon, Oded Goldreich, Johan Hastad, and Rene Peralta. Simple constructions of almost k-wise independent random variables. In 31st Annual Symposium on Foundations of Computer Science, volume II, pages 544–553, St. Louis, Missouri, 22–24 October 1990. IEEE.
2. Yonatan Aumann and Michael O. Rabin. Information theoretically secure communication in the limited storage space model. In Michael Wiener, editor, Advances in Cryptology – CRYPTO ’99, volume 1666 of Lecture Notes in Computer Science, pages 65–79. Springer-Verlag, 1999.
3. Eric Bach and Jeffrey Shallit. Algorithmic number theory. Vol. 1. MIT Press, Cambridge, MA, 1996. Efficient algorithms.
4. M. Bellare, A. Desai, A. Pointcheval, and P. Rogaway. Relations among notions of public-key cryptosystems. In Krawczyk [13], page 540.
5. Mihir Bellare and Phillip Rogaway. Optimal asymmetric encryption. In Alfredo De Santis, editor, Advances in Cryptology – EUROCRYPT 94, volume 950 of Lecture Notes in Computer Science, pages 92–111. Springer-Verlag, 1995, 9–12 May 1994.
6. Manuel Blum and Shafi Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. In G. R. Blakley and David Chaum, editors, Advances in Cryptology: Proceedings of CRYPTO 84, volume 196 of Lecture Notes in Computer Science, pages 289–299. Springer-Verlag, 1985, 19–22 August 1984.
7. Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850–864, November 1984.
8. Ronald Cramer and Victor Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Krawczyk [13], pages 13–25.
9. Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography (extended abstract). In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 542–552, New Orleans, Louisiana, 6–8 May 1991.
10. Oded Goldreich. A uniform-complexity treatment of encryption and zeroknowledge. Journal of Cryptology, 6(1):21–53, 1993.
11. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270–299, April1 984.
12. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281–308, April1 988.
13. Hugo Krawczyk, editor. Advances in Cryptology – CRYPTO ’98, volume 1462 of Lecture Notes in Computer Science. Springer-Verlag, 23–27 August 1998.
14. Rudolf Lidl and Harald Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company, Reading, Massachusetts, 1983.
15. Ueli M. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53–66, 1992.
16. Joseph Naor and Moni Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838–856, August 1993.
17. Moni Naor and Moti Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 427–437, Baltimore, Maryland, 14–16 May 1990.
18. Rene Peralta. On the distribution of quadratic residues and nonresidues modulo a prime number. Mathematics of Computation, 58(197):433–440, 1992.
19. Charles Rackoff and Daniel R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, Advances in Cryptology – CRYPTO ’91, volume 576 of Lecture Notes in Computer Science, pages 433–444. Springer-Verlag, 1992, 11–15 August 1991.
20. E. G. Rees. Notes on Geometry. Springer-Verlag, 1983.
21. A. Schonhage. Schnelle berechnung von kettenbruchentwicklungen. Acta Informatica, 1:139–144, 1971.
22. A. Schonhage. Schnelle Multiplikation von Polynomen uber Korpern der Charakteristik 2. Acta Informat., 7(4):395–398, 1976/77.
23. A. Schonhage and V. Strassen. Schnelle multiplikation großer zahlen. Computing, 7:281–292, 1971.
24. Mark N. Wegman and J. Lawrence Carter. New classes and applications of hash functions. In 20th Annual Symposium on Foundations of Computer Science, pages 175–182, San Juan, Puerto Rico, 29–31 October 1979. IEEE.
25. Dominic Welsh. Codes and cryptography. The Clarendon Press Oxford University Press, New York, 1988.