Efficient construction of (distributed) verifiable random functions

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

Volumn 2567, Issue , 2002, Pages 1-17

  Dodis, Yevgeniy ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

DECISIONAL DIFFIE HELLMAN; EFFICIENT CONSTRUCTION; GENERIC TRANSFORMATIONS; INDISTINGUISHABILITY; PSEUDO-RANDOM FUNCTIONS; PUBLICLY VERIFIABLE; RANDOM ORACLE MODEL; VERIFIABLE RANDOM FUNCTION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84958742006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36288-6_1     Document Type: Conference Paper

References (21)

1. Noga Alon and Joel Spencer. Probabilistic Method. Wiley, John and Sons, 1998.
2. Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communication Security, pages 62-73, November 1993. Revised version appears in http://www-cse.ucsd.edu/users/mihir/papers/crypto-papers.html.
3. Dan Boneh and Matthew Franklin. Identity based encryption from the weil pairing. In Kilian [11], pages 213-229.
4. Dan Boneh and Alice Silverberg. Applications of multilinear forms to cryptography. IACR E-print Archive. Available from http://eprint.iacr.org/2002/080/, 1989.
5. Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 209-218, Dalla, Texas, 23-26 May 1998.
6. Yevgeniy Dodis. Efficient construction of (distributed) verifiable random functions. IACR E-print Archive. Available from http://eprint.iacr.org/2002/133/, 2001.
7. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25-32, Seattl, Washington, 15-17 May 1989.
8. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the ACM, 33(4): 792-807, October 1986.
9. Antoine Joux. A one-round protocol for tripartite diffie-hellman. In ANTS-IV Conference, volume 1838 of Lecture Notes in Computer Science, pages 385-394. Spring-Verlag, 2000.
10. Antoine Joux and Kim Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. IACR E-print Archive. Available from http://eprint.iacr.org/2001/003/, 2005.
11. Joe Kilian, editor. Advances in Cryptology-CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science. Springer-Verlag, 19-23 August 2001.
12. Anna Lysyanskaya. Unique signatures and verifiable random functions from the dh-ddh separation. In Yung [21].
13. Silvio Micali, Michael Rabin, and Salil Vadhan. Verifiable random functions. In 40th Annual Symposium on Foundations of Computer Science, pages 120-130, New York, October 1999. IEEE.
14. Silvio Micali and Ray Sidney. A simple method for generating and sharing pseudo-random functions. In Don Coppersmith, editor, Advances in Cryptology- CRYPTO '95, volume 963 of Lecture Notes in Computer Science, pages 185-196. Springe-Verlag, 27-31 August 1995.
15. Moni Naor, Benny Pinkas, and Omer Reingold. Distributed pseudo-random functions and KDCs. In Stern [20], pages 327-346.
16. Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, pages 458-467, Miami Beach, Florida, 20-22 October 1997. IEEE.
17. Jesper Nielsen. Threshold pseudorandom function construction and its applications. In Yung [21].
18. Adi Shamir. How to share a secret. Communications of the ACM, 22(11): 612-613, 1979.
19. Michael Steiner, Tsudik G., and Michael Waidner. Diffie-hellman key distribution extended to group communicatio. In Third ACM Conference on Computer and Communication Security, pages 31-37. AC, March 14-16 1996.
20. Jacques Stern, editor. Advances in Cryptology-EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science. Springer-Verlag, 2-6 May 1999.
21. Moti Yung, editor. Advances in Cryptology-CRYPTO 2002, Lecture Notes in Computer Science. Springer-Verlag, 18-22 August 2002.