{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:53:35Z","timestamp":1743033215584,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008429"},{"type":"electronic","value":"9783642008436"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00843-6_9","type":"book-chapter","created":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T14:42:08Z","timestamp":1238596928000},"page":"93-101","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Concurrent n poly(logn)-Simulatable Argument of Knowledge"],"prefix":"10.1007","author":[{"given":"Guifang","family":"Huang","sequence":"first","affiliation":[]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Yanshuo","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum Disclosure Proofs of Knowledge. J. of Computer and System Sciences\u00a037(2), 156\u2013189 (1988)","journal-title":"J. of Computer and System Sciences"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-24638-1_7","volume-title":"Theory of Cryptography","author":"B. Barak","year":"2004","unstructured":"Barak, B., Pass, R.: On the Possibility of One-Message Weak Zero-Knowledge. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 121\u2013132. Springer, Heidelberg (2004)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Schoenmakers, B.: Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539701392949","volume":"32","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent Zero- Knowledge Requires (almost) Logarithm Many Rounds. SIAM J. on Computing\u00a032(1), 1\u201347 (2002)","journal-title":"SIAM J. on Computing"},{"unstructured":"On Sigma Protocols, http:\/\/www.daimi.au.dk\/~ivan\/CPT.html","key":"9_CR5"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/276698.276853","volume-title":"30th Annual ACM Symposium on Theory of Computing","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: 30th Annual ACM Symposium on Theory of Computing, pp. 409\u2013418. ACM Press, New York (1998)"},{"key":"9_CR7","first-page":"416","volume-title":"22th Annual ACM Symposium on Theory of Computing","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Witness Indinstinguishable and Witness Hiding Protocols. In: 22th Annual ACM Symposium on Theory of Computing, pp. 416\u2013426. ACM Press, New York (1990)"},{"unstructured":"Secure Multi-Party Computation, http:\/\/www.wisdom.weizmann.ac.il","key":"9_CR8"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundation of Cryptography-Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundation of Cryptography-Basic Tools. Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the Composition of Zero-Knowledge Proof Systems. SIAM J. on Computing.\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM J. on Computing."},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof System. SIAM J. on Computing.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. on Computing."},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Widerson, A.: Proofs that Yields Nothing But Their validity or ALL Languages in $\\mathcal{NP}$ Have Zero Knowledge Proof Systems. J. of ACM.\u00a038(3), 691\u2013729 (1991)","journal-title":"J. of ACM."},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and Properties of Zero-Knowledge Proof Systems. J. of Cryptology.\u00a07(1), 1\u201332 (1994)","journal-title":"J. of Cryptology."},{"key":"9_CR14","first-page":"394","volume-title":"44th Annual IEEE Symposium on Foundations of Computer Science","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: General Composition and Universal Composability in Secure Multi- Party Computation. In: 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 394\u2013403. IEEE Computer Society, Washington (2003)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24638-1_12","volume-title":"Theory of Cryptography","author":"Y. Lindell","year":"2004","unstructured":"Lindell, Y.: Lower Bounds for Concurrent Self Composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 203\u2013222. Springer, Heidelberg (2004)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: Simulation in Quasi-Polynomial Time and Its Application to Protocol Composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00843-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T18:22:31Z","timestamp":1684952551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00843-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008429","9783642008436"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00843-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}