{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:36:41Z","timestamp":1737178601586,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002635"},{"type":"electronic","value":"9783540362319"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36231-2_8","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T15:21:45Z","timestamp":1183389705000},"page":"79-92","source":"Crossref","is-referenced-by-count":0,"title":["Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System"],"prefix":"10.1007","author":[{"given":"Olaf","family":"M\u00fcller","sequence":"first","affiliation":[]},{"given":"Michael","family":"N\u00fcsken","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1137\/0217012","volume":"17","author":"E. Bach","year":"1988","unstructured":"Eric Bach (1988). How to generate factored random numbers. SIAM Journal on Computing17(2), 179\u2013193. ISSN 0097\u20135397. Special issue on cryptography.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR2","unstructured":"Boaz Barak (2001). How to Go Beyond the Black-Box Simulation Barrier. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, Las Vegas NV. IEEE Computer Society Press. ISBN 0-7695-1390-5. URL http:\/\/www.wisdom.weizmann.ac.il\/mathusers\/boaz\/Papers\/nonbb.html . Preliminary full version."},{"key":"8_CR3","unstructured":"Jurjen Bos, David Chaum & George Purdy (1988). A Voting Scheme. Presented at the rump session of CYRPTO\u201988 (does not appear in the proceedings)."},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00204448","volume":"2","author":"J. F. Boyar","year":"1990","unstructured":"Joan F. Boyar, Stuart A. Kurtz & Mark W. Krentel (1990). A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. Journal of Cryptology2(2), 63\u201376. ISSN 0933-2790.","journal-title":"Journal of Cryptology"},{"key":"8_CR5","unstructured":"Ran Canetti, Oded Goldreich, Shafi Goldwasser & Silvio Micali (1999). Resettable Zero-Knowledge. Electronic Colloquium on Computational Complexity TR99\u2013042, 1\u201364. ISSN 1433\u20138092. ftp:\/\/ftp.eccc.uni-trier.de\/pub\/eccc\/reports\/1999\/TR99-042\/Paper.ps ."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Oded Goldreich, Shafi Goldwasser & Silvio Micali (2000a). Resettable Zero-Knowledge. In Proceedings of the Thirty-second Annual ACM Symposium on the Theory of Computing, Portland OR, 235\u2013244. ACM Press.","DOI":"10.1145\/335305.335334"},{"key":"8_CR7","unstructured":"Ran Canetti, Oded Goldreich, Shafi Goldwasser & Silvio Micali (2000b). Resettable Zero-Knowledge. Electronic Colloquium on Computational Complexity TR99\u2013042(Revision 1), 1\u201360. ISSN 1433-8092. ftp:\/\/ftp.eccc.uni-trier.de\/pub\/eccc\/reports\/1999\/TR99-042\/revisn01.ps ."},{"key":"8_CR8","unstructured":"Ran Canetti, Joe Kilian, Erez Petrank & Alon Rosen (2001). Black-Box Concurrent Zero-Knowledge Requires $$ \\tilde \\Omega \\left( {\\log {\\mathbf{ }}n} \\right) $$ Rounds. In Proceedings of the Thirtythird Annual ACM Symposium on the Theory of Computing, Hersonissos, Crete, Greece, 570\u2013579. ACM Press, 1515 Broadway, New York, New York 10036. ISBN 1-58113-349-9."},{"key":"8_CR9","series-title":"Lect Notes Comput Sci","isbn-type":"print","first-page":"87","volume-title":"Multiparty Computations Ensuring Privacy of Each Party\u2019s Input and Correctness of the Result","author":"D. Chaum","year":"1987","unstructured":"David Chaum, Ivan Damg\u00e5rd & Jeroen van de Graaf (1987). Multiparty Computations Ensuring Privacy of Each Party\u2019s Input and Correctness of the Result. In Advances in Cryptology: Proceedings of CRYPTO\u2019 87, Santa Barbara CA, Carl Pomerance, editor, number 293 in Lecture Notes in Computer Science, 87\u2013119. Springer-Verlag. ISBN 3-540-18796-0. ISSN 0302-9743.","ISBN":"https:\/\/id.crossref.org\/isbn\/3540187960"},{"key":"8_CR10","unstructured":"D. Chaum, E. van Heijst & B. Pfitzmann (1992). Cryptograhically strong undeniable signatures, unconditionally secure for the signer. In Feigenbaum (1992), 470-484. http:\/\/link.springer.de\/link\/service\/series\/0558\/tocs\/t0576.htm ."},{"key":"8_CR11","unstructured":"Danny Dolev, Cynthia Dwork & Moni Naor (1991). Non-Malleable Cryptography. In Proceedings of the Twenty-third Annual ACM Symposium on the Theory of Computing, New Orleans LA, 542\u2013552. ACM Press. http:\/\/citeseer.nj.nec.com\/dolev91nonmalleable.html ."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Uriel Feige, Dror Lapidot & Adi Shamir (1999). Multiple noninteractive zero knowledge proofs under general assumptions. SIAM Journal on Computing29(1), 1\u201328. ISSN 0097-5397, 1095-7111. http:\/\/epubs.siam.org\/sam-bin\/dbq\/article\/23001 .","journal-title":"SIAM Journal on Computing"},{"key":"8_CR13","series-title":"Lect Notes Comput Sci","isbn-type":"print","volume-title":"Advances in Cryptology","year":"1992","unstructured":"J. Feigenbaum (editor) (1992). Advances in Cryptology: Proceedings of CRYPTO\u2019 91, Santa Barbara CA, number 576 in Lecture Notes in Computer Science. Springer-Verlag, Berlin. ISBN 3-540-55188-3. ISSN 0302-9743. http:\/\/link.springer.de\/link\/service\/series\/0558\/tocs\/t0576.htm .","ISBN":"https:\/\/id.crossref.org\/isbn\/3540551883"},{"key":"8_CR14","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Oded Goldreich (2001). Foundations of Cryptography. Cambridge University Press, Cambridge. ISBN 0-521-79172-3.","ISBN":"https:\/\/id.crossref.org\/isbn\/0521791723"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Oded Goldreich & Ariel Kahan (1996). How to construct constant-round zeroknowledge proof systems for NP. Journal of Cryptology9(3), 167\u2013189.","journal-title":"Journal of Cryptology"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Joe Kilian, Erez Petrank & Charles Rackoff (1998). Lower Bounds for Zero Knowledge on the Internet. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto CA, 484\u2013492. IEEE Computer Society Press, Palo Alto, CA.","DOI":"10.1109\/SFCS.1998.743499"},{"key":"8_CR17","unstructured":"Joe Kilian, Erez Petrank & Ransom Richardson (2001). On Concurrent and Resettable Zero-Knowledge Proofs for NP. http:\/\/www.cs.technion.ac.il\/~erez\/czkub-full.ps . Preprint."},{"key":"8_CR18","unstructured":"Torben Pryds Pedersen (1992). Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Feigenbaum (1992), 129\u2013140. http:\/\/link.springer.de\/link\/service\/series\/0558\/bibs\/0576\/05760129.htm ."},{"key":"8_CR19","series-title":"Lect Notes Comput Sci","isbn-type":"print","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"On the concurrent composition of zeroknowledge proofs","author":"R. Richardson","year":"1999","unstructured":"Ransom Richardson & Joe Kilian (1999). On the concurrent composition of zeroknowledge proofs. In Advances in Cryptology: Proceedings of EUROCRYPT 1999, Prague, Czech Republic, Jacques Stern, editor, number 1592 in Lecture Notes in Computer Science, 415\u2013431. ISBN 3-540-65889-0. ISSN 0302-9743.","ISBN":"https:\/\/id.crossref.org\/isbn\/3540658890"},{"key":"8_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"A Note on the Round-Complexity of Concurrent Zero-nowledge","author":"A. Rosen","year":"2000","unstructured":"Alon Rosen (2000). A Note on the Round-Complexity of Concurrent Zero-nowledge. In Advances in Cryptology: Proceedings of CRYPTO\u2019 00, Santa Barbara CA, M. Bellare, editor, number 1880 in Lecture Notes in Computer Science, 451\u2013468. Springer-Verlag. ISSN 0302-9743. http:\/\/link.springer.de\/link\/service\/series\/0558\/bibs\/1880\/18800451.htm ."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36231-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T02:48:33Z","timestamp":1737168513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36231-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002635","9783540362319"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36231-2_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}