Abstract
We consider the symmetric encryption problem which manifests when two parties must securely transmit a message m with a short shared secret key. As we permit arbitrarily powerful adversaries, any encryption scheme must leak information about m - the mutual information between m and its ciphertext cannot be zero. Despite this, we present a family of encryption schemes which guarantee that for any message space in {0,1|n with minimum entropy n - l and for any Boolean function h: {0,1|n → {0,1|, no adversary can predict h(m) from the ciphertext of m with more than 1/n ω(1) advantage; this is achieved with keys of length l+ω)(logn). In general, keys of length l+s yield a bound of 2−θ(s) on the advantage. These encryption schemes rely on no unproven assumptions and can be implemented efficiently.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Noga Alon, Oded Goldreich, Johan Håstad, and René 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.
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.
Eric Bach and Jeffrey Shallit. Algorithmic number theory. Vol. 1. MIT Press, Cambridge, MA, 1996. Efficient algorithms.
M. Bellare, A. Desai, A. Pointcheval, and P. Rogaway. Relations among notions of public-key cryptosystems. In Krawczyk [13], page 540.
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.
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.
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.
Ronald Cramer and Victor Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Krawczyk [13], pages 13–25.
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.
Oded Goldreich. A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptology, 6(1):21–53, 1993.
Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270–299, April 1984.
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, April 1988.
Hugo Krawczyk, editor. Advances in Cryptology-CRYPTO’ 98, volume 1462 of Lecture Notes in Computer Science. Springer-Verlag, 23–27 August 1998.
Rudolf Lidl and Harald Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company, Reading, Massachusetts, 1983.
Ueli M. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53–66, 1992.
Joseph Naor and Moni Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838–856, August 1993.
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.
Rene Peralta. On the distribution of quadratic residues and nonresidues modulo a prime number. Mathematics of Computation, 58(197):433–440, 1992.
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.
E. G. Rees. Notes on Geometry. Springer-Verlag, 1983.
A. Schönhage. Schnelle berechnung von kettenbruchentwicklungen. Acta Informatica, 1:139–144, 1971.
A. Schönhage. Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2. Acta Informat., 7(4):395–398, 1976/77.
A. Schönhage and V. Strassen. Schnelle multiplikation groβer zahlen. Computing, 7:281–292, 1971.
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.
Dominic Welsh. Codes and cryptography. The Clarendon Press Oxford University Press, New York, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Russell, A., Wang, H. (2002). How to Fool an Unbounded Adversary with a Short Key. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive