Efficient pseudorandom functions from the decisional linear assumption and weaker variants

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2009, Pages 112-120

  Lewko, Allison B ^a   Waters, Brent ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Decisional linear assumption; Pseudorandom functions

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; DDH ASSUMPTIONS; DDH PROBLEM; KEY SIZES; LINEAR PROBLEMS; PSEUDO-RANDOM FUNCTIONS;

NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 74049161603     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1653662.1653677     Document Type: Conference Paper

References (28)

1. L. Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In Proceedings of the 20th IEEE Foundations of Computer Science Symposium, volume 2656, 1979.
2. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology - CRYPTO '96, volume 1109 of LNCS, pages 1-16. Springer, 1996.
3. M. Bellare and S. Goldwasser. New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. In Advances in Cryptology - CRYPTO '89, volume 435 of LNCS, pages 194-211. Springer, 1990.
4. E. Biham, R. Chen, A. Joux, P. Carribault, C. Lemuet, and W. Jalby. Collisions of sha-0 and reduced sha-1. In Advances in Cryptology - EUROCRYPT 2005, LNCS.
5. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In Advances in Cryptology - CRYPTO 2004, volume 3152 of LNCS, pages 41-55. Springer, 2004.
6. S. Brands. An efficient off-line electronic cash system based on the representation problem. 1993.
7. G. Brassard. Modern cryptology. volume 325 of LNCS. Springer, 1988.
8. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology - CRYPTO '98, volume 1462 of LNCS, pages 13-25. Springer, 1998.
9. T. Dierks and C. Allen. The tls protocol version 1.0. rfc 2246. January 1999.
10. W. Diffie and M. Hellman. New directions in cryptography. In IEEE Transactions in Information Theory, volume 22, pages 644-654, 1976.
11. T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology - CRYPTO ' 84, volume 196 of LNCS, pages 10-18. Springer, 1985.
12. O. Goldreich. Two remarks concerning the goldwasser-micali-rivest signature scheme. In Advances in Cryptology - CRYPTO '84, volume 263 of LNCS, pages 104-110. Springer, 1987.
13. O. Goldreich, S. Goldwasser, and S. Micali. On the cryptographic applications of random functions. In Advances in Cryptology - CRYPTO '84, volume 196 of LNCS, pages 276-288. Springer, 1985.
14. O. Goldriech, S. Goldwasser, and S. Micali. How to construct random functions. In Journal of the ACM, volume 33, pages 792-807, 1986.
15. J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby. Construction of a pseudo-random generator from any one-way function. In SIAM Journal on Computing, volume 28, pages 1364-1396, 1999.
16. D. Hofheinz and E. Kiltz. Secure hybrid encryption from weakened key encapsulation. In Advances in Cryptology - CRYPTO 2007, volume 4622 of LNCS, pages 553-571. Springer, 2007.
17. A. Joux and K. Nguyen. Separating decision diffie-hellman from computational diffie-hellman in cryptographic groups. In Journal of Cryptology, volume 16, pages 239-247, September 2003.
18. D. E. Knuth. In The Art of Computer Programming, volume 3, pages 575-576, 1973.
19. M. Luby. In Pseudo-randomness and applications. Princeton University Press, 1996.
20. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. In IEEE Transactions on Information Theory, volume 39, pages 1639-1646, 1993.
21. S. Micali, M. Rabin, and S. Vadhan. Verifiable random functions. In Proceedings of 40th Annual Symposium on Foundations of Computer Science, pages 120-130, 1999.
22. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, pages 458-467, 1997.
23. J. Pollard. Monte carlo methods for index computations ( mod p). In Mathematics of Computation, volume 32, pages 918-924, 1978.
24. A. Razborov and S. Rudich. Natural proofs. In Journal of Computer and System Sciences, volume 55, pages 24-35, 1997.
25. H. Shacham. A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants. 2007.
26. M. Stadler. Publicly verifiable secret sharing. In Advances in Cryptology - EUROCRYPT '96, volume 1070 of LNCS, pages 190-199. Springer, 1996.
27. L. Valiant. A theory of the learnable. In Communications of the ACM, volume 27, pages 1134-1142, 1984.
28. X. Wang and H. Yu. How to break md5 and other hash functions. In Advances in Cryptology - EUROCRYPT 2005, volume 3494 of LNCS, pages 19-35. Springer, 2005.