Zvika Brakerski, A. Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick
{"title":"Simple Tests of Quantumness Also Certify Qubits","authors":"Zvika Brakerski, A. Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick","doi":"10.1007/978-3-031-38554-4_6","DOIUrl":"https://doi.org/10.1007/978-3-031-38554-4_6","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125796059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Black-Hole Radiation Decoding is Quantum Cryptography","authors":"Zvika Brakerski","doi":"10.48550/arXiv.2211.05491","DOIUrl":"https://doi.org/10.48550/arXiv.2211.05491","url":null,"abstract":"We propose to study equivalence relations between phenomena in high-energy physics and the existence of standard cryptographic primitives, and show the first example where such an equivalence holds. A small number of prior works showed that high-energy phenomena can be explained by cryptographic hardness. Examples include using the existence of one-way functions to explain the hardness of decoding black-hole Hawking radiation (Harlow and Hayden 2013, Aaronson 2016), and using pseudorandom quantum states to explain the hardness of computing AdS/CFT dictionary (Bouland, Fefferman and Vazirani, 2020). In this work we show, for the former example of black-hole radiation decoding, that it also implies the existence of secure quantum cryptography. In fact, we show an existential equivalence between the hardness of black-hole radiation decoding and a variety of cryptographic primitives, including bit-commitment schemes and oblivious transfer protocols (using quantum communication). This can be viewed (with proper disclaimers, as we discuss) as providing a physical justification for the existence of secure cryptography. We conjecture that such connections may be found in other high-energy physics phenomena.","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128677381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PAC Privacy: Automatic Privacy Measurement and Control of Data Processing","authors":"Hanshen Xiao, S. Devadas","doi":"10.1007/978-3-031-38545-2_20","DOIUrl":"https://doi.org/10.1007/978-3-031-38545-2_20","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115614243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma
{"title":"On the Round Complexity of Secure Quantum Computation","authors":"James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma","doi":"10.1007/978-3-030-84242-0_15","DOIUrl":"https://doi.org/10.1007/978-3-030-84242-0_15","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123031243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rounding in the Rings","authors":"Feng-Hao Liu, Zhedong Wang","doi":"10.1007/978-3-030-56880-1_11","DOIUrl":"https://doi.org/10.1007/978-3-030-56880-1_11","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114552269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"New Techniques for Traitor Tracing: Size N1/3 and More from Pairings","authors":"Mark Zhandry","doi":"10.1007/978-3-030-56784-2_22","DOIUrl":"https://doi.org/10.1007/978-3-030-56784-2_22","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125152143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interactive Proofs for Social Graphs","authors":"L. Katzir, C. Shikhelman, E. Yogev","doi":"10.1007/978-3-030-56877-1_20","DOIUrl":"https://doi.org/10.1007/978-3-030-56877-1_20","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114075730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
