Algebraic pseudorandom functions with improved efficiency from the augmented cascade

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2010, Pages 131-140

  Boneh, Dan ^a   Montgomery, Hart W ^a   Raghunathan, Ananth ^a  

^a Stanford University   (United States)

Author keywords

Algorithms; Security; Theory

Indexed keywords

ALGEBRAIC STRUCTURES; PSEUDORANDOM FUNCTIONS; SECURITY; THEORY; VERIFIABLE RANDOM FUNCTION;

ALGORITHMS;

ALGEBRA;

EID: 78650021967     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1866307.1866323     Document Type: Conference Paper

References (30)

1. Michel Abdalla, Dario Catalano, and Dario Fiore. Verifiable random functions from identity-based key encapsulation. In EUROCRYPT'09, pages 554-571, 2009.
2. Man Ho Au, Willy Susilo, and Yi Mu. Practical compact e-cash. In proc. of ACISP'07, pages 431-445, 2007.
3. Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya. Compact e-cash and simulatable vrfs revisited. In Pairing'09, pages 114-131, 2009.
4. Mihir Bellare. New proofs for NMAC and HMAC: Security without collision-resistance. In Crypto'06, pages 602-619, 2006.
5. Mihir Bellare, Ran Canetti, and Hugo Krawczyk. Keying hash functions for message authentication. In CRYPTO'96, pages 1-15, 1996.
6. Mihir Bellare, Ran Canetti, and Hugo Krawczyk. Pseudorandom functions revisited: The cascade construction and its concrete security. In FOCS'96, 1996.
7. Dan Bernstein. Syn cookies, 1996. http://cr.yp.to/syncookies.html.
8. Dan Boneh and Xavier Boyen. Efficient selective-ID identity based encryption without random oracles. In Advances in Cryptology EUROCRYPT 2004, volume 3027 of LNCS, pages 223-38. Springer-Verlag, 2004.
9. Dan Boneh and Xavier Boyen. Secure identity based encryption without random oracles. In Matt Franklin, editor, Advances in Cryptology CRYPTO 2004, volume 3152 of LNCS, pages 443-59. Springer-Verlag, 2004.
10. Dan Boneh and Xavier Boyen. Short signatures without random oracles. In Advances in Cryptology EUROCRYPT 2004, volume 3027 of LNCS, pages 56-73. Springer-Verlag, 2004.
11. Dan Boneh, Xavier Boyen, and Eu-Jin Goh. Hierarchical identity based encryption with constant size ciphertext. In Advances in Cryptology EUROCRYPT 2005, volume 3494 of LNCS. Springer-Verlag, 2005.
12. Dan Boneh, Xavier Boyen, and Hovav Shacham. Short group signatures. In Advances in Cryptology CRYPTO 2004, volume 3152 of LNCS, pages 41-55. Springer, 2004.
13. Dan Boneh, Shai Halevi, Michael Hamburg, and Rafail Ostrovsky. Circular-secure encryption from decision diffe-hellman. In CRYPTO'08, pages 108-125, 2008.
14. Dan Boneh and James Shaw. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory, 44(5):1897-1905, 1998.
15. Melissa Chase and Anna Lysyanskaya. Simulatable VRFs with applications to multi-theorem NIZK. In CRYPTO'07, pages 303-322, 2007.
16. Scott Crosby and Dan Wallach. Denial of service via algorithmic complexity attacks. In 12th Usenix Security Symposium, 2003.
17. Yevgeniy Dodis. Efficient construction of (distributed) verifiable random functions. In Public Key Cryptography, pages 1-17, 2003.
18. Yevgeniy Dodis and Aleksandr Yampolskiy. A verifiable random function with short proofs and keys. In Public Key Cryptography, pages 416-431, 2005.
19. Michael Freedman, Yuval Ishai, Benny Pinkas, and Omer Reingold. Keyword search and oblivious pseudorandom functions. In TCC, pages 303-324, 2005.
20. Oded Goldreich, Shaff Goldwasser, and Silvio Micali. How to construct random functions. J. ACM, 34(4):792-807, 1986.
21. Dennis Hofheinz and Eike Kiltz. Secure hybrid encryption from weakened key encapsulation. In CRYPTO'07, pages 553-571, 2007.
22. Susan Hohenberger and Brent Waters. Constructing verifiable random functions with large input spaces. In Eurocrypto 2010, 2010.
23. Stanislaw Jarecki and Xiaomin Liu. Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection. In TCC'09, pages 577-594, 2009.
24. Allison Lewko and Brent Waters. Efficient pseudorandom functions from the decisional linear assumption and weaker variants. In ACM CCS, pages 112-120, 2009.
25. Anna Lysyanskaya. Unique signatures and verifiable random functions from the DH-DDH separation. In Advances in Cryptology CRYPTO 2002, LNCS. Springer-Verlag, 2002.
26. Silvio Micali, Michael O. Rabin, and Salil P. Vadhan. Verifiable random functions. In FOCS, pages 120-130, 1999.
27. Victor Miller. The Weil pairing, and its efficient calculation. Journal of Cryptology, 17(4), 2004.
28. Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions. In FOCS'97, pages 458-67, 1997.
29. H. Shacham. A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants. Cryptology ePrint Archive, Report 2007/074, 2007. http://eprint.iacr.org/.
30. Brent Waters. Efficient identity-based encryption without random oracles. In Advances in Cryptology EUROCRYPT 2005, volume 3494 of LNCS. Springer-Verlag, 2005.