{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:42Z","timestamp":1766281002616,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003243"},{"type":"electronic","value":"9783540362883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_1","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:45:01Z","timestamp":1180903501000},"page":"1-17","source":"Crossref","is-referenced-by-count":73,"title":["Efficient Construction of (Distributed) Verifiable Random Functions"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Noga Alon and Joel Spencer. Probabilistic Method. Wiley, John and Sons, 2000. 9","DOI":"10.1002\/0471722154"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"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\u201373, November 1993. Revised version appears in http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/crypto-papers.html. 1","DOI":"10.1145\/168588.168596"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Matthew Franklin. Identity based encryption from the weil pairing. In Kilian [11], pages 213\u2013229. 7","DOI":"10.1007\/3-540-44647-8_13"},{"key":"1_CR4","unstructured":"Dan Boneh and Alice Silverberg. Applications of multilinear forms to cryptography. IACR E-print Archive. Available from http:\/\/eprint.iacr.org\/2002\/080\/ 2002. 7"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013218, Dallas, Texas, 23\u201326 May 1998. 1","DOI":"10.1145\/276698.276741"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Yevgeniy Dodis. Efficient construction of (distributed) verifiable random functions. IACR E-print Archive. Available from http:\/\/eprint.iacr.org\/2002\/133\/ , 2002. 10","DOI":"10.1007\/3-540-36288-6_1"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"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\u201332, Seattle, Washington, 15\u201317 May 1989. 3","DOI":"10.1145\/73007.73010"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Oded Goldreich, Sha. Goldwasser, and Silvio Micali. How to construct random functions. Journal of the ACM, 33(4):792\u2013807, October 1986. 2, 5","journal-title":"Journal of the ACM"},{"key":"1_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"A one-round protocol for tripartite diffie-hellman","author":"A. Joux","year":"2000","unstructured":"Antoine Joux. A one-round protocol for tripartite diffie-hellman. In ANTS-IV Conference, volume 1838 of Lecture Notes in Computer Science, pages 385\u2013394. Spring-Verlag, 2000. 1"},{"key":"1_CR10","unstructured":"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\/ , 2001. 1, 4, 7"},{"key":"1_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014CRYPTO 2001","year":"2001","unstructured":"Joe Kilian, editor. Advances in Cryptology\u2014CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science. Springer-Verlag, 19\u201323 August 2001. 16"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Anna Lysyanskaya. Unique signatures and verifiable random functions from the dh-ddh separation. In Yung [21]. 1, 2, 3, 5, 6, 7, 10","DOI":"10.1007\/3-540-45708-9_38"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Silvio Micali, Michael Rabin, and Salil Vadhan. Verifiable random functions. In 40th Annual Symposium on Foundations of Computer Science, pages 120\u2013130, New York, October 1999. IEEE. 1, 2, 3","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"1_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44750-4_15","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 95","author":"S. Micali","year":"1995","unstructured":"Silvio Micali and Ray Sidney. A simple method for generating and sharing pseudo-random functions. In Don Coppersmith, editor, Advances in Cryptology\u2014CRYPTO\u2019 95, volume 963 of Lecture Notes in Computer Science, pages 185\u2013196. Springer-Verlag, 27\u201331 August 1995. 3"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Moni Naor, Benny Pinkas, and Omer Reingold. Distributed pseudo-random functions and KDCs. In Stern [20], pages 327\u2013346. 3","DOI":"10.1007\/3-540-48910-X_23"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, pages 458\u2013467, Miami Beach, Florida, 20\u201322 October 1997. IEEE. 1, 2, 4, 5, 6, 9","DOI":"10.1109\/SFCS.1997.646134"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Jesper Nielsen. Threshold pseudorandom function construction and its applications. In Yung [21]. 1, 4, 5, 13","DOI":"10.1007\/3-540-45708-9_26"},{"issue":"11","key":"1_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612\u2013613, 1979. 15","journal-title":"Communications of the ACM"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Michael Steiner, Gene Tsudik, and Michael Waidner. Diffie-hellman key distribution extended to group communicatio. In Third ACM Conference on Computer and Communication Security, pages 31\u201337. ACM, March 14\u201316 1996. 7, 9","DOI":"10.1145\/238168.238182"},{"key":"1_CR20","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 99","year":"May","unstructured":"Jacques Stern, editor. Advances in Cryptology\u2014EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science. Springer-Verlag, 2\u20136 May 1999. 16"},{"key":"1_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014CRYPTO 2002","year":"2002","unstructured":"Moti Yung, editor. Advances in Cryptology\u2014CRYPTO 2002, Lecture Notes in Computer Science. Springer-Verlag, 18\u201322 August 2002. 16, 17"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:03:53Z","timestamp":1737065033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}