{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:56:00Z","timestamp":1778291760092,"version":"3.51.4"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319637143","type":"print"},{"value":"9783319637150","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63715-0_8","type":"book-chapter","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T01:19:51Z","timestamp":1501204791000},"page":"224-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["From Obfuscation to the Security of Fiat-Shamir for Proofs"],"prefix":"10.1007","author":[{"given":"Yael Tauman","family":"Kalai","sequence":"first","affiliation":[]},{"given":"Guy N.","family":"Rothblum","sequence":"additional","affiliation":[]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,29]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-46035-7_28","volume-title":"Advances in Cryptology \u2014 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). doi:10.1007\/3-540-46035-7_28"},{"key":"8_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":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-54242-8_2","volume-title":"Theory of Cryptography","author":"B Barak","year":"2014","unstructured":"Barak, B., Bitansky, N., Canetti, R., Kalai, Y.T., Paneth, O., Sahai, A.: Obfuscation for evasive functions. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 26\u201351. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-54242-8_2"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00145-013-9146-9","volume":"27","author":"N Bitansky","year":"2014","unstructured":"Bitansky, N., Canetti, R.: On strong simulation and composable point obfuscation. J. Cryptol. 27(2), 317\u2013357 (2014)","journal-title":"J. Cryptol."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-662-44381-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"N Bitansky","year":"2014","unstructured":"Bitansky, N., Canetti, R., Cohn, H., Goldwasser, S., Kalai, Y.T., Paneth, O., Rosen, A.: The impossibility of obfuscation with auxiliary input or a universal simulator. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 71\u201389. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44381-1_5"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:10.1007\/978-3-642-36594-2_11"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: Fairplaymp: a system for secure multi-party computation. In: ACM Conference on Computer and Communications Security, pp. 257\u2013266 (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-sound zero-knowledge and its applications. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14\u201317 October 2001, Las Vegas, Nevada, USA, pp. 116\u2013125 (2001)","DOI":"10.1109\/SFCS.2001.959886"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012)","journal-title":"J. ACM"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-54631-0_29"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14\u201317, 2015, pp. 439\u2013448 (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, October 19\u201322, 1997, pp. 374\u2013383 (1997)","DOI":"10.1109\/SFCS.1997.646126"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703427975","volume":"33","author":"B Barak","year":"2004","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. SIAM J. Comput. 33(4), 738\u2013818 (2004)","journal-title":"SIAM J. Comput."},{"key":"8_CR14","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":"8_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jcss.2005.06.010","volume":"72","author":"B Barak","year":"2006","unstructured":"Barak, B., Lindell, Y., Vadhan, S.P.: Lower bounds for non-black-box zero knowledge. J. Comput. Syst. Sci. 72(2), 321\u2013391 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-662-45608-8_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"C Brzuska","year":"2014","unstructured":"Brzuska, C., Mittelbach, A.: Indistinguishability obfuscation versus multi-bit point obfuscation with auxiliary input. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 142\u2013161. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-45608-8_8"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-662-49099-0_21","volume-title":"Theory of Cryptography","author":"M Bellare","year":"2016","unstructured":"Bellare, M., Stepanovs, I.: Point-function obfuscation: a framework and generic constructions. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 565\u2013594. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49099-0_21"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-42045-0_15"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"R Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: hash functions that hide all partial information. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 455\u2013469. Springer, Heidelberg (1997). doi:10.1007\/BFb0052255"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R., Chen, Y., Reyzin, L.: On the correlation intractability of obfuscated pseudorandom functions. IACR Cryptology ePrint Archive, 2015:334 (2015)","DOI":"10.1007\/978-3-662-49096-9_17"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-540-78967-3_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Canetti","year":"2008","unstructured":"Canetti, R., Dakdouk, R.R.: Obfuscating point functions with multibit output. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 489\u2013508. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-78967-3_28"},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"8_CR24","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) logarithmically many rounds. SIAM J. Comput. 32(1), 1\u201347 (2002)","journal-title":"SIAM J. Comput."},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. In: FOCS, pp. 523\u2013534 (1999)","DOI":"10.1109\/SFFCS.1999.814626"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:10.1007\/978-3-642-28914-9_35"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","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). doi:10.1007\/3-540-47721-7_12"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October, 2013, Berkeley, CA, USA, pp. 40\u201349 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"issue":"4","key":"8_CR29","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"1","key":"8_CR30","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. Comput. 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the fiat-shamir paradigm. In: FOCS, pp. 102\u2013113 (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"8_CR32","unstructured":"Goldwasser, S., Kalai, Y.T.: On the impossibility of obfuscation with auxiliary input. In: FOCS, pp. 553\u2013562 (2005)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-662-49096-9_21","volume-title":"Theory of Cryptography","author":"S Goldwasser","year":"2016","unstructured":"Goldwasser, S., Tauman Kalai, Y.: Cryptographic assumptions: a position paper. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 505\u2013522. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49096-9_21"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Gentry, C., Lewko, A.B., Sahai, A., Waters, B.: Indistinguishability obfuscation from the multilinear subgroup elimination assumption. IACR Cryptology ePrint Archive 2014:309 (2014)","DOI":"10.1109\/FOCS.2015.19"},{"issue":"1","key":"8_CR35","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."},{"issue":"1","key":"8_CR36","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. Cryptol. 7(1), 1\u201332 (1994)","journal-title":"J. Cryptol."},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC, pp. 99\u2013108 (2011)","DOI":"10.1145\/1993636.1993651"},{"issue":"4","key":"8_CR38","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/BFb0055744","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"S Hada","year":"1998","unstructured":"Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 408\u2013423. Springer, Heidelberg (1998). doi:10.1007\/BFb0055744"},{"key":"8_CR40","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the internet. In: 39th Annual Symposium on Foundations of Computer Science, FOCS 1998, November 8\u201311, 1998, Palo Alto, California, USA, pp. 484\u2013492 (1998)"},{"key":"8_CR41","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: ACM CCS, pp. 669\u2013684 (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs. In: FOCS, pp. 436\u2013453 (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"8_CR43","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: USENIX Security Symposium, pp. 287\u2013302 (2004)"},{"key":"8_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-44618-9_11","volume-title":"Security and Cryptography for Networks","author":"A Mittelbach","year":"2016","unstructured":"Mittelbach, A., Venturi, D.: Fiat\u2013shamir for highly sound protocols is instantiable. In: Zikas, V., Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 198\u2013215. Springer, Cham (2016). doi:10.1007\/978-3-319-44618-9_11"},{"key":"8_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45146-4_6"},{"key":"8_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BFb0055741","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"K Ohta","year":"1998","unstructured":"Ohta, K., Okamoto, T.: On concrete security treatment of signatures derived from identification. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 354\u2013369. Springer, Heidelberg (1998). doi:10.1007\/BFb0055741"},{"key":"8_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"D Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387\u2013398. Springer, Heidelberg (1996). doi:10.1007\/3-540-68339-9_33"},{"key":"8_CR48","unstructured":"Reyzin, L.: Zero-Knowledge with Public Keys. Ph.D. thesis, MIT (2001)"},{"key":"8_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"A Rosen","year":"2000","unstructured":"Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 451\u2013468. Springer, Heidelberg (2000). doi:10.1007\/3-540-44598-6_28"},{"issue":"1","key":"8_CR50","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"AA Razborov","year":"1997","unstructured":"Razborov, A.A., Rudich, S.: Natural proofs. J. Comput. Syst. Sci. 55(1), 24\u201335 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18\u201321, 2016, pp. 49\u201362 (2016)","DOI":"10.1145\/2897518.2897652"},{"key":"8_CR52","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC, pp. 475\u2013484 (2014)","DOI":"10.1145\/2591796.2591825"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63715-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:33:09Z","timestamp":1750789989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-63715-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319637143","9783319637150"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63715-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"29 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iacr.org\/conferences\/crypto2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}