{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:15:53Z","timestamp":1773717353118,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440505","type":"print"},{"value":"9783540457084","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45708-9_38","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T04:48:16Z","timestamp":1192769296000},"page":"597-612","source":"Crossref","is-referenced-by-count":106,"title":["Unique Signatures and Verifiable Random Functions from the DH-DDH Separation"],"prefix":"10.1007","author":[{"given":"Anna","family":"Lysyanskaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"issue":"6","key":"38_CR1","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Manuel Blum, Alfredo Santis, Silvio Micali, and Guiseppe Persiano. Non-interactive zero-knowledge. SIAM Journal of Computing, 20(6):1084\u20131118, 1991.","journal-title":"SIAM Journal of Computing"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Matthew Franklin. Identity-based encryption from the Weil pairing. In Joe Kilian, editor, Advances in Cryptology-CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 213\u2013229. Springer Verlag, 2001.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Manuel Blum, Paul Feldman, and Silvio Micali. Non-interactive zeroknowledge and its applications (extended abstract). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 103\u2013112, Chicago, Illinois, 2\u20134 May 1988.","DOI":"10.1145\/62212.62222"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the Weil pairing. In Colin Boyd, editor, Advances in Cryptology-ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 514\u2013532. Springer Verlag, 2001.","DOI":"10.1007\/3-540-45682-1_30"},{"issue":"4","key":"38_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850\u2013863, November 1984.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Alice Silverberg. Applications of multilinear forms to cryptography. Manuscript obtained by personal communication, 2002.","DOI":"10.1090\/conm\/324\/05731"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s001459900009","volume":"9","author":"M. Bellare","year":"1996","unstructured":"Mihir Bellare and Moti Yung. Certifying permutations: Non-interactive zero-knowledge based on any trapdoor permutation. Journal of Cryptology, 9(1):149\u2013166, 1996.","journal-title":"Journal of Cryptology"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46\u201352. ACM press, nov 1999.","DOI":"10.1145\/319709.319716"},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Uriel Feige, Dror Lapidot, and Adi Shamir. Multiple noninteractive zero knowledge proofs under general assumptions. SIAM Journal on Computing, 29(1):1\u201328, 1999.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"38_CR10","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the ACM, 33(4):792\u2013807, October 1986.","journal-title":"Journal of the ACM"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Shai Halevi, and Tal Rabin. Secure hash-and-sign signatures without the random oracle. In Jacques Stern, editor, Advances in Cryptology-EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 123\u2013139. Springer Verlag, 1999.","DOI":"10.1007\/3-540-48910-X_9"},{"issue":"2","key":"38_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Shafi Goldwasser, Silvio Micali, and Ronald Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR13","series-title":"Lect Notes Comput Sci","first-page":"228","volume-title":"Advances in Cryptology-CRYPTO\u2019 92","author":"S. Goldwasser","year":"1992","unstructured":"Shafi Goldwasser and Rafail Ostrovsky. Invariant signatures and noninteractive zero-knowledge proofs are equivalent. In Ernest F. Brickell, editor, Advances in Cryptology-CRYPTO\u2019 92, pages 228\u2013244. Springer-Verlag, 1992. Lecture Notes in Computer Science No. 740."},{"key":"38_CR14","unstructured":"Antoine Joux and Kim Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Manuscript. Available from http:\/\/www.eprint.iacr.org, 2001 ."},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Antoine Joux. A one-round protocol for tripartite Diffe-Hellman. In Proceedings of the ANTS-IV conference, volume 1838 of Lecture Notes in Computer Science, pages 385\u2013394. Springer-Verlag, 2000.","DOI":"10.1007\/10722028_23"},{"key":"38_CR16","unstructured":"Silvio Micali. 6.875: Introduction to cryptography. MIT course taught in Fall 1997."},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Silvio Micali and Leonid Reyzin. Soundness in the public-key model. In Joe Kilian, editor, Advances in Cryptology-CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 542\u2013565. Springer Verlag, 2001.","DOI":"10.1007\/3-540-44647-8_32"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Silvio Micali and Ronald L. Rivest. Micropayments revisited. In Bart Preneel, editor, Proceedings of the Cryptographer\u2019s Track at the RSA Conference, volume 2271 of Lecture Notes in Computer Science, pages 149\u2013163. Springer Verlag, 2002.","DOI":"10.1007\/3-540-45760-7_11"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Silvio Micali, Michael Rabin, and Salil Vadhan. Verifiable random functions. In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), pages 120\u2013130. IEEE Computer Society Press, 1999.","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions. In Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), 1997.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"38_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology-CRYPTO\u2019 84","author":"A. Shamir","year":"1985","unstructured":"Adi Shamir. Identity-based cryptosystems and signature schemes. In George Robert Blakley and David Chaum, editors, Advances in Cryptology-CRYPTO\u2019 84, volume 196 of Lecture Notes in Computer Science, pages 47\u201353. Springer Verlag, 1985."},{"key":"38_CR22","unstructured":"Madhu Sudan. Algorithmic introduction to coding theory. MIT course taught in Fall 2001. Lecture notes available from http:\/\/www.theory.lcs.mit.edu\/~madhu\/FT01\/ ."},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Eric Verheul. Self-blindable credential certificates from the weil pairing. In Colin Boyd, editor, Advances in Cryptology-ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 533\u2013551. Springer Verlag, 2001.","DOI":"10.1007\/3-540-45682-1_31"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45708-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:27:49Z","timestamp":1556904469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45708-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440505","9783540457084"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45708-9_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}