{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T23:18:16Z","timestamp":1769469496715,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741428","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74143-5_17","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T13:51:33Z","timestamp":1186667493000},"page":"303-322","source":"Crossref","is-referenced-by-count":29,"title":["Simulatable VRFs with Applications to Multi-theorem NIZK"],"prefix":"10.1007","author":[{"given":"Melissa","family":"Chase","sequence":"first","affiliation":[]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective id secure identity based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","first-page":"54","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 54\u201373. Springer, Heidelberg (2004)"},{"key":"17_CR3","first-page":"225","volume-title":"11th ACM CCS","author":"E. Brickell","year":"2004","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: 11th ACM CCS, pp. 225\u2013234. ACM press, New York (2004)"},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S.: Non-interactive zero knowledge. SIAM Journal of Computing\u00a020(6), 1084\u20131118 (1991)","journal-title":"SIAM Journal of Computing"},{"key":"17_CR5","first-page":"103","volume-title":"20th Annual ACM STOC","author":"M. Blum","year":"1988","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th Annual ACM STOC, pp. 103\u2013112. ACM Press, New York (1988)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"17_CR7","first-page":"62","volume-title":"1st ACM CCS","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: 1st ACM CCS, pp. 62\u201373. ACM press, New York (1993)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Brands, S.: Rethinking Public Key Infrastructure and Digital Certificates\u2014 Building in Privacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands (1999)","DOI":"10.7551\/mitpress\/5931.001.0001"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. Technical Report Research Report RZ 3419, IBM Research Division (May 2002)","DOI":"10.1145\/586110.586114"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 229\u2013235. Springer, Heidelberg (2000)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/3-540-63165-8_225","volume-title":"Automata, Languages and Programming","author":"A. Santis De","year":"1997","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G.: Randomness-efficient non-interactive zero-knowledge (extended abstract). In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 716\u2013726. Springer, Heidelberg (1997)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-48184-2_5","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"A. Santis De","year":"1988","unstructured":"De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge proof systems. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 52\u201372. Springer, Heidelberg (1988)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In: FOCS, pp. 283\u2013293 (2000)","DOI":"10.1109\/SFCS.2000.892117"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36288-6_1","volume-title":"Public Key Cryptography - PKC 2003","author":"Y. Dodis","year":"2002","unstructured":"Dodis, Y.: Efficient construction of (distributed) verifiable random functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 1\u201317. Springer, Heidelberg (2002)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013432. Springer, Heidelberg (2005)"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple noninteractive zero knowledge proofs under general assumptions. SIAM Journal on Computing\u00a029(1), 1\u201328 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"17_CR19","first-page":"102","volume-title":"44th FOCS","author":"S. Goldwasser","year":"2003","unstructured":"Goldwasser, S., Tauman Kalai, Y.: On the (in)security of the Fiat-Shamir paradigm. In: 44th FOCS, pp. 102\u2013115. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","first-page":"224","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"S. Goldwasser","year":"1993","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant signatures and non-interactive zero-knowledge proofs are equivalent. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 224\u2013228. Springer, Heidelberg (1993)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11761679_21","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 339\u2013358. Springer, Heidelberg (2006)"},{"issue":"4","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal of Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001459900032","volume":"11","author":"J. Kilian","year":"1998","unstructured":"Kilian, J., Petrank, E.: An efficient noninteractive zero-knowledge proof system for NP with general assumptions. Journal of Cryptology\u00a011(1), 1\u201327 (1998)","journal-title":"Journal of Cryptology"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A. Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 597\u2013612. Springer, Heidelberg (2002)"},{"key":"17_CR25","first-page":"120","volume-title":"40th FOCS","author":"S. Micali","year":"1999","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: 40th FOCS, pp. 120\u2013130. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"2","key":"17_CR26","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 51\u2013158 (1991)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:18:05Z","timestamp":1605763085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741428"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_17","relation":{},"subject":[]}}