{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:42:00Z","timestamp":1787017320015,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":99,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"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":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384324","type":"proceedings-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T21:45:25Z","timestamp":1591479925000},"page":"269-279","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Post-quantum zero knowledge in constant rounds"],"prefix":"10.1145","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Omri","family":"Shmueli","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[AP] Prabhanjan Ananth and Rolando La Placa. Personal communication. [ARU14] Andris Ambainis Ansis Rosmanis and Dominique Unruh. Quantum [AP] Prabhanjan Ananth and Rolando La Placa. Personal communication. [ARU14] Andris Ambainis Ansis Rosmanis and Dominique Unruh. Quantum"},{"key":"e_1_3_2_1_2_1","volume-title":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science","author":"In","unstructured":"In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science , In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science,"},{"key":"e_1_3_2_1_3_1","unstructured":"pages 474-483. IEEE 2014. pages 474-483. IEEE 2014."},{"key":"e_1_3_2_1_4_1","volume-title":"42nd","author":"Barak Boaz","unstructured":"[Bar01] Boaz Barak . How to go beyond the black-box simulation barrier . In 42nd [Bar01] Boaz Barak. How to go beyond the black-box simulation barrier. In 42nd"},{"key":"e_1_3_2_1_5_1","first-page":"14","volume-title":"Symposium on Foundations of Computer Science, FOCS","author":"Annual","year":"2001","unstructured":"Annual Symposium on Foundations of Computer Science, FOCS 2001 , 14 - 17 Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17"},{"key":"e_1_3_2_1_6_1","first-page":"106","volume-title":"USA","author":"October","year":"2001","unstructured":"October 2001 , Las Vegas, Nevada , USA , pages 106 - 115 , 2001. October 2001, Las Vegas, Nevada, USA, pages 106-115, 2001."},{"key":"e_1_3_2_1_7_1","unstructured":"[BG19] Anne Broadbent and Alex B Grilo. Zero-knowledge for qma from locally [BG19] Anne Broadbent and Alex B Grilo. Zero-knowledge for qma from locally"},{"key":"e_1_3_2_1_8_1","volume-title":"arXiv preprint arXiv:1911.07782","year":"2019","unstructured":"simulatable proofs. arXiv preprint arXiv:1911.07782 , 2019 . [BGJ+13] Elette Boyle, Sanjam Garg , Abhishek Jain, Yael Tauman Kalai, and Amit simulatable proofs. arXiv preprint arXiv:1911.07782, 2019. [BGJ+13] Elette Boyle, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, and Amit"},{"key":"e_1_3_2_1_9_1","unstructured":"Advances in Cryptology-CRYPTO 2013-33rd Annual Cryptology Con- Advances in Cryptology-CRYPTO 2013-33rd Annual Cryptology Con-"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings, Part I","author":"Barbara Santa","year":"2013","unstructured":"ference, Santa Barbara , CA, USA , August 18-22 , 2013 . Proceedings, Part I , ference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I,"},{"key":"e_1_3_2_1_11_1","unstructured":"pages 316-334 2013. [BJSW16] Anne Broadbent Zhengfeng Ji Fang Song and John Watrous. Zero- pages 316-334 2013. [BJSW16] Anne Broadbent Zhengfeng Ji Fang Song and John Watrous. Zero-"},{"key":"e_1_3_2_1_12_1","volume-title":"2016 IEEE 57th Annual Symposium","unstructured":"knowledge proof systems for qma . In 2016 IEEE 57th Annual Symposium knowledge proof systems for qma. In 2016 IEEE 57th Annual Symposium"},{"key":"e_1_3_2_1_13_1","unstructured":"on Foundations of Computer Science (FOCS) pages 31-40. IEEE 2016. on Foundations of Computer Science (FOCS) pages 31-40. IEEE 2016."},{"key":"e_1_3_2_1_14_1","unstructured":"[BKP19] Nir Bitansky Dakshita Khurana and Omer Paneth. Weak zero-knowledge [BKP19] Nir Bitansky Dakshita Khurana and Omer Paneth. Weak zero-knowledge"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 51st Annual ACM","unstructured":"beyond the black-box barrier . In Proceedings of the 51st Annual ACM beyond the black-box barrier. In Proceedings of the 51st Annual ACM"},{"key":"e_1_3_2_1_16_1","first-page":"1091","volume-title":"Symposium on Theory of Computing","author":"SIGACT","unstructured":"SIGACT Symposium on Theory of Computing , pages 1091 - 1102 . ACM, SIGACT Symposium on Theory of Computing, pages 1091-1102. ACM,"},{"key":"e_1_3_2_1_17_1","unstructured":"[BM84] Manuel Blum and Silvio Micali. How to generate cryptographically strong [BM84] Manuel Blum and Silvio Micali. How to generate cryptographically strong"},{"key":"e_1_3_2_1_18_1","first-page":"850","volume":"13","year":"1984","unstructured":"sequences of pseudo-random bits. SIAM J. Comput. , 13 ( 4 ): 850 - 864 , 1984 . [BOCG+06] Michael Ben-Or, Claude Cr\u00e9peau, Daniel Gottesman, Avinatan Hassidim, sequences of pseudo-random bits. SIAM J. Comput., 13 ( 4 ): 850-864, 1984. [BOCG+06] Michael Ben-Or, Claude Cr\u00e9peau, Daniel Gottesman, Avinatan Hassidim,","journal-title":"J. Comput."},{"key":"e_1_3_2_1_19_1","volume-title":"2006 47th Annual IEEE Symposium on Founda-","unstructured":"strict honest majority. In 2006 47th Annual IEEE Symposium on Founda- strict honest majority. In 2006 47th Annual IEEE Symposium on Founda-"},{"key":"e_1_3_2_1_20_1","unstructured":"tions of Computer Science (FOCS'06) pages 249-260. IEEE 2006. tions of Computer Science (FOCS'06) pages 249-260. IEEE 2006."},{"key":"e_1_3_2_1_21_1","unstructured":"[BP15] Nir Bitansky and Omer Paneth. On non-black-box simulation and the [BP15] Nir Bitansky and Omer Paneth. On non-black-box simulation and the"},{"key":"e_1_3_2_1_22_1","first-page":"1325","volume":"44","unstructured":"impossibility of approximate obfuscation. SIAM J. Comput. , 44 ( 5 ): 1325 - impossibility of approximate obfuscation. SIAM J. Comput., 44 ( 5 ): 1325-","journal-title":"J. Comput."},{"key":"e_1_3_2_1_23_1","unstructured":"[Bra18] Zvika Brakerski. Quantum fhe (almost) as secure as classical. In Annual [Bra18] Zvika Brakerski. Quantum fhe (almost) as secure as classical. In Annual"},{"key":"e_1_3_2_1_24_1","first-page":"67","volume-title":"Cryptology Conference","author":"International","year":"2018","unstructured":"International Cryptology Conference , pages 67 - 95 . Springer , 2018 . [CFGS18] Alessandro Chiesa, Michael A. Forbes, Tom Gur, and Nicholas Spooner. International Cryptology Conference, pages 67-95. Springer, 2018. [CFGS18] Alessandro Chiesa, Michael A. Forbes, Tom Gur, and Nicholas Spooner."},{"key":"e_1_3_2_1_25_1","volume-title":"IEEE Annual Symposium on Foundations of Computer Science, FOCS","unstructured":"59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS"},{"key":"e_1_3_2_1_26_1","unstructured":"2018 Paris France October 7-9 2018 pages 755-765 2018. 2018 Paris France October 7-9 2018 pages 755-765 2018."},{"key":"e_1_3_2_1_27_1","unstructured":"[CLP13] Kai-Min Chung Huijia Lin and Rafael Pass. Constant-round concurrent [CLP13] Kai-Min Chung Huijia Lin and Rafael Pass. Constant-round concurrent"},{"key":"e_1_3_2_1_28_1","volume-title":"54th Annual IEEE Symposium on","unstructured":"zero knowledge from p-certificates . In 54th Annual IEEE Symposium on zero knowledge from p-certificates. In 54th Annual IEEE Symposium on"},{"key":"e_1_3_2_1_29_1","volume-title":"FOCS 2013","author":"Computer Science Foundations","year":"2013","unstructured":"Foundations of Computer Science , FOCS 2013 , 26-29 October , 2013 , Berkeley , Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley,"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"CA USA pages 50-59 2013. CA USA pages 50-59 2013.","DOI":"10.5860\/CHOICE.50-5220"},{"key":"e_1_3_2_1_31_1","unstructured":"[CPS16] Kai-Min Chung Rafael Pass and Karn Seth. Non-black-box simulation [CPS16] Kai-Min Chung Rafael Pass and Karn Seth. Non-black-box simulation"},{"key":"e_1_3_2_1_32_1","volume-title":"415-458","year":"2016","unstructured":"Comput., 45 ( 2 ) : 415-458 , 2016 . Comput., 45 ( 2 ): 415-458, 2016."},{"key":"e_1_3_2_1_33_1","unstructured":"[DFS04] Ivan Damg\u00e5rd Serge Fehr and Louis Salvail. Zero-knowledge proofs and [DFS04] Ivan Damg\u00e5rd Serge Fehr and Louis Salvail. Zero-knowledge proofs and"},{"key":"e_1_3_2_1_34_1","first-page":"254","volume-title":"Cryptology Conference","year":"2004","unstructured":"tional Cryptology Conference , pages 254 - 272 . Springer , 2004 . tional Cryptology Conference, pages 254-272. Springer, 2004."},{"key":"e_1_3_2_1_35_1","unstructured":"[DGS09] Yi Deng Vipul Goyal and Amit Sahai. Resolving the simultaneous [DGS09] Yi Deng Vipul Goyal and Amit Sahai. Resolving the simultaneous"},{"key":"e_1_3_2_1_36_1","volume-title":"Annual IEEE Symposium on Foundations of Computer Science, FOCS","unstructured":"50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS"},{"key":"e_1_3_2_1_37_1","first-page":"251","volume-title":"USA","author":"October","year":"2009","unstructured":"2009, October 25-27 , 2009 , Atlanta, Georgia , USA , pages 251 - 260 , 2009. 2009, October 25-27, 2009, Atlanta, Georgia, USA, pages 251-260, 2009."},{"key":"e_1_3_2_1_38_1","unstructured":"[DNS10] Fr\u00e9d\u00e9ric Dupuis Jesper Buus Nielsen and Louis Salvail. Secure two-party [DNS10] Fr\u00e9d\u00e9ric Dupuis Jesper Buus Nielsen and Louis Salvail. Secure two-party"},{"key":"e_1_3_2_1_39_1","first-page":"685","volume-title":"Conference","author":"Cryptology","year":"2010","unstructured":"Cryptology Conference , pages 685 - 706 . Springer , 2010 . Cryptology Conference, pages 685-706. Springer, 2010."},{"key":"e_1_3_2_1_40_1","unstructured":"[DNS12] Fr\u00e9d\u00e9ric Dupuis Jesper Buus Nielsen and Louis Salvail. Actively secure [DNS12] Fr\u00e9d\u00e9ric Dupuis Jesper Buus Nielsen and Louis Salvail. Actively secure"},{"key":"e_1_3_2_1_41_1","unstructured":"Conference pages 794-811. Springer 2012. Conference pages 794-811. Springer 2012."},{"key":"e_1_3_2_1_42_1","unstructured":"[FP96] Christopher A. Fuchs and Asher Peres. Quantum-state disturbance versus [FP96] Christopher A. Fuchs and Asher Peres. Quantum-state disturbance versus"},{"key":"e_1_3_2_1_43_1","volume-title":"Apr","year":"1996","unstructured":"Rev. A, 53 : 2038-2045 , Apr 1996 . Rev. A, 53 : 2038-2045, Apr 1996."},{"key":"e_1_3_2_1_44_1","unstructured":"[GK96a] Oded Goldreich and Ariel Kahan. How to construct constant-round zero- [GK96a] Oded Goldreich and Ariel Kahan. How to construct constant-round zero-"},{"key":"e_1_3_2_1_45_1","unstructured":"knowledge proof systems for np. Journal of Cryptology 9 ( 3 ): 167-189 knowledge proof systems for np. Journal of Cryptology 9 ( 3 ): 167-189"},{"key":"e_1_3_2_1_46_1","unstructured":"[GK96b] Oded Goldreich and Hugo Krawczyk. On the composition of zero- [GK96b] Oded Goldreich and Hugo Krawczyk. On the composition of zero-"},{"key":"e_1_3_2_1_47_1","first-page":"169","volume":"25","year":"1996","unstructured":"knowledge proof systems. SIAM J. Comput. , 25 ( 1 ): 169 - 192 , 1996 . [GKVW19] Rishab Goyal, Venkata Koppula, Satyanarayana Vusirikala, and Brent knowledge proof systems. SIAM J. Comput., 25 ( 1 ): 169-192, 1996. [GKVW19] Rishab Goyal, Venkata Koppula, Satyanarayana Vusirikala, and Brent","journal-title":"J. Comput."},{"key":"e_1_3_2_1_48_1","volume-title":"On perfect correctness in (lockable) obfuscation","year":"2019","unstructured":"Waters. On perfect correctness in (lockable) obfuscation . 2019 . [GKW17] Rishab Goyal, Venkata Koppula , and Brent Waters. Lockable obfuscation. Waters. On perfect correctness in (lockable) obfuscation. 2019. [GKW17] Rishab Goyal, Venkata Koppula, and Brent Waters. Lockable obfuscation."},{"key":"e_1_3_2_1_49_1","volume-title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science","author":"In","unstructured":"In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science"},{"key":"e_1_3_2_1_50_1","unstructured":"(FOCS) pages 612-621. IEEE 2017. (FOCS) pages 612-621. IEEE 2017."},{"key":"e_1_3_2_1_51_1","unstructured":"[GMR89] Shafi Goldwasser Silvio Micali and Charles Rackof. The knowledge [GMR89] Shafi Goldwasser Silvio Micali and Charles Rackof. The knowledge"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/18.2.186"},{"key":"e_1_3_2_1_53_1","unstructured":"1989. [GMW86] Oded Goldreich Silvio Micali and Avi Wigderson. How to prove all np 1989. [GMW86] Oded Goldreich Silvio Micali and Avi Wigderson. How to prove all np"},{"key":"e_1_3_2_1_54_1","unstructured":"Techniques pages 171-185. Springer 1986. [GMW87] Oded Goldreich Silvio Micali and Avi Wigderson. How to play any Techniques pages 171-185. Springer 1986. [GMW87] Oded Goldreich Silvio Micali and Avi Wigderson. How to play any"},{"key":"e_1_3_2_1_55_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of","unstructured":"jority. In Proceedings of the 19th Annual ACM Symposium on Theory of jority. In Proceedings of the 19th Annual ACM Symposium on Theory of"},{"key":"e_1_3_2_1_56_1","first-page":"218","volume-title":"USA","author":"Computing","year":"1987","unstructured":"Computing , 1987 , New York, New York , USA , pages 218 - 229 , 1987. Computing, 1987, New York, New York, USA, pages 218-229, 1987."},{"key":"e_1_3_2_1_57_1","unstructured":"[Goy13] Vipul Goyal. Non-black-box simulation in the fully concurrent setting. [Goy13] Vipul Goyal. Non-black-box simulation in the fully concurrent setting."},{"key":"e_1_3_2_1_58_1","volume-title":"Symposium on Theory of Computing Conference, STOC'13","author":"In","unstructured":"In Symposium on Theory of Computing Conference, STOC'13 , Palo Alto , In Symposium on Theory of Computing Conference, STOC'13, Palo Alto,"},{"key":"e_1_3_2_1_59_1","unstructured":"CA USA June 1-4 2013 pages 221-230 2013. CA USA June 1-4 2013 pages 221-230 2013."},{"key":"e_1_3_2_1_60_1","unstructured":"[GSY19] Alex Bredariol Grilo William Slofstra and Henry Yuen. Perfect zero [GSY19] Alex Bredariol Grilo William Slofstra and Henry Yuen. Perfect zero"},{"key":"e_1_3_2_1_61_1","volume-title":"86","author":"Computational Complexity","year":"2019","unstructured":"quium on Computational Complexity (ECCC), 26 : 86 , 2019 . quium on Computational Complexity (ECCC), 26 : 86, 2019."},{"key":"e_1_3_2_1_62_1","unstructured":"[HIK+11] Iftach Haitner Yuval Ishai Eyal Kushilevitz Yehuda Lindell and Erez [HIK+11] Iftach Haitner Yuval Ishai Eyal Kushilevitz Yehuda Lindell and Erez"},{"key":"e_1_3_2_1_63_1","first-page":"225","volume":"40","author":"SIAM","year":"2011","unstructured":"SIAM J. Comput. , 40 ( 2 ): 225 - 266 , 2011 . SIAM J. Comput., 40 ( 2 ): 225-266, 2011.","journal-title":"J. Comput."},{"key":"e_1_3_2_1_64_1","unstructured":"[HSS11] Sean Hallgren Adam Smith and Fang Song. Classical cryptographic [HSS11] Sean Hallgren Adam Smith and Fang Song. Classical cryptographic"},{"key":"e_1_3_2_1_65_1","unstructured":"411-428. Springer 2011. 411-428. Springer 2011."},{"key":"e_1_3_2_1_66_1","unstructured":"[Kob03] Hirotada Kobayashi. Non-interactive quantum perfect and statistical [Kob03] Hirotada Kobayashi. Non-interactive quantum perfect and statistical"},{"key":"e_1_3_2_1_67_1","volume-title":"14th International Sym-","unstructured":"zero-knowledge. In Algorithms and Computation , 14th International Sym- zero-knowledge. In Algorithms and Computation, 14th International Sym-"},{"key":"e_1_3_2_1_68_1","volume-title":"ISAAC 2003, Kyoto, Japan, December 15-17, 2003","unstructured":"posium , ISAAC 2003, Kyoto, Japan, December 15-17, 2003 , Proceedings , posium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings,"},{"key":"e_1_3_2_1_69_1","unstructured":"pages 178-188 2003. pages 178-188 2003."},{"key":"e_1_3_2_1_70_1","unstructured":"[Liu06] Yi-Kai Liu. Consistency of local density matrices is qma-complete. In [Liu06] Yi-Kai Liu. Consistency of local density matrices is qma-complete. In"},{"key":"e_1_3_2_1_71_1","unstructured":"and techniques pages 438-449. Springer 2006. and techniques pages 438-449. Springer 2006."},{"key":"e_1_3_2_1_72_1","unstructured":"[LN11] Carolin Lunemann and Jesper Buus Nielsen. Fully simulatable quantum- [LN11] Carolin Lunemann and Jesper Buus Nielsen. Fully simulatable quantum-"},{"key":"e_1_3_2_1_73_1","unstructured":"Cryptology in Africa pages 21-40. Springer 2011. [Mah18a] Urmila Mahadev. Classical homomorphic encryption for quantum circuits. Cryptology in Africa pages 21-40. Springer 2011. [Mah18a] Urmila Mahadev. Classical homomorphic encryption for quantum circuits."},{"key":"e_1_3_2_1_74_1","volume-title":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science","author":"In","unstructured":"In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science"},{"key":"e_1_3_2_1_75_1","unstructured":"(FOCS) pages 332-338. IEEE 2018. [Mah18b] Urmila Mahadev. Classical verification of quantum computations. In (FOCS) pages 332-338. IEEE 2018. [Mah18b] Urmila Mahadev. Classical verification of quantum computations. In"},{"key":"e_1_3_2_1_76_1","volume-title":"IEEE Annual Symposium on Foundations of Computer Science, FOCS","unstructured":"59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS"},{"key":"e_1_3_2_1_77_1","unstructured":"2018 Paris France October 7-9 2018 pages 259-267 2018. [MHNF15] Tomoyuki Morimae Masahito Hayashi Harumichi Nishimura and 2018 Paris France October 7-9 2018 pages 259-267 2018. [MHNF15] Tomoyuki Morimae Masahito Hayashi Harumichi Nishimura and"},{"key":"e_1_3_2_1_78_1","unstructured":"arXiv:1506.06447 2015. arXiv:1506.06447 2015."},{"key":"e_1_3_2_1_79_1","unstructured":"[PRS02] Manoj Prabhakaran Alon Rosen and Amit Sahai. Concurrent zero knowl- [PRS02] Manoj Prabhakaran Alon Rosen and Amit Sahai. Concurrent zero knowl-"},{"key":"e_1_3_2_1_80_1","volume-title":"43rd Symposium on Founda-","unstructured":"edge with logarithmic round-complexity . In 43rd Symposium on Founda- edge with logarithmic round-complexity. In 43rd Symposium on Founda-"},{"key":"e_1_3_2_1_81_1","first-page":"16","volume":"2002","author":"Computer Science","year":"2002","unstructured":"tions of Computer Science ( FOCS 2002 ), 16 - 19 November 2002 , Vancouver, tions of Computer Science (FOCS 2002 ), 16-19 November 2002, Vancouver,","journal-title":"FOCS"},{"key":"e_1_3_2_1_82_1","first-page":"366","volume-title":"Proceedings","author":"Canada BC","year":"2002","unstructured":"BC , Canada , Proceedings , pages 366 - 375 , 2002 . BC, Canada, Proceedings, pages 366-375, 2002."},{"key":"e_1_3_2_1_83_1","unstructured":"[Reg09] Oded Regev. On lattices learning with errors random linear codes and [Reg09] Oded Regev. On lattices learning with errors random linear codes and"},{"key":"e_1_3_2_1_84_1","volume-title":"34 : 1-34 : 40","author":"J. ACM","year":"2009","unstructured":"cryptography. J. ACM , 56 ( 6 ) : 34 : 1-34 : 40 , 2009 . cryptography. J. ACM, 56 ( 6 ): 34 : 1-34 : 40, 2009."},{"key":"e_1_3_2_1_85_1","unstructured":"[Unr12] Dominique Unruh. Quantum proofs of knowledge. In Annual Interna- [Unr12] Dominique Unruh. Quantum proofs of knowledge. In Annual Interna-"},{"key":"e_1_3_2_1_86_1","unstructured":"niques pages 135-152. Springer 2012. [Unr16a] Dominique Unruh. Collapse-binding quantum commitments without niques pages 135-152. Springer 2012. [Unr16a] Dominique Unruh. Collapse-binding quantum commitments without"},{"key":"e_1_3_2_1_87_1","unstructured":"of Cryptology and Information Security pages 166-195. Springer 2016. [Unr16b] Dominique Unruh. Computationally binding quantum commitments. of Cryptology and Information Security pages 166-195. Springer 2016. [Unr16b] Dominique Unruh. Computationally binding quantum commitments."},{"key":"e_1_3_2_1_88_1","unstructured":"Cryptographic Techniques pages 497-527. Springer 2016. [VDGC97] Jeroen Van De Graaf and C Crepeau. Towards a formal definition of Cryptographic Techniques pages 497-527. Springer 2016. [VDGC97] Jeroen Van De Graaf and C Crepeau. Towards a formal definition of"},{"key":"e_1_3_2_1_89_1","volume-title":"Universit\u00e9 de Montr\u00e9al","year":"1997","unstructured":"security for quantum protocols . Universit\u00e9 de Montr\u00e9al , 1997 . security for quantum protocols. Universit\u00e9 de Montr\u00e9al, 1997."},{"key":"e_1_3_2_1_90_1","unstructured":"[Wat02 ] John Watrous. Limits on the power of quantum statistical zero-knowledge. [Wat02 ] John Watrous. Limits on the power of quantum statistical zero-knowledge."},{"key":"e_1_3_2_1_91_1","volume-title":"The 43rd Annual IEEE Symposium on Foundations of Computer Science","author":"In","unstructured":"In The 43rd Annual IEEE Symposium on Foundations of Computer Science , In The 43rd Annual IEEE Symposium on Foundations of Computer Science,"},{"key":"e_1_3_2_1_92_1","first-page":"459","volume-title":"Proceedings.","year":"2002","unstructured":"2002. Proceedings. , pages 459 - 468 . IEEE, 2002 . 2002. Proceedings., pages 459-468. IEEE, 2002."},{"key":"e_1_3_2_1_93_1","series-title":"SIAM Journal","volume-title":"Zero-knowledge against quantum attacks","author":"Watrous John","unstructured":"[Wat09 ] John Watrous . Zero-knowledge against quantum attacks . SIAM Journal [Wat09 ] John Watrous. Zero-knowledge against quantum attacks. SIAM Journal"},{"key":"e_1_3_2_1_94_1","volume-title":"25-58","year":"2009","unstructured":"on Computing, 39 ( 1 ) : 25-58 , 2009 . on Computing, 39 ( 1 ): 25-58, 2009."},{"key":"e_1_3_2_1_95_1","unstructured":"[WZ82] W. K. Wootters and W. H. Zurek. A single quantum cannot be cloned. [WZ82] W. K. Wootters and W. H. Zurek. A single quantum cannot be cloned."},{"key":"e_1_3_2_1_96_1","volume-title":"802-803","year":"1982","unstructured":"Nature, 299 : 802-803 , 1982 . Nature, 299 : 802-803, 1982."},{"key":"e_1_3_2_1_97_1","unstructured":"[WZ17] Daniel Wichs and Giorgos Zirdelis. Obfuscating compute-and-compare [WZ17] Daniel Wichs and Giorgos Zirdelis. Obfuscating compute-and-compare"},{"key":"e_1_3_2_1_98_1","volume-title":"2017 IEEE 58th Annual Symposium on Foundations","unstructured":"programs under lwe. In 2017 IEEE 58th Annual Symposium on Foundations programs under lwe. In 2017 IEEE 58th Annual Symposium on Foundations"},{"key":"e_1_3_2_1_99_1","unstructured":"of Computer Science (FOCS) pages 600-611. IEEE 2017. of Computer Science (FOCS) pages 600-611. IEEE 2017."}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:32:57Z","timestamp":1750185177000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":99,"alternative-id":["10.1145\/3357713.3384324","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384324","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}