{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:56:50Z","timestamp":1725469010415},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_65","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"753-764","source":"Crossref","is-referenced-by-count":2,"title":["On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Persiano","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. In: FOCS 2002, pp. 345\u2013355 (2002)","DOI":"10.1109\/SFCS.2002.1181957"},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J., Pass, R.: Universally Composable Protocols with Relaxed Set-up Assumptions. In: FOCS 2004, pp. 394\u2013403 (2004)","DOI":"10.1109\/FOCS.2004.71"},{"key":"65_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Eurocrypt 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. In: Eurocrypt 2003. LNCS, vol.\u00a02045, pp. 614\u2013629. Springer, Heidelberg (2003)"},{"key":"65_CR4","series-title":"LNCS","first-page":"442","volume-title":"Advances in Cryptology - CRYPTO 1992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Yung, M.: Certifying cryptographic tools: The case of trapdoor permutations. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 442\u2013460. Springer, Heidelberg (1993)"},{"issue":"6","key":"65_CR5","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., Persiano, G.: Non-Interactive Zero-Knowledge. SIAM J. on Computing\u00a020(6), 1084\u20131118 (1991)","journal-title":"SIAM J. on Computing"},{"key":"65_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, p. 566. Springer, Heidelberg (2001)"},{"key":"65_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-45022-X_38","volume-title":"Automata, Languages and Programming","author":"A. Santis De","year":"2000","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G.: Necessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all NP relations. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, p. 451. Springer, Heidelberg (2000)"},{"key":"65_CR8","doi-asserted-by":"crossref","unstructured":"De Santis, A., Persiano, G.: Zero-Knowledge Proofs of Knowledge Without Interaction. In: FOCS 1992, pp. 427\u2013436 (1992)","DOI":"10.1109\/SFCS.1992.267809"},{"issue":"2","key":"65_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-Malleable Cryptography. SIAM J. on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. on Computing"},{"key":"65_CR10","first-page":"283","volume-title":"FOCS 2000","author":"C. Dwork","year":"2000","unstructured":"Dwork, C., Naor, M.: Zaps and their Applications. In: FOCS 2000, pp. 283\u2013293. IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"1","key":"65_CR11","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 Non-Interactive Zero Knowledge Proofs Under General Assumptions. SIAM J. on Computing\u00a029(1), 1\u201328 (1999)","journal-title":"SIAM J. on Computing"},{"key":"65_CR12","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/100216.100272","volume-title":"STOC 1990","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Witness Indistinguishable and Witness Hiding Protocols. In: STOC 1990, pp. 416\u2013426. ACM, New York (1990)"},{"key":"65_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A Hard-Core Predicate for all One-Way Functions. In: STOC 1989, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"3","key":"65_CR14","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM\u00a038(3), 691\u2013729 (1991)","journal-title":"JACM"},{"key":"65_CR15","series-title":"LNCS","first-page":"578","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Katz","year":"2001","unstructured":"Katz, J., Ostrovsky, R., Smith, A.: Round Efficiency of Multi-Party Computation with a Dishonest Majority. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 578\u2013595. Springer, Heidelberg (2001)"},{"key":"65_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-24676-3_5","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A. Lysyanskaya","year":"2004","unstructured":"Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential Aggregate Signatures from Trapdoor Permutations. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 74\u201390. Springer, Heidelberg (2004)"},{"key":"65_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24676-3_23","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P. MacKenzie","year":"2004","unstructured":"MacKenzie, P., Yang, K.: On Simulation-Sound Trapdoor Commitments. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 382\u2013400. Springer, Heidelberg (2004)"},{"key":"65_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44987-6_23","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"S. Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Min-Round Resettable Zero-Knowledge in the Public-key Model. In: Pfitzmann, B. (ed.) EUROCRYPT 2001, vol.\u00a02045, pp. 373\u2013393. Springer, Heidelberg (2001)"},{"key":"65_CR19","first-page":"3","volume-title":"ISTCS 1993","author":"R. Ostrovsky","year":"1993","unstructured":"Ostrovsky, R., Wigderson, A.: One-Way Functions are Essential for Non-Trivial Zero Knowledge. In: ISTCS 1993, pp. 3\u201317. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"65_CR20","doi-asserted-by":"crossref","unstructured":"Persiano, G., Visconti, I.: On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model (2006) Full version, available at http:\/\/www.dia.unisa.it\/professori\/visconti\/dr.pdf","DOI":"10.1007\/11821069_65"},{"key":"65_CR21","first-page":"543","volume-title":"FOCS 1999","author":"A. Sahai","year":"1993","unstructured":"Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: FOCS 1999, pp. 543\u2013553. IEEE Computer Society Press, Los Alamitos (1993)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:41Z","timestamp":1605644201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11821069_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}