{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:54:33Z","timestamp":1773525273835,"version":"3.50.1"},"reference-count":176,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T00:00:00Z","timestamp":1657152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","doi-asserted-by":"publisher","award":["SFRH\/BD\/144806\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144806\/2019"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","doi-asserted-by":"publisher","award":["UIDB\/50008\/2020"],"award-info":[{"award-number":["UIDB\/50008\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","doi-asserted-by":"publisher","award":["UIDP\/50008\/2020"],"award-info":[{"award-number":["UIDP\/50008\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","doi-asserted-by":"publisher","award":["PTDC\/EEI-TEL\/8017\/2020"],"award-info":[{"award-number":["PTDC\/EEI-TEL\/8017\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","doi-asserted-by":"publisher","award":["101017733"],"award-info":[{"award-number":["101017733"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","doi-asserted-by":"publisher","award":["101017733"],"award-info":[{"award-number":["101017733"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","doi-asserted-by":"publisher","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (FEDER)","doi-asserted-by":"publisher","award":["SFRH\/BD\/144806\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144806\/2019"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (FEDER)","doi-asserted-by":"publisher","award":["UIDB\/50008\/2020"],"award-info":[{"award-number":["UIDB\/50008\/2020"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (FEDER)","doi-asserted-by":"publisher","award":["UIDP\/50008\/2020"],"award-info":[{"award-number":["UIDP\/50008\/2020"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (FEDER)","doi-asserted-by":"publisher","award":["PTDC\/EEI-TEL\/8017\/2020"],"award-info":[{"award-number":["PTDC\/EEI-TEL\/8017\/2020"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (FEDER)","doi-asserted-by":"publisher","award":["101017733"],"award-info":[{"award-number":["101017733"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (FEDER)","doi-asserted-by":"publisher","award":["101017733"],"award-info":[{"award-number":["101017733"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (FEDER)","doi-asserted-by":"publisher","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["SFRH\/BD\/144806\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144806\/2019"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["UIDB\/50008\/2020"],"award-info":[{"award-number":["UIDB\/50008\/2020"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["UIDP\/50008\/2020"],"award-info":[{"award-number":["UIDP\/50008\/2020"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["PTDC\/EEI-TEL\/8017\/2020"],"award-info":[{"award-number":["PTDC\/EEI-TEL\/8017\/2020"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["SFRH\/BD\/144806\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144806\/2019"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["UIDB\/50008\/2020"],"award-info":[{"award-number":["UIDB\/50008\/2020"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["UIDP\/50008\/2020"],"award-info":[{"award-number":["UIDP\/50008\/2020"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["PTDC\/EEI-TEL\/8017\/2020"],"award-info":[{"award-number":["PTDC\/EEI-TEL\/8017\/2020"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"name":"The Foundation for Science and Technology\u2014FCT","award":["SFRH\/BD\/144806\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144806\/2019"]}]},{"name":"The Foundation for Science and Technology\u2014FCT","award":["UIDB\/50008\/2020"],"award-info":[{"award-number":["UIDB\/50008\/2020"]}]},{"name":"The Foundation for Science and Technology\u2014FCT","award":["UIDP\/50008\/2020"],"award-info":[{"award-number":["UIDP\/50008\/2020"]}]},{"name":"The Foundation for Science and Technology\u2014FCT","award":["PTDC\/EEI-TEL\/8017\/2020"],"award-info":[{"award-number":["PTDC\/EEI-TEL\/8017\/2020"]}]},{"name":"The Foundation for Science and Technology\u2014FCT","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"The Foundation for Science and Technology\u2014FCT","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"The Foundation for Science and Technology\u2014FCT","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"name":"Agence Nationale de la Recherche\u2014ANR","award":["SFRH\/BD\/144806\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144806\/2019"]}]},{"name":"Agence Nationale de la Recherche\u2014ANR","award":["UIDB\/50008\/2020"],"award-info":[{"award-number":["UIDB\/50008\/2020"]}]},{"name":"Agence Nationale de la Recherche\u2014ANR","award":["UIDP\/50008\/2020"],"award-info":[{"award-number":["UIDP\/50008\/2020"]}]},{"name":"Agence Nationale de la Recherche\u2014ANR","award":["PTDC\/EEI-TEL\/8017\/2020"],"award-info":[{"award-number":["PTDC\/EEI-TEL\/8017\/2020"]}]},{"name":"Agence Nationale de la Recherche\u2014ANR","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"Agence Nationale de la Recherche\u2014ANR","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"Agence Nationale de la Recherche\u2014ANR","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"name":"State Research Agency\u2014AEI","award":["SFRH\/BD\/144806\/2019"],"award-info":[{"award-number":["SFRH\/BD\/144806\/2019"]}]},{"name":"State Research Agency\u2014AEI","award":["UIDB\/50008\/2020"],"award-info":[{"award-number":["UIDB\/50008\/2020"]}]},{"name":"State Research Agency\u2014AEI","award":["UIDP\/50008\/2020"],"award-info":[{"award-number":["UIDP\/50008\/2020"]}]},{"name":"State Research Agency\u2014AEI","award":["PTDC\/EEI-TEL\/8017\/2020"],"award-info":[{"award-number":["PTDC\/EEI-TEL\/8017\/2020"]}]},{"name":"State Research Agency\u2014AEI","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"State Research Agency\u2014AEI","award":["101017733"],"award-info":[{"award-number":["101017733"]}]},{"name":"State Research Agency\u2014AEI","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Quantum cryptography is the field of cryptography that explores the quantum properties of matter. Generally, it aims to develop primitives beyond the reach of classical cryptography and to improve existing classical implementations. Although much of the work in this field covers quantum key distribution (QKD), there have been some crucial steps towards the understanding and development of quantum oblivious transfer (QOT). One can show the similarity between the application structure of both QKD and QOT primitives. Just as QKD protocols allow quantum-safe communication, QOT protocols allow quantum-safe computation. However, the conditions under which QOT is fully quantum-safe have been subject to intense scrutiny and study. In this review article, we survey the work developed around the concept of oblivious transfer within theoretical quantum cryptography. We focus on some proposed protocols and their security requirements. We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT security.<\/jats:p>","DOI":"10.3390\/e24070945","type":"journal-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T07:51:56Z","timestamp":1657180316000},"page":"945","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Quantum Oblivious Transfer: A Short Review"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4156-8607","authenticated-orcid":false,"given":"Manuel B.","family":"Santos","sequence":"first","affiliation":[{"name":"Instituto de Telecomunica\u00e7oes, 1049-001 Lisboa, Portugal"},{"name":"Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Universidade de Lisboa, 1049-001 Lisboa, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2393-8224","authenticated-orcid":false,"given":"Paulo","family":"Mateus","sequence":"additional","affiliation":[{"name":"Instituto de Telecomunica\u00e7oes, 1049-001 Lisboa, Portugal"},{"name":"Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Universidade de Lisboa, 1049-001 Lisboa, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2101-5896","authenticated-orcid":false,"given":"Armando N.","family":"Pinto","sequence":"additional","affiliation":[{"name":"Instituto de Telecomunica\u00e7oes, 3810-193 Aveiro, Portugal"},{"name":"Departamento de Eletr\u00f3nica, Telecomunica\u00e7oes e Inform\u00e1tica, Universidade de Aveiro, 3810-193 Aveiro, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10623-015-0157-4","article-title":"Quantum cryptography beyond quantum key distribution","volume":"78","author":"Broadbent","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MCOM.2013.6576337","article-title":"Using Quantum Technologies to Improve Fiber Optic Communication Systems","volume":"8","author":"Pinto","year":"2013","journal-title":"IEEE Commun. Mag."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Chailloux, A., and Kerenidis, I. (2011, January 22\u201325). Optimal Bounds for Quantum Bit Commitment. Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, CA, USA.","DOI":"10.1109\/FOCS.2011.42"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chailloux, A., and Kerenidis, I. (2009, January 25\u201327). Optimal Quantum Strong Coin Flipping. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA.","DOI":"10.1109\/FOCS.2009.71"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Fitzsimons, J., and Kashefi, E. (2009, January 25\u201327). Universal Blind Quantum Computation. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA.","DOI":"10.1109\/FOCS.2009.36"},{"key":"ref_6","unstructured":"Feigenbaum, J. (1991, January 8\u201311). Practical Quantum Oblivious Transfer. Proceedings of the Advances in Cryptology\u2014CRYPTO\u201991, Brighton, UK."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Garay, J.A., and Gennaro, R. (2014, January 17\u201321). Quantum Position Verification in the Random Oracle Model. Proceedings of the Advances in Cryptology\u2014CRYPTO 2014, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-662-44371-2"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2014.09.014","article-title":"Secure identification and QKD in the bounded-quantum-storage model","volume":"560","author":"Fehr","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Halevi, S. (2009, January 16\u201320). Improving the Security of Quantum Protocols via Commit-and-Open. Proceedings of the Advances in Cryptology\u2014CRYPTO 2009, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-03356-8"},{"key":"ref_10","unstructured":"Rabin, M.O. (1981). How to Exchange Secrets with Oblivious Transfer, Aiken Computation Laboratory, Harvard University. Technical Report TR-81."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C. (1986, January 27\u201329). How to generate and exchange secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), Washington, DC, USA.","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kilian, J. (1988, January 2\u20134). Founding crytpography on oblivious transfer. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing\u2014STOC\u201988, Chicago, IL, USA.","DOI":"10.1145\/62212.62215"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., and Scholl, P. (2016, January 24\u201328). MASCOT. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978357"},{"key":"ref_14","unstructured":"Wang, H., Pieprzyk, J., and Varadharajan, V. (2004). Single Database Private Information Retrieval with Logarithmic Communication. Information Security and Privacy, Springer."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Handschuh, H. (2017, January 14\u201317). Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. Proceedings of the Topics in Cryptology\u2014CT-RSA 2017, San Francisco, CA, USA.","DOI":"10.1007\/978-3-319-52153-4"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2663","DOI":"10.1007\/s11277-019-06544-2","article-title":"Efficient LBS Security-Preserving Based on NTRU Oblivious Transfer","volume":"108","author":"Bi","year":"2019","journal-title":"Wirel. Pers. Commun."},{"key":"ref_17","unstructured":"Santos, M.B., Mateus, P., and Vlachou, C. (2022). Quantum Universally Composable Oblivious Linear Evaluation. arXiv."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Santos, M.B., Gomes, A.C., Pinto, A.N., and Mateus, P. (2021, January 11\u201312). Quantum Secure Multiparty Computation of Phylogenetic Trees of SARS-CoV-2 Genome. Proceedings of the 2021 Telecoms Conference (ConfTELE), Leiria, Portugal.","DOI":"10.1109\/ConfTELE50222.2021.9435479"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"38065","DOI":"10.1109\/ACCESS.2022.3158416","article-title":"Private Computation of Phylogenetic Trees Based on Quantum Technologies","volume":"10","author":"Santos","year":"2022","journal-title":"IEEE Access"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1982, January 3\u20135). Protocols for secure computations. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), Chicago, IL, USA.","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., and Wigderson, A. (1987, January 25\u201327). How to Play ANY Mental Game. Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing\u2014STOC\u201987, New York, NY, USA.","DOI":"10.1145\/28395.28420"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s00145-016-9236-6","article-title":"More efficient oblivious transfer extensions","volume":"30","author":"Asharov","year":"2017","journal-title":"J. Cryptol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1007\/978-3-662-47989-6_35","article-title":"Actively Secure OT Extension with Optimal Overhead","volume":"Volume 9215","author":"Keller","year":"2015","journal-title":"Proceedings of the Advances in Cryptology\u2014CRYPTO 2015"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","volume":"26","author":"Shor","year":"1997","journal-title":"Siam J. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Yadav, V.K., Andola, N., Verma, S., and Venkatesan, S. (2022). A Survey of Oblivious Transfer Protocol. ACM Comput. Surv.","DOI":"10.1145\/3503045"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., and Rudich, S. (1989, January 14\u201317). Limits on the Provable Consequences of One-Way Permutations. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing\u2014STOC\u201989, Seattle, WA, USA.","DOI":"10.1145\/73007.73012"},{"key":"ref_27","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., and Viswanathan, M. (2000, January 12\u201314). The relationship between public key encryption and oblivious transfer. Proceedings of the Proceedings 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","article-title":"A Randomized Protocol for Signing Contracts","volume":"28","author":"Even","year":"1985","journal-title":"Commun. ACM"},{"key":"ref_29","unstructured":"Naor, M., and Pinkas, B. (2001, January 7\u20139). Efficient oblivious transfer protocols. Proceedings of the SODA\u201901, Washington, DC, USA."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-319-22174-8_3","article-title":"The Simplest Protocol for Oblivious Transfer","volume":"Volume 9230","author":"Chou","year":"2015","journal-title":"Proceedings of the 4th International Conference on Progress in Cryptology\u2014LATINCRYPT 2015"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Canteaut, A., and Standaert, F.X. (2021, January 17\u201321). Oblivious Transfer Is in MiniQCrypt. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2021, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-77870-5"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Malkin, T., and Peikert, C. (2021, January 16\u201320). One-Way Functions Imply Secure Computation in a Quantum World. Proceedings of the Advances in Cryptology\u2014CRYPTO 2021, Virtual.","DOI":"10.1007\/978-3-030-84245-1"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1049\/qtc2.12010","article-title":"Quantum and classical oblivious transfer: A comparative analysis","volume":"2","author":"Santos","year":"2021","journal-title":"IET Quantum Commun."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/235666.235669","article-title":"25 years of quantum cryptography","volume":"27","author":"Brassard","year":"1996","journal-title":"ACM SIGACT News"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Brassard, G. (2005, January 16\u201319). Brief history of quantum cryptography: A personal perspective. Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, Awaji Island, Japan.","DOI":"10.1109\/ITWTPI.2005.1543949"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s00450-006-0011-z","article-title":"Quantum cryptography beyond key exchange","volume":"21","year":"2006","journal-title":"Inform. Forsch. Und Entwickl."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/s10701-010-9408-4","article-title":"Quantum Cryptography","volume":"40","author":"Fehr","year":"2010","journal-title":"Found. Phys."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1364\/AOP.361502","article-title":"Advances in quantum cryptography","volume":"12","author":"Pirandola","year":"2020","journal-title":"Adv. Opt. Photonics"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Portmann, C., and Renner, R. (2021). Security in Quantum Cryptography. arXiv.","DOI":"10.1103\/RevModPhys.94.025008"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Sun, S., and Huang, A. (2022). A Review of Security Evaluation of Practical Quantum Key Distribution System. Entropy, 24.","DOI":"10.3390\/e24020260"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B. (1999). The Search for the Holy Grail in Quantum Cryptography. Lectures on Data Security: Modern Cryptology in Theory and Practice, Springer.","DOI":"10.1007\/3-540-48969-X"},{"key":"ref_42","unstructured":"Yao, A.C.C. (June, January 29). Security of quantum protocols against coherent measurements. Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing\u2014STOC\u201995, Las Vegas, NV, USA."},{"key":"ref_43","unstructured":"Brassard, G., Crepeau, C., Jozsa, R., and Langlois, D. (1993, January 3\u20135). A quantum bit commitment scheme provably unbreakable by both parties. Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science, Palo Alto, CA, USA."},{"key":"ref_44","unstructured":"Mayers, D. (1996). The Trouble with Quantum Bit Commitment. arXiv."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","article-title":"Is Quantum Bit Commitment Really Possible?","volume":"78","author":"Lo","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","article-title":"Unconditionally Secure Quantum Bit Commitment is Impossible","volume":"78","author":"Mayers","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1103\/PhysRevA.56.1154","article-title":"Insecurity of quantum secure computations","volume":"56","author":"Lo","year":"1997","journal-title":"Phys. Rev. A"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Colbeck, R. (2007). Impossibility of secure two-party classical computation. Phys. Rev. A, 76.","DOI":"10.1103\/PhysRevA.76.062308"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"160501","DOI":"10.1103\/PhysRevLett.109.160501","article-title":"Complete Insecurity of Quantum Protocols for Classical Two-Party Computation","volume":"109","author":"Buhrman","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"1450041","DOI":"10.1142\/S0219749914500415","article-title":"Quantifying the leakage of quantum protocols for classical two-party cryptography","volume":"13","author":"Salvail","year":"2014","journal-title":"Int. J. Quantum Inf."},{"key":"ref_51","unstructured":"Sahai, A. (2013, January 3\u20136). Feasibility and Completeness of Cryptographic Tasks in the Quantum World. Proceedings of the Theory of Cryptography, Tokyo, Japan."},{"key":"ref_52","unstructured":"Brassard, G., Cr\u00e9peau, C., Mayers, D., and Salvail, L. (1997). A brief review on the impossibility of quantum bit commitment. arXiv."},{"key":"ref_53","unstructured":"Yuen, H.P. (2000). Unconditionally Secure Quantum Bit Commitment Is Possible. arXiv."},{"key":"ref_54","unstructured":"Yuen, H.P. (2002). Quantum bit commitment and unconditional security. arXiv."},{"key":"ref_55","unstructured":"Yuen, H.P. (2003). How to Build Unconditionally Secure Quantum Bit Commitment Protocols. arXiv."},{"key":"ref_56","unstructured":"Cheung, C.Y. (2001). Quantum Bit Commitment can be Unconditionally Secure. arXiv."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1023\/A:1017597528026","article-title":"The quantum bit commitment theorem","volume":"31","author":"Bub","year":"2001","journal-title":"Found. Phys."},{"key":"ref_58","unstructured":"Cheung, C.Y. (2005). Secret parameters in quantum bit commitment. arXiv."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"4271","DOI":"10.1142\/S0217979207045517","article-title":"Quantum Bit Commitment with Secret Parameters","volume":"21","author":"Cheung","year":"2007","journal-title":"Int. J. Mod. Phys."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"032328","DOI":"10.1103\/PhysRevA.76.032328","article-title":"Reexamination of quantum bit commitment: The possible and the impossible","volume":"76","author":"Kretschmann","year":"2007","journal-title":"Phys. Rev. A"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"062348","DOI":"10.1103\/PhysRevA.81.062348","article-title":"Probabilistic theories with purification","volume":"81","author":"Chiribella","year":"2010","journal-title":"Phys. Rev. A"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1016\/j.physleta.2013.02.045","article-title":"A short impossibility proof of quantum bit commitment","volume":"377","author":"Chiribella","year":"2013","journal-title":"Phys. Lett."},{"key":"ref_63","unstructured":"He, G.P. (2013). Comment on \u201cA short impossibility proof of quantum bit commitment\u201d. arXiv."},{"key":"ref_64","unstructured":"Cohn-Gordon, K. (2012). Commitment Algorithms. [Master\u2019s Thesis, University of Oxford]."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Sun, X., He, F., and Wang, Q. (2020). Impossibility of Quantum Bit Commitment, a Categorical Perspective. Axioms, 9.","DOI":"10.3390\/axioms9010028"},{"key":"ref_66","unstructured":"Bouyer, P., and Schr\u00f6der, L. (2022, January 2\u20137). Categorical composable cryptography. Proceedings of the Foundations of Software Science and Computation Structures, Munich, Germany."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Aaronson, S. (2002, January 19\u201321). Quantum lower bound for the collision problem. Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing\u2014STOC\u201902, Montreal, QC, Canada.","DOI":"10.1145\/509998.509999"},{"key":"ref_68","unstructured":"Damgard, I., Fehr, S., Salvail, L., and Schaffner, C. (2005, January 23\u201325). Cryptography In the Bounded Quantum-Storage Model. Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), Pittsburgh, PA, USA."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"220502","DOI":"10.1103\/PhysRevLett.100.220502","article-title":"Cryptography from Noisy Storage","volume":"100","author":"Wehner","year":"2008","journal-title":"Phys. Rev. Lett."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"1962","DOI":"10.1109\/TIT.2011.2177772","article-title":"Unconditional Security From Noisy Quantum Storage","volume":"58","author":"Konig","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_71","doi-asserted-by":"crossref","unstructured":"Liu, Y.K. (2014, January 12\u201314). Building one-time memories from isolated qubits. Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, Princeton, NJ, USA.","DOI":"10.1145\/2554797.2554823"},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"062346","DOI":"10.1103\/PhysRevA.93.062346","article-title":"Spacetime-constrained oblivious transfer","volume":"93","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"012328","DOI":"10.1103\/PhysRevA.84.012328","article-title":"Location-oblivious data transfer with flying entangled qudits","volume":"84","author":"Kent","year":"2011","journal-title":"Phys. Rev. A"},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s00145-018-9278-z","article-title":"Everlasting Multi-party Computation","volume":"31","author":"Unruh","year":"2018","journal-title":"J. Cryptol."},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1008908.1008920","article-title":"Conjugate coding","volume":"15","author":"Wiesner","year":"1983","journal-title":"ACM SIGACT News"},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","article-title":"Quantum cryptography: Public key distribution and coin tossing","volume":"560","author":"Bennett","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Brassard, G., Breidbart, S., and Wiesner, S. (1983). Quantum Cryptography, or Unforgeable Subway Tokens. Advances in Cryptology, Springer.","DOI":"10.1007\/978-1-4757-0602-4_26"},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s11047-014-9453-6","article-title":"Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP","volume":"13","author":"Bennett","year":"2014","journal-title":"Nat. Comput."},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Reingold, O. (2009). Composing Quantum Protocols in a Classical Environment. Theory of Cryptography, Springer.","DOI":"10.1007\/978-3-642-00457-5"},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"022301","DOI":"10.1103\/PhysRevA.83.022301","article-title":"Practical private database queries based on a quantum-key-distribution protocol","volume":"83","author":"Jakobi","year":"2011","journal-title":"Phys. Rev. A"},{"key":"ref_81","doi-asserted-by":"crossref","unstructured":"Lemus, M., Ramos, M.F., Yadav, P., Silva, N.A., Muga, N.J., Souto, A., Paunkovi\u0107, N., Mateus, P., and Pinto, A.N. (2020). Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation. Appl. Sci., 10.","DOI":"10.3390\/app10124080"},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Crepeau, C., and Kilian, J. (1988, January 24\u201326). Achieving oblivious transfer using weakened security assumptions. Proceedings of the 29th Annual Symposium on Foundations of Computer Science, White Plains, NY, USA.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref_83","unstructured":"Mayers, D., and Salvail, L. (1994, January 17\u201320). Quantum oblivious transfer is secure against all individual measurements. Proceedings of the Proceedings Workshop on Physics and Computation, PhysComp\u201994, Dallas, TX, USA."},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"Mayers, D. (1996, January 18\u201322). Quantum Key Distribution and String Oblivious Transfer in Noisy Channels. Proceedings of the Advances in Cryptology\u2014CRYPTO\u201996, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-68697-5_26"},{"key":"ref_85","unstructured":"Naor, M. (2004). Computational Collapse of Quantum State with Application to Oblivious Transfer. Theory of Cryptography, Springer."},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Unruh, D. (June, January 30). Universally Composable Quantum Multi-party Computation. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2010, French Riviera, France.","DOI":"10.1007\/978-3-642-13190-5_25"},{"key":"ref_87","doi-asserted-by":"crossref","unstructured":"Bouman, N.J., and Fehr, S. (2010, January 15\u201319). Sampling in a Quantum Population, and Applications. Proceedings of the Advances in Cryptology\u2014CRYPTO 2010, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-14623-7_39"},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1038\/nphys1734","article-title":"The uncertainty principle in the presence of quantum memory","volume":"6","author":"Berta","year":"2010","journal-title":"Nat. Phys."},{"key":"ref_89","doi-asserted-by":"crossref","unstructured":"Tomamichel, M., and Renner, R. (2011). Uncertainty Relation for Smooth Entropies. Phys. Rev. Lett., 106.","DOI":"10.1103\/PhysRevLett.106.110506"},{"key":"ref_90","unstructured":"Renner, R. (2006). Security of Quantum Key Distribution. arXiv."},{"key":"ref_91","doi-asserted-by":"crossref","unstructured":"Menezes, A. (2007, January 19\u201323). A Tight High-Order Entropic Quantum Uncertainty Relation with Applications. Proceedings of the Advances in Cryptology\u2014CRYPTO 2007, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-74143-5"},{"key":"ref_92","doi-asserted-by":"crossref","unstructured":"Renner, R., and K\u00f6nig, R. (2005). Universally Composable Privacy Amplification Against Quantum Adversaries. Theory of Cryptography, Springer.","DOI":"10.1007\/978-3-540-30576-7_22"},{"key":"ref_93","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","article-title":"Bit commitment using pseudorandomness","volume":"4","author":"Naor","year":"1991","journal-title":"J. Cryptol."},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","article-title":"A Pseudorandom Generator from any One-way Function","volume":"28","author":"Impagliazzo","year":"1999","journal-title":"SIAM J. Comput."},{"key":"ref_95","doi-asserted-by":"crossref","unstructured":"Haitner, I., and Reingold, O. (2007, January 11\u201313). Statistically-hiding commitment from any one-way function. Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing\u2014STOC\u201907, San Diego, CA, USA.","DOI":"10.1145\/1250790.1250792"},{"key":"ref_96","doi-asserted-by":"crossref","unstructured":"Kilian, J. (2001, January 19\u201323). Universally Composable Commitments. Proceedings of the Advances in Cryptology\u2014CRYPTO 2001, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-44647-8"},{"key":"ref_97","unstructured":"Paterson, K.G. (2011, January 15\u201319). Concurrent Composition in the Bounded Quantum Storage Model. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2011, Tallinn, Estonia."},{"key":"ref_98","doi-asserted-by":"crossref","first-page":"085006","DOI":"10.1088\/1367-2630\/11\/8\/085006","article-title":"Composability in quantum cryptography","volume":"11","author":"Renner","year":"2009","journal-title":"New J. Phys."},{"key":"ref_99","unstructured":"Ben-Or, M., and Mayers, D. (2004). General Security Definition and Composability for Quantum & Classical Protocols. arXiv."},{"key":"ref_100","unstructured":"Unruh, D. (2004). Simulatable security for quantum protocols. arXiv."},{"key":"ref_101","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3402457","article-title":"Universally Composable Security","volume":"67","author":"Canetti","year":"2020","journal-title":"J. ACM"},{"key":"ref_102","unstructured":"Chazelle, B. (2011, January 7\u20139). Abstract Cryptography. Proceedings of the Second Symposium on Innovations in Computer Science, ICS 2011, Beijing, China."},{"key":"ref_103","doi-asserted-by":"crossref","unstructured":"Mandayam, P., and Wehner, S. (2011). Achieving the physical limits of the bounded-storage model. Phys. Rev. A, 83.","DOI":"10.1103\/PhysRevA.83.022329"},{"key":"ref_104","doi-asserted-by":"crossref","unstructured":"Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., and Walukiewicz, I. (2008, January 7\u201311). Composable Security in the Bounded-Quantum-Storage Model. Proceedings of the Automata, Languages and Programming, Reykjavik, Iceland.","DOI":"10.1007\/978-3-540-70575-8"},{"key":"ref_105","doi-asserted-by":"crossref","first-page":"032308","DOI":"10.1103\/PhysRevA.82.032308","article-title":"Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model","volume":"82","author":"Schaffner","year":"2010","journal-title":"Phys. Rev. A"},{"key":"ref_106","unstructured":"Cachin, C., Crepeau, C., and Marcil, J. (1998, January 8\u201311). Oblivious transfer with a memory-bounded receiver. Proceedings of the Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), Palo Alto, CA, USA."},{"key":"ref_107","unstructured":"Naor, M. (2004). Constant-Round Oblivious Transfer in the Bounded Storage Model. Theory of Cryptography, Springer."},{"key":"ref_108","unstructured":"Savvides, G. (2007). Interactive Hashing and Reductions between Oblivious Transfer Variants. [Ph.D. Thesis, McGill University, School of Computer Science]."},{"key":"ref_109","first-page":"963","article-title":"Robust cryptography in the noisy-quantum-storage model","volume":"9","author":"Schaffner","year":"2009","journal-title":"Quantum Inf. Comput."},{"key":"ref_110","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1080\/00107514.2016.1148333","article-title":"Attacks on practical quantum key distribution systems (and how to prevent them)","volume":"57","author":"Jain","year":"2016","journal-title":"Contemp. Phys."},{"key":"ref_111","first-page":"273","article-title":"Self testing quantum apparatus","volume":"4","author":"Mayers","year":"2004","journal-title":"Quantum Inf. Comput."},{"key":"ref_112","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","article-title":"Quantum cryptography based on Bell\u2019s theorem","volume":"67","author":"Ekert","year":"1991","journal-title":"Phys. Rev. Lett."},{"key":"ref_113","doi-asserted-by":"crossref","first-page":"055004","DOI":"10.1088\/1367-2630\/18\/5\/055004","article-title":"Device-independent two-party cryptography secure against sequential attacks","volume":"18","author":"Kaniewski","year":"2016","journal-title":"New J. Phys."},{"key":"ref_114","doi-asserted-by":"crossref","first-page":"062307","DOI":"10.1103\/PhysRevA.97.062307","article-title":"Device independence for two-party cryptography and position verification with memoryless devices","volume":"97","author":"Ribeiro","year":"2018","journal-title":"Phys. Rev. A"},{"key":"ref_115","doi-asserted-by":"crossref","first-page":"120405","DOI":"10.1103\/PhysRevLett.97.120405","article-title":"From Bell\u2019s Theorem to Secure Quantum Key Distribution","volume":"97","author":"Gisin","year":"2006","journal-title":"Phys. Rev. Lett."},{"key":"ref_116","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1103\/PhysRevLett.23.880","article-title":"Proposed Experiment to Test Local Hidden-Variable Theories","volume":"23","author":"Clauser","year":"1969","journal-title":"Phys. Rev. Lett."},{"key":"ref_117","unstructured":"Broadbent, A., and Yuen, P. (2021). Device-Independent Oblivious Transfer from the Bounded-Quantum-Storage-Model and Computational Assumptions. arXiv."},{"key":"ref_118","doi-asserted-by":"crossref","first-page":"123021","DOI":"10.1088\/1367-2630\/ac304b","article-title":"Device-independent quantum key distribution from computational assumptions","volume":"23","author":"Metger","year":"2021","journal-title":"New J. Phys."},{"key":"ref_119","doi-asserted-by":"crossref","first-page":"544","DOI":"10.22331\/q-2021-09-16-544","article-title":"Self-testing of a single quantum device under computational assumptions","volume":"5","author":"Metger","year":"2021","journal-title":"Quantum"},{"key":"ref_120","doi-asserted-by":"crossref","unstructured":"Peikert, C. (2015). A Decade of Lattice Cryptography, Now Publishers Inc.. Cryptology ePrint Archive, Paper 2015\/939.","DOI":"10.1561\/9781680831139"},{"key":"ref_121","unstructured":"Ribeiro, J., and Wehner, S. (2020). On Bit Commitment and Oblivious Transfer in Measurement-Device Independent settings. arXiv."},{"key":"ref_122","doi-asserted-by":"crossref","first-page":"130503","DOI":"10.1103\/PhysRevLett.108.130503","article-title":"Measurement-Device-Independent Quantum Key Distribution","volume":"108","author":"Lo","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_123","doi-asserted-by":"crossref","first-page":"035011","DOI":"10.1088\/2058-9565\/ab2819","article-title":"Towards a realization of device-independent quantum key distribution","volume":"4","author":"Murta","year":"2019","journal-title":"Quantum Sci. Technol."},{"key":"ref_124","doi-asserted-by":"crossref","first-page":"032326","DOI":"10.1103\/PhysRevA.91.032326","article-title":"Attacks exploiting deviation of mean photon number in quantum key distribution and coin tossing","volume":"91","author":"Sajeed","year":"2015","journal-title":"Phys. Rev. A"},{"key":"ref_125","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Guang, Q., Gao, C., Jiang, D., and Chen, L. (2020). Measurement-Device-Independent Two-Party Cryptography with Error Estimation. Sensors, 20.","DOI":"10.3390\/s20216351"},{"key":"ref_126","doi-asserted-by":"crossref","unstructured":"Wagner, D. (2008, January 17\u201321). One-Time Programs. Proceedings of the Advances in Cryptology\u2014CRYPTO 2008, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-85174-5"},{"key":"ref_127","doi-asserted-by":"crossref","first-page":"2385","DOI":"10.1080\/09500349414552221","article-title":"A \u2018Pretty Good\u2019 Measurement for Distinguishing Quantum States","volume":"41","author":"Hausladen","year":"1994","journal-title":"J. Mod. Opt."},{"key":"ref_128","doi-asserted-by":"crossref","unstructured":"Garay, J.A., and Gennaro, R. (2014, January 17\u201321). Single-Shot Security for One-Time Memories in the Isolated Qubits Model. Proceedings of the Advances in Cryptology\u2014CRYPTO 2014, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-662-44371-2"},{"key":"ref_129","doi-asserted-by":"crossref","unstructured":"Oswald, E., and Fischlin, M. (2015, January 26\u201330). Privacy Amplification in the Isolated Qubits Model. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2015, Sofia, Bulgaria.","DOI":"10.1007\/978-3-662-46800-5"},{"key":"ref_130","doi-asserted-by":"crossref","first-page":"032320","DOI":"10.1103\/PhysRevA.73.032320","article-title":"Variable-bias coin tossing","volume":"73","author":"Colbeck","year":"2006","journal-title":"Phys. Rev. A"},{"key":"ref_131","unstructured":"Kaniewski, J. (2015). Relativistic quantum cryptography. arXiv."},{"key":"ref_132","doi-asserted-by":"crossref","first-page":"043057","DOI":"10.1088\/1367-2630\/ab0e3b","article-title":"Composable security in relativistic quantum cryptography","volume":"21","author":"Vilasini","year":"2019","journal-title":"New J. Phys."},{"key":"ref_133","unstructured":"Laneve, L., and del Rio, L. (2021). Impossibility of composable Oblivious Transfer in relativistic quantum cryptography. arXiv."},{"key":"ref_134","doi-asserted-by":"crossref","first-page":"032327","DOI":"10.1103\/PhysRevA.98.032327","article-title":"Practical and unconditionally secure spacetime-constrained oblivious transfer","volume":"98","author":"Kerenidis","year":"2018","journal-title":"Phys. Rev. A"},{"key":"ref_135","doi-asserted-by":"crossref","first-page":"012302","DOI":"10.1103\/PhysRevA.100.012302","article-title":"One-out-of-m spacetime-constrained oblivious transfer","volume":"100","year":"2019","journal-title":"Phys. Rev. A"},{"key":"ref_136","doi-asserted-by":"crossref","first-page":"2153","DOI":"10.1007\/s11128-015-0970-8","article-title":"Secure quantum weak oblivious transfer against individual measurements","volume":"14","author":"He","year":"2015","journal-title":"Quantum Inf. Process."},{"key":"ref_137","first-page":"158","article-title":"Lower bounds for quantum oblivious transfer","volume":"13","author":"Chailloux","year":"2013","journal-title":"Quantum Inf. Comput."},{"key":"ref_138","unstructured":"Chailloux, A., Gutoski, G., and Sikora, J. (2016). Optimal bounds for semi-honest quantum oblivious transfer. Chic. J. Theor. Comput. Sci., 2016."},{"key":"ref_139","doi-asserted-by":"crossref","unstructured":"Coppersmith, D. (1995, January 27\u201331). Precomputing Oblivious Transfer. Proceedings of the Advances in Cryptology\u2014CRYPT0\u201995, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-44750-4"},{"key":"ref_140","unstructured":"Osborn, S., and Sikora, J. (2022). A constant lower bound for any quantum protocol for secure function evaluation. arXiv."},{"key":"ref_141","doi-asserted-by":"crossref","first-page":"89","DOI":"10.22331\/q-2018-09-03-89","article-title":"Fidelity of quantum strategies with applications to cryptography","volume":"2","author":"Gutoski","year":"2018","journal-title":"Quantum"},{"key":"ref_142","doi-asserted-by":"crossref","unstructured":"Amiri, R., St\u00e1rek, R., Reichmuth, D., Puthoor, I.V., Mi\u010duda, M., Ladislav Mi\u0161ta, J., Du\u0161ek, M., Wallden, P., and Andersson, E. (2021). Imperfect 1-Out-of-2 Quantum Oblivious Transfer: Bounds, a Protocol, and its Experimental Implementation. PRX Quantum, 2.","DOI":"10.1103\/PRXQuantum.2.010335"},{"key":"ref_143","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1006\/jcss.1999.1689","article-title":"Protecting Data Privacy in Private Information Retrieval Schemes","volume":"60","author":"Gertner","year":"2000","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_144","doi-asserted-by":"crossref","first-page":"230502","DOI":"10.1103\/PhysRevLett.100.230502","article-title":"Quantum Private Queries","volume":"100","author":"Giovannetti","year":"2008","journal-title":"Phys. Rev. Lett."},{"key":"ref_145","doi-asserted-by":"crossref","first-page":"3465","DOI":"10.1109\/TIT.2010.2048446","article-title":"Quantum Private Queries: Security Analysis","volume":"56","author":"Giovannetti","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_146","doi-asserted-by":"crossref","first-page":"022313","DOI":"10.1103\/PhysRevA.84.022313","article-title":"Secure quantum private information retrieval using phase-encoded queries","volume":"84","author":"Olejnik","year":"2011","journal-title":"Phys. Rev. A"},{"key":"ref_147","doi-asserted-by":"crossref","first-page":"057901","DOI":"10.1103\/PhysRevLett.92.057901","article-title":"Quantum Cryptography Protocols Robust against Photon Number Splitting Attacks for Weak Laser Pulse Implementations","volume":"92","author":"Scarani","year":"2004","journal-title":"Phys. Rev. Lett."},{"key":"ref_148","doi-asserted-by":"crossref","first-page":"17411","DOI":"10.1364\/OE.20.017411","article-title":"Flexible quantum private queries based on quantum key distribution","volume":"20","author":"Gao","year":"2012","journal-title":"Opt. Express"},{"key":"ref_149","first-page":"012331","article-title":"Towards Communication-Efficient Quantum Oblivious Key Distribution","volume":"87","author":"Rao","year":"2012","journal-title":"Phys. Rev. A"},{"key":"ref_150","doi-asserted-by":"crossref","first-page":"022334","DOI":"10.1103\/PhysRevA.88.022334","article-title":"Private database queries based on counterfactual quantum key distribution","volume":"88","author":"Zhang","year":"2013","journal-title":"Phys. Rev. A"},{"key":"ref_151","doi-asserted-by":"crossref","first-page":"7537","DOI":"10.1038\/srep07537","article-title":"Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol","volume":"4","author":"Wei","year":"2014","journal-title":"Sci. Rep."},{"key":"ref_152","doi-asserted-by":"crossref","first-page":"5233","DOI":"10.1038\/srep05233","article-title":"Performing private database queries in a real-world environment using a quantum protocol","volume":"4","author":"Chan","year":"2014","journal-title":"Sci. Rep."},{"key":"ref_153","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/JSTQE.2014.2358192","article-title":"Postprocessing of the Oblivious Key in Quantum Private Query","volume":"21","author":"Gao","year":"2015","journal-title":"IEEE J. Sel. Top. Quantum Electron."},{"key":"ref_154","doi-asserted-by":"crossref","first-page":"100301","DOI":"10.1007\/s11433-015-5714-3","article-title":"QKD-based quantum private query without a failure probability","volume":"58","author":"Liu","year":"2015","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"ref_155","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/s11128-014-0902-z","article-title":"Private database queries using one quantum state","volume":"14","author":"Yang","year":"2015","journal-title":"Quantum Inf. Process."},{"key":"ref_156","doi-asserted-by":"crossref","first-page":"4201","DOI":"10.1007\/s11128-015-1091-0","article-title":"Enhancing user privacy in SARG04-based private database query protocols","volume":"14","author":"Yu","year":"2015","journal-title":"Quantum Inf. Process."},{"key":"ref_157","doi-asserted-by":"crossref","first-page":"042318","DOI":"10.1103\/PhysRevA.93.042318","article-title":"Practical quantum private query with better performance in resisting joint-measurement attack","volume":"93","author":"Wei","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_158","doi-asserted-by":"crossref","first-page":"4033","DOI":"10.1016\/j.physleta.2016.10.017","article-title":"Quantum private query with perfect user privacy against a joint-measurement attack","volume":"380","author":"Yang","year":"2016","journal-title":"Phys. Lett. A"},{"key":"ref_159","doi-asserted-by":"crossref","first-page":"042344","DOI":"10.1103\/PhysRevA.95.042344","article-title":"Device-independent quantum private query","volume":"95","author":"Maitra","year":"2017","journal-title":"Phys. Rev. A"},{"key":"ref_160","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.2017.2721404","article-title":"A Generic Construction of Quantum-Oblivious-Key-Transfer-Based Private Query with Ideal Database Security and Zero Failure","volume":"67","author":"Wei","year":"2018","journal-title":"IEEE Trans. Comput."},{"key":"ref_161","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1088\/0253-6102\/69\/1\/31","article-title":"A Quantum Private Query Protocol for Enhancing both User and Database Privacy","volume":"69","author":"Zhou","year":"2018","journal-title":"Commun. Theor. Phys."},{"key":"ref_162","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1007\/s10773-019-04062-2","article-title":"Practical Two-Way QKD-Based Quantum Private Query with Better Performance in User Privacy","volume":"58","author":"Chang","year":"2019","journal-title":"Int. J. Theor. Phys."},{"key":"ref_163","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10773-018-3940-y","article-title":"Robust High Capability QKD-Based Database Private Query","volume":"58","author":"Du","year":"2019","journal-title":"Int. J. Theor. Phys."},{"key":"ref_164","doi-asserted-by":"crossref","unstructured":"Ye, T.Y., Li, H.K., and Hu, J.L. (2020). Semi-Quantum Private Query Protocol without Invoking the Measurement Capability of Classical User. Int. J. Theor. Phys.","DOI":"10.1007\/s10773-020-04476-3"},{"key":"ref_165","unstructured":"Pomerance, C. (1987, January 16\u201320). Equivalence Between Two Flavours of Oblivious Transfers. Proceedings of the Advances in Cryptology\u2014CRYPTO\u201987, Santa Barbara, CA, USA."},{"key":"ref_166","doi-asserted-by":"crossref","first-page":"044304","DOI":"10.1103\/PhysRevA.73.044304","article-title":"Nonequivalence of two flavors of oblivious transfer at the quantum level","volume":"73","author":"He","year":"2006","journal-title":"Phys. Rev. A"},{"key":"ref_167","doi-asserted-by":"crossref","first-page":"3838","DOI":"10.1016\/j.ijleo.2015.07.151","article-title":"Quantum oblivious transfer based on unambiguous set discrimination","volume":"126","author":"Yang","year":"2015","journal-title":"Optik"},{"key":"ref_168","doi-asserted-by":"crossref","first-page":"3031","DOI":"10.1007\/s11128-015-1013-1","article-title":"Quantum oblivious transfer with relaxed constraints on the receiver","volume":"14","author":"Yang","year":"2015","journal-title":"Quantum Inf. Process."},{"key":"ref_169","doi-asserted-by":"crossref","first-page":"012331","DOI":"10.1103\/PhysRevA.73.012331","article-title":"Oblivious transfer using quantum entanglement","volume":"73","author":"He","year":"2006","journal-title":"Phys. Rev. A"},{"key":"ref_170","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00145-002-0146-4","article-title":"Oblivious Transfers and Privacy Amplification","volume":"16","author":"Brassard","year":"2003","journal-title":"J. Cryptol."},{"key":"ref_171","unstructured":"Stroh, L., St\u00e1rek, R., Horov\u00e1, N., Puthoor, I.V., Du\u0161ek, M., and Andersson, E. (2006). A non-interactive XOR quantum oblivious transfer protocol. arXiv."},{"key":"ref_172","doi-asserted-by":"crossref","first-page":"725","DOI":"10.22331\/q-2022-05-30-725","article-title":"A device-independent protocol for XOR oblivious transfer","volume":"6","author":"Kundu","year":"2022","journal-title":"Quantum"},{"key":"ref_173","doi-asserted-by":"crossref","first-page":"3333","DOI":"10.1007\/s10773-019-04206-4","article-title":"A Novel Application of Probabilistic Teleportation: p-Rabin Quantum Oblivious Transfer of a Qubit","volume":"58","author":"Zhang","year":"2019","journal-title":"Int. J. Theor. Phys."},{"key":"ref_174","doi-asserted-by":"crossref","first-page":"052336","DOI":"10.1103\/PhysRevA.81.052336","article-title":"Implementation of two-party protocols in the noisy-storage model","volume":"81","author":"Wehner","year":"2010","journal-title":"Phys. Rev. A"},{"key":"ref_175","doi-asserted-by":"crossref","first-page":"3418","DOI":"10.1038\/ncomms4418","article-title":"An experimental implementation of oblivious transfer in the noisy storage model","volume":"5","author":"Erven","year":"2014","journal-title":"Nat. Commun."},{"key":"ref_176","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1038\/s41467-018-03729-4","article-title":"Continuous-variable protocol for oblivious transfer in the noisy-storage model","volume":"9","author":"Furrer","year":"2018","journal-title":"Nat. Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/945\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:43:55Z","timestamp":1760139835000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,7]]},"references-count":176,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["e24070945"],"URL":"https:\/\/doi.org\/10.3390\/e24070945","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202206.0209.v1","asserted-by":"object"}]},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,7]]}}}