{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T12:33:33Z","timestamp":1776774813486,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316380","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"1082-1090","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":167,"title":["Fiat-Shamir: from practice to theory"],"prefix":"10.1145","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[{"name":"Boston University, USA \/ Tel Aviv University, Israel"}]},{"given":"Yilei","family":"Chen","sequence":"additional","affiliation":[{"name":"Visa Research, USA"}]},{"given":"Justin","family":"Holmgren","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}]},{"given":"Alex","family":"Lombardi","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Guy N.","family":"Rothblum","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[{"name":"Technion, Israel"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647087.715838"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"e_1_3_2_1_3_1","first-page":"175","volume-title":"Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on, IEEE","author":"Applebaum Benny","year":"2004","unstructured":"{AIK04} Benny Applebaum , Yuval Ishai , and Eyal Kushilevitz , Cryptography in nc0 , Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on, IEEE , 2004 , pp. 166\u2013 175 . {AIK04} Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz, Cryptography in nc0, Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on, IEEE, 2004, pp. 166\u2013175."},{"key":"e_1_3_2_1_4_1","first-page":"129","volume-title":"Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science","year":"2011","unstructured":"{AIK11} , How to garble arithmetic circuits , Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science , IEEE Computer Society , 2011 , pp. 120\u2013 129 . {App11} Benny Applebaum, Key-dependent message security: Generic amplification and completeness, Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Springer, 2011, pp. 527\u2013546. {Bar01} Boaz Barak, How to go beyond the black-box simulation barrier, FOCS, IEEE, 2001, p. 106. {AIK11}, How to garble arithmetic circuits, Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 2011, pp. 120\u2013129. {App11} Benny Applebaum, Key-dependent message security: Generic amplification and completeness, Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Springer, 2011, pp. 527\u2013546. {Bar01} Boaz Barak, How to go beyond the black-box simulation barrier, FOCS, IEEE, 2001, p. 106."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_1_7_1","first-page":"20","volume-title":"Annual Cryptology Conference","author":"Brakerski Zvika","year":"2010","unstructured":"{BG10} Zvika Brakerski and Shafi Goldwasser , Circular and leakage resilient publickey encryption under subgroup indistinguishability , Annual Cryptology Conference , Springer , 2010 , pp. 1\u2013 20 . {BG10} Zvika Brakerski and Shafi Goldwasser, Circular and leakage resilient publickey encryption under subgroup indistinguishability, Annual Cryptology Conference, Springer, 2010, pp. 1\u201320."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704152"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_22"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"e_1_3_2_1_13_1","first-page":"564","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Brakerski Zvika","year":"2018","unstructured":"{BLSV18} Zvika Brakerski , Alex Lombardi , Gil Segev , and Vinod Vaikuntanathan , Anonymous IBE , leakage resilience and circular security from new assumptions , Annual International Conference on the Theory and Applications of Cryptographic Techniques , Springer , 2018 , pp. 535\u2013 564 . {BLSV18} Zvika Brakerski, Alex Lombardi, Gil Segev, and Vinod Vaikuntanathan, Anonymous IBE, leakage resilience and circular security from new assumptions, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2018, pp. 535\u2013564."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946295"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_17_1","first-page":"12","volume-title":"Proceedings of the 5th conference on Innovations in theoretical computer science, ACM","year":"2014","unstructured":"{BV14}, Lattice-based FHE as secure as PKE , Proceedings of the 5th conference on Innovations in theoretical computer science, ACM , 2014 , pp. 1\u2013 12 . {CCH + 18} Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, and Ron D. Rothblum, Fiat-shamir: From practice to theory, part i (fiat-shamir from simpler assumptions), IACR Cryptology ePrint Archive 2018 (2018). {BV14}, Lattice-based FHE as secure as PKE, Proceedings of the 5th conference on Innovations in theoretical computer science, ACM, 2014, pp. 1\u201312. {CCH + 18} Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, and Ron D. Rothblum, Fiat-shamir: From practice to theory, part i (fiat-shamir from simpler assumptions), IACR Cryptology ePrint Archive 2018 (2018)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_17"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008734"},{"key":"e_1_3_2_1_21_1","volume-title":"IACR Cryptology ePrint Archive 2018","author":"Canetti Ran","year":"2018","unstructured":"{CLW18} Ran Canetti , Alex Lombardi , and Daniel Wichs , Fiat-shamir : From practice to theory, part ii (non-interactive zero knowledge and correlation intractability from circular-secure fhe) , IACR Cryptology ePrint Archive 2018 ( 2018 ). {CLW18} Ran Canetti, Alex Lombardi, and Daniel Wichs, Fiat-shamir: From practice to theory, part ii (non-interactive zero knowledge and correlation intractability from circular-secure fhe), IACR Cryptology ePrint Archive 2018 (2018)."},{"key":"e_1_3_2_1_22_1","first-page":"534","volume-title":"IEEE Computer Society","author":"Dwork Cynthia","year":"1999","unstructured":"{DNRS99} Cynthia Dwork , Moni Naor , Omer Reingold , and Larry J . Stockmeyer, Magic functions, FOCS , IEEE Computer Society , 1999 , pp. 523\u2013 534 . {DNRS99} Cynthia Dwork, Moni Naor, Omer Reingold, and Larry J. Stockmeyer, Magic functions, FOCS, IEEE Computer Society, 1999, pp. 523\u2013534."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792230010"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946302"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_21"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220358"},{"key":"e_1_3_2_1_31_1","first-page":"92","volume-title":"Advances in Cryptology\u2013CRYPTO","author":"Gentry Craig","year":"2013","unstructured":"{GSW13} Craig Gentry , Amit Sahai , and Brent Waters , Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attributebased , Advances in Cryptology\u2013CRYPTO 2013 , Springer , 2013, pp. 75\u2013 92 . {GSW13} Craig Gentry, Amit Sahai, and Brent Waters, Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attributebased, Advances in Cryptology\u2013CRYPTO 2013, Springer, 2013, pp. 75\u201392."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS","author":"Holmgren Justin","year":"2018","unstructured":"{HL18} Justin Holmgren and Alex Lombardi , Cryptographic hashing from strong one-way functions , Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS , 2018 , to appear. {HL18} Justin Holmgren and Alex Lombardi, Cryptographic hashing from strong one-way functions, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2018, to appear."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802617"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688105"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802639"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_8"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_19"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754495.1754540"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316380","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":39,"alternative-id":["10.1145\/3313276.3316380","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316380","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}