{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:18:41Z","timestamp":1749010721776,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_23","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"281-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits"],"prefix":"10.1007","author":[{"given":"Ning","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanli","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"23_CR1","unstructured":"Ananth, P., Boneh, D., Garg, S., Sahai, A., Zhandry, M.: Differing-inputs obfuscation and applications. In: IACR Cryptology ePrint Archive 2013, p. 689 (2013)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: IEEE Conference on Computational Complexity, pp. 194\u2013203 (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"key":"23_CR4","unstructured":"Blum, M.: Coin flipping by telephone. In: Gersho, A. (ed.) CRYPTO, pp. 11\u201315, U. C. Santa Barbara, Dept. of Elec. and Computer Eng., ECE Report No. 82-04 (1981)"},{"key":"23_CR5","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1987)"},{"issue":"2","key":"23_CR6","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. Comput. Syst. Sci. 37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-13190-5"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/978-3-319-13257-0_8","volume-title":"Information Security","author":"N Ding","year":"2014","unstructured":"Ding, N.: Obfuscation-based non-black-box extraction and constant-round zero-knowledge arguments of knowledge. In: Chow, S.S.M., Camenisch, J., Hui, L.C.K., Yiu, S.M. (eds.) ISC 2014. LNCS, vol. 8783, pp. 120\u2013139. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10.1007\/978-3-319-13257-0_8"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","first-page":"51","volume-title":"Information Theoretic Security","author":"N Ding","year":"2015","unstructured":"Ding, N.: On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits. In: Lehmann, A., Wolf, S. (eds.) Information Theoretic Security. LNCS, vol. 9063, pp. 51\u201368. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-17470-9_4"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015","year":"2015","unstructured":"Dodis, Y., Nielsen, J.B. (eds.): TCC 2015. LNCS, vol. 9015. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-662-46497-7"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC, pp. 416\u2013426. ACM (1990)","DOI":"10.1145\/100216.100272"},{"key":"23_CR12","unstructured":"Fischlin, M.: Trapdoor commitment schemes and their applications. Ph.D. thesis, Fachbereich Mathematik Johann Wolfgang Goethe-Universit at Frankfurt am Main (2001)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-662-44371-2_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 518\u2013535. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10.1007\/978-3-662-44371-2_29"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptol. 9(3), 167\u2013190 (1996)","journal-title":"J. Cryptol."},{"issue":"1","key":"23_CR15","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 systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Pandey, O., Sahai, A.: Public-coin differing-inputs obfuscation and its applications. In: Dodis and Nielsen [10], pp. 668\u2013697. http:\/\/dx.doi.org\/10.1007\/978-3-662-46497-7_26","DOI":"10.1007\/978-3-662-46497-7_26"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-38424-3_26","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"D Lapidot","year":"1991","unstructured":"Lapidot, D., Shamir, A.: Publicly verifiable non-interactive zero-knowledge proofs. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 353\u2013365. Springer, Heidelberg (1991)"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s00145-012-9132-7","volume":"26","author":"Y Lindell","year":"2013","unstructured":"Lindell, Y.: A note on constant-round zero-knowledge proofs of knowledge. J. Cryptol. 26(4), 638\u2013654 (2013)","journal-title":"J. Cryptol."},{"key":"23_CR19","unstructured":"Ostrovsky, R., Visconti, I.: Simultaneous resettability from collision resistance. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 19, p. 164 (2012). http:\/\/dblp.uni-trier.de\/db\/journals\/eccc\/eccc19.html#OstrovskyV12"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Pandey, O., Prabhakaran, M., Sahai, A.: Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP. In: Dodis and Nielsen [10], pp. 638\u2013667. http:\/\/dx.doi.org\/10.1007\/978-3-662-46497-7_25","DOI":"10.1007\/978-3-662-46497-7_25"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T02:14:26Z","timestamp":1749003266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"20 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}