{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T04:14:43Z","timestamp":1749096883137,"version":"3.41.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319446172"},{"type":"electronic","value":"9783319446189"}],"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-44618-9_11","type":"book-chapter","created":{"date-parts":[[2016,8,10]],"date-time":"2016-08-10T01:10:01Z","timestamp":1470791401000},"page":"198-215","source":"Crossref","is-referenced-by-count":8,"title":["Fiat\u2013Shamir for Highly Sound Protocols Is Instantiable"],"prefix":"10.1007","author":[{"given":"Arno","family":"Mittelbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,11]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/3-540-46035-7_28","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"M Abdalla","year":"2002","unstructured":"Abdalla, M., An, J.H., Bellare, M., Namprempre, C.: From identification to signatures via the Fiat-Shamir transform: minimizing assumptions for security and forward-security. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 418\u2013433. Springer, Heidelberg (2002)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd Annual Symposium on Foundations of Computer Science, 14\u201317 October 2001, pp. 106\u2013115. IEEE Computer Society Press, Las Vegas (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Lindell, Y., Vadhan, S.P.: Lower bounds for non-black-box zero knowledge. In: 44th Annual Symposium on Foundations of Computer Science, 11\u201314 October 2003, pp. 384\u2013393. IEEE Computer Society Press, Cambridge (2003)","DOI":"10.1109\/SFCS.2003.1238212"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 93: 1st Conference on Computer and Communications Security, 3\u20135 November 1993, pp. 62\u201373. ACM Press, Fairfax (1993)","DOI":"10.1145\/168588.168596"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-540-71677-8_14","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Shoup, S.: Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 201\u2013216. Springer, Heidelberg (2007)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/978-3-642-34961-4_38","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"D Bernhard","year":"2012","unstructured":"Bernhard, D., Pereira, O., Warinschi, B.: How not to prove yourself: pitfalls of the Fiat-Shamir heuristic and applications to helios. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 626\u2013643. Springer, Heidelberg (2012)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-642-36594-2_11","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2013","unstructured":"Bitansky, N., Dachman-Soled, D., Garg, S., Jain, A., Kalai, Y.T., L\u00f3pez-Alt, A., Wichs, D.: Why \u201cFiat-Shamir for proofs\u201d lacks a proof. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 182\u2013201. Springer, Heidelberg (2013)"},{"key":"11_CR8","unstructured":"Bitansky, N., Garg, S., Wichs, D.: Why Fiat-Shamir for proofs lacks a proof. Cryptology ePrint Archive, Report 2012\/705 (2012). http:\/\/eprint.iacr.org\/2012\/705"},{"key":"11_CR9","unstructured":"Blum, M.: Coin flipping by telephone. In: Gersho, A. (ed.) Advances in Cryptology - CRYPTO 1981. ECE Report 82\u201304, pp. 11\u201315. U.C. Santa Barbara, Department of Electrical and Computer Engineering, Santa Barbara, CA, USA (1981)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, 2\u20134 May 1988, pp. 103\u2013112. ACM Press, Chicago (1988)","DOI":"10.1145\/62212.62222"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/11426639_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"JL Camenisch","year":"2005","unstructured":"Camenisch, J.L., Hohenberger, S., Lysyanskaya, A.: Compact e-cash. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 302\u2013321. Springer, Heidelberg (2005)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"JL Camenisch","year":"2002","unstructured":"Camenisch, J.L., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"11_CR13","unstructured":"Canetti, R., Chen, Y., Reyzin, L.: On the correlation intractability of obfuscated pseudorandom functions. Cryptology ePrint Archive, Report 2015\/334 (2015). http:\/\/eprint.iacr.org\/"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version). In: 30th Annual ACM Symposium on Theory of Computing, 23\u201326 May 1998, pp. 209\u2013218. ACM Press, Dallas (1988)","DOI":"10.1145\/276698.276741"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-662-49099-0_5","volume-title":"Theory of Cryptography","author":"M Ciampi","year":"2016","unstructured":"Ciampi, M., Persiano, G., Scafuro, A., Siniscalchi, L., Visconti, I.: Improved OR-composition of sigma-protocols. In: Kushilevitz, E., et al. (eds.) TCC 2016-A. LNCS, vol. 9563, pp. 112\u2013141. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49099-0_5"},{"key":"11_CR16","unstructured":"Ciampi, M., Persiano, G., Scafuro, A., Siniscalchi, L., Visconti, I.: Online\/offline or composition of sigma protocols. Cryptology ePrint Archive, Report 2016\/175 (2016). http:\/\/eprint.iacr.org\/"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-662-49099-0_4","volume-title":"Theory of Cryptography","author":"M Ciampi","year":"2016","unstructured":"Ciampi, M., Persiano, G., Siniscalchi, L., Visconti, I.: A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles. In: Kushilevitz, E., et al. (eds.) TCC 2016-A. LNCS, vol. 9563, pp. 83\u2013111. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49099-0_4"},{"key":"11_CR18","unstructured":"Dachman-Soled, D., Jain, A., Kalai, Y.T., L\u00f3pez-Alt, A.: On the (in)security of the Fiat-Shamir paradigm, revisited. IACR Cryptology ePrint Archive 2012, 706 (2012). http:\/\/eprint.iacr.org\/2012\/706"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-319-06734-6_22","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"\u00d6 Dagdelen","year":"2014","unstructured":"Dagdelen, \u00d6., Venturi, D.: A second look at Fischlin\u2019s transformation. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT 2014. LNCS, vol. 8469, pp. 356\u2013376. Springer, Heidelberg (2014)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"IB Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1007\/978-3-642-28914-9_35","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y., Ristenpart, T., Vadhan, S.: Randomness condensers for efficiently samplable, seed-dependent sources. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 618\u2013635. Springer, Heidelberg (2012)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: 23rd Annual ACM Symposium on Theory of Computing, 6\u20138 May 1991, pp. 542\u2013552. ACM Press, New Orleans (1991)","DOI":"10.1145\/103418.103474"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. In: 40th Annual Symposium on Foundations of Computer Science, 17\u201319 October 1999, pp. 523\u2013534. IEEE Computer Society Press, New York (1999)","DOI":"10.1109\/SFFCS.1999.814626"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-540-27809-2_16","volume-title":"Financial Cryptography","author":"E Elkind","year":"2004","unstructured":"Elkind, E., Lipmaa, H.: Interleaving cryptography and mechanism design. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 117\u2013131. Springer, Heidelberg (2004)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-642-34931-7_5","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"S Faust","year":"2012","unstructured":"Faust, S., Kohlweiss, M., Marson, G.A., Venturi, D.: On the non-malleability of the Fiat-Shamir transform. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 60\u201379. Springer, Heidelberg (2012)"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, 25\u201327 May 1987, pp. 218\u2013229. ACM Press, New York City (1987)","DOI":"10.1145\/28395.28420"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: 44th Annual Symposium on Foundations of Computer Science, 11\u201314 October 2003, pp. 102\u2013115. IEEE Computer Society Press, Cambridge (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ostrovsky, R., Scafuro, A., Visconti, I.: Black-box non-black-box zero knowledge. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, May 31\u2013June 3 2014, pp. 515\u2013524. ACM Press, New York (2014)","DOI":"10.1145\/2591796.2591879"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Haitner, I.: A parallel repetition theorem for any interactive argument. In: 50th Annual Symposium on Foundations of Computer Science, 25\u201327 October 2009, pp. 241\u2013250. IEEE Computer Society Press, Atlanta (2009)","DOI":"10.1109\/FOCS.2009.50"},{"key":"11_CR33","unstructured":"Hazay, C., Venkitasubramaniam, M.: On the power of secure two-party computation. Cryptology ePrint Archive, Report 2016\/074 (2016). http:\/\/eprint.iacr.org\/"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-642-55220-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Hohenberger","year":"2014","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Replacing a random oracle: full domain hash from indistinguishability obfuscation. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 201\u2013220. Springer, Heidelberg (2014)"},{"key":"11_CR35","unstructured":"Kalai, Y.T., Rothblum, G.N., Rothblum, R.D.: From obfuscation to the security of Fiat-Shamir for proofs. Cryptology ePrint Archive, Report 2016\/303 (2016). http:\/\/eprint.iacr.org\/"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/978-3-662-46803-6_16","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"A Kiayias","year":"2015","unstructured":"Kiayias, A., Zacharias, T., Zhang, B.: End-to-end verifiable elections in the standard model. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 468\u2013498. Springer, Heidelberg (2015)"},{"key":"11_CR37","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)"},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-662-46494-6_5","volume-title":"Theory of Cryptography","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y.: An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol. 9014, pp. 93\u2013109. Springer, Heidelberg (2015)"},{"key":"11_CR39","unstructured":"Mittelbach, A., Venturi, D.: Fiat-Shamir for highly sound protocols is instantiable. IACR Cryptology ePrint Archive 2016, 313 (2016). http:\/\/eprint.iacr.org\/2016\/313"},{"key":"11_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"T Okamoto","year":"1993","unstructured":"Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 31\u201353. Springer, Heidelberg (1993)"},{"key":"11_CR41","unstructured":"Ostrovsky, R., Visconti, I.: Simultaneous resettability from collision resistance. Electronic Colloquium on Computational Complexity (ECCC) 19, 164 (2012). http:\/\/eccc.hpi-web.de\/report\/2012\/164"},{"issue":"3","key":"11_CR42","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000)","journal-title":"J. Cryptol."},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, May 31\u2013June 3 2014, pp. 475\u2013484. ACM Press, New York (2014)","DOI":"10.1145\/2591796.2591825"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44618-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T16:38:48Z","timestamp":1749055128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44618-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319446172","9783319446189"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44618-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}