{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:35:49Z","timestamp":1725870949864},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319491745"},{"type":"electronic","value":"9783319491752"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49175-2_10","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T11:59:42Z","timestamp":1478692782000},"page":"190-212","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Ranellucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Tapp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Zakarias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 1988","author":"M Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, J., Micali, S., Rogaway, P.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 37\u201356. Springer, Heidelberg (1990). doi: 10.1007\/0-387-34799-2_4"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/0-387-34805-0_45","volume-title":"Advances in Cryptology \u2014 CRYPTO 1989 Proceedings","author":"J Boyar","year":"1990","unstructured":"Boyar, J., Peralta, R.: On the concrete complexity of zero-knowledge proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 507\u2013525. Springer, Heidelberg (1990). doi: 10.1007\/0-387-34805-0_45"},{"key":"10_CR3","doi-asserted-by":"crossref","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, 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067","DOI":"10.1109\/SFCS.2001.959888"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48000-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Cohen, A., Lindell, Y.: A simpler variant of universally composable security for standard multiparty computation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 3\u201322. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48000-7_1"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44647-8_2"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-662-46447-2_22","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"I Cascudo","year":"2015","unstructured":"Cascudo, I., Damg\u00e5rd, I., David, B., Giacomelli, I., Nielsen, J.B., Trifiletti, R.: Additively homomorphic UC commitments with optimal amortized overhead. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 495\u2013515. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46447-2_22"},{"key":"10_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.: Secure Multiparty Computation and Secret Sharing, 1st edn. Cambridge University Press, Cambridge (2015)","edition":"1"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"Advances in Cryptology \u2014 CRYPT0 1995","author":"C Cr\u00e9peau","year":"1995","unstructured":"Cr\u00e9peau, C., van de Graaf, J., Tapp, A.: Committed oblivious transfer and private multi-party computation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 110\u2013123. Springer, Heidelberg (1995). doi: 10.1007\/3-540-44750-4_9"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-662-45608-8_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"I Damg\u00e5rd","year":"2014","unstructured":"Damg\u00e5rd, I., David, B., Giacomelli, I., Nielsen, J.B.: Compact VSS and efficient homomorphic UC commitments. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 213\u2013232. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45608-8_12"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I Damgrd","year":"2006","unstructured":"Damgrd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) Advances in Cryptology - CRYPTO 2006. Lecture Notes in Computer Science, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Frederiksen, T.K., Nielsen, J.B., Orlandi, C.: Privacy-free garbled circuits with applications to efficient zero-knowledge. In: Proceedings Advances in Cryptology - EUROCRYPT 2015\u201334th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, 26\u201330 April 2015, Part II, pp. 191\u2013219 (2015)","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"10_CR13","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: Zkboo: Faster zero-knowledge for Boolean circuits. IACR Cryptology ePrint Archive 2016\/163 (2016)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, New York, NY, USA, ACM (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"10_CR15","doi-asserted-by":"crossref","first-page":"690","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. J. ACM (JACM) 38(3), 690\u2013728 (1991)","journal-title":"J. ACM (JACM)"},{"key":"10_CR16","doi-asserted-by":"crossref","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, 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013 (2013)","DOI":"10.1145\/2508859.2516662"},{"key":"10_CR19","series-title":"The IBM Research Symposia Series","first-page":"85","volume-title":"Complexity of Computer Computations","author":"MK Richard","year":"1972","unstructured":"Richard, M.K.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, New York (1972)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732. ACM (1992)","DOI":"10.1145\/129712.129782"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-31594-7_62","volume-title":"Automata, Languages, and Programming","author":"MO Rabin","year":"2012","unstructured":"Rabin, M.O., Mansour, Y., Muthukrishnan, S., Yung, M.: Strictly-black-box zero-knowledge and efficient validation of financial transactions. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 738\u2013749. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31594-7_62"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Ranellucci, S., Tapp, A., Winkler, S., Wullschleger, J.: On the efficiency of bit commitment reductions. In: Proceedings of Advances in Cryptology - ASIACRYPT 2011\u201317th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, 4\u20138 December 2011, pp. 520\u2013537 (2011)","DOI":"10.1007\/978-3-642-25385-0_28"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49175-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T11:50:40Z","timestamp":1568548240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49175-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319491745","9783319491752"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49175-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}