{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:30:14Z","timestamp":1768548614262,"version":"3.49.0"},"reference-count":35,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"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","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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.<\/jats:p>","DOI":"10.3390\/e23081001","type":"journal-article","created":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T21:51:07Z","timestamp":1627854667000},"page":"1001","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting"],"prefix":"10.3390","volume":"23","author":[{"given":"Bruno","family":"Costa","sequence":"first","affiliation":[{"name":"Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Av. Rovisco Pais, 1049-001 Lisbon, Portugal"},{"name":"Capgemini Engineering, Av. D. Jo\u00e3o II, Lote 1.07.2.1, Piso 2, 1990-096 Lisbon, Portugal"}]},{"given":"Pedro","family":"Branco","sequence":"additional","affiliation":[{"name":"Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Av. Rovisco Pais, 1049-001 Lisbon, Portugal"},{"name":"Instituto de Telecomunica\u00e7\u00f5es, IST Av. Rovisco Pais, 1049-001 Lisbon, Portugal"}]},{"given":"Manuel","family":"Goul\u00e3o","sequence":"additional","affiliation":[{"name":"Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Av. Rovisco Pais, 1049-001 Lisbon, Portugal"},{"name":"Instituto de Telecomunica\u00e7\u00f5es, IST Av. Rovisco Pais, 1049-001 Lisbon, Portugal"}]},{"given":"Mariano","family":"Lemus","sequence":"additional","affiliation":[{"name":"Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Av. Rovisco Pais, 1049-001 Lisbon, Portugal"}]},{"given":"Paulo","family":"Mateus","sequence":"additional","affiliation":[{"name":"Departamento de Matem\u00e1tica, Instituto Superior T\u00e9cnico, Av. Rovisco Pais, 1049-001 Lisbon, Portugal"},{"name":"Instituto de Telecomunica\u00e7\u00f5es, IST Av. Rovisco Pais, 1049-001 Lisbon, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"ref_1","first-page":"187","article-title":"How To Exchange Secrets with Oblivious Transfer","volume":"2005","author":"Rabin","year":"2005","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Wagner, D. (2008, January 17\u201321). Founding Cryptography on Oblivious Transfer\u2014Efficiently. Proceedings of the Advances in Cryptology\u2014CRYPTO 2008, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-85174-5"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Kilian, J. (1988, January 4\u20136). Founding Cryptography on Oblivious Transfer. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, IL, USA.","DOI":"10.1145\/62212.62215"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., and Wigderson, A. (2019). How to play any mental game, or a completeness theorem for protocols with honest majority. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, Association for Computing Machinery.","DOI":"10.1145\/3335741.3335755"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1008908.1008911","article-title":"Coin flipping by telephone a protocol for solving impossible problems","volume":"15","author":"Blum","year":"1983","journal-title":"ACM SIGACT News"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., and Maurer, U. (2000, January 14\u201318). General secure multi-party computation from any linear secret-sharing scheme. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2000, Bruges, Belgium.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1007\/s00145-011-9107-0","article-title":"Secure two-party computation via cut-and-choose oblivious transfer","volume":"25","author":"Lindell","year":"2012","journal-title":"J. Cryptol."},{"key":"ref_8","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_9","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C. (1987, January 16\u201320). Equivalence between two flavours of oblivious transfers. Proceedings of the Advances in Cryptology\u2014CRYPTO \u201987, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-48184-2_30"},{"key":"ref_10","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_11","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, New York, NY, USA.","DOI":"10.1145\/28395.28420"},{"key":"ref_12","unstructured":"Boneh, D. (2003, January 17\u201321). Extending Oblivious Transfers Efficiently. Proceedings of the Advances in Cryptology\u2014CRYPTO 2003, Santa Barbara, CA, USA."},{"key":"ref_13","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_14","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2019, January 18\u201322). Spot-light: Lightweight private set intersection from sparse ot extension. Proceedings of the Advances in Cryptology\u2014CRYPTO 2019, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"ref_15","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_16","unstructured":"Gilbert, H. (June, January 30). On Ideal Lattices and Learning with Errors over Rings. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2010, French Riviera, France."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Regev, O. (2005, January 22\u201324). On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA.","DOI":"10.1145\/1060590.1060603"},{"key":"ref_18","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_19","doi-asserted-by":"crossref","first-page":"012332","DOI":"10.1103\/PhysRevA.72.012332","article-title":"Information-theoretic security proof for quantum-key-distribution protocols","volume":"72","author":"Renner","year":"2005","journal-title":"Phys. Rev. A"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.12743\/quanta.v6i1.57","article-title":"Quantum Cryptography: Key Distribution and Beyond","volume":"6","author":"Pathak","year":"2017","journal-title":"Quanta"},{"key":"ref_21","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_22","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_23","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_24","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."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1038\/ncomms2268","article-title":"Experimental implementation of bit commitment in the noisy-storage model","volume":"3","author":"Ng","year":"2012","journal-title":"Nat. Commun."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"045002","DOI":"10.1088\/2058-9565\/aa78d6","article-title":"Quantum processing by remote quantum control","volume":"2","author":"Qiang","year":"2017","journal-title":"Quantum Sci. Technol."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"032302","DOI":"10.1103\/PhysRevA.65.032302","article-title":"Theoretically efficient high-capacity quantum-key-distribution scheme","volume":"65","author":"Long","year":"2002","journal-title":"Phys. Rev. A"},{"key":"ref_28","unstructured":"Gilbert, H. (June, January 30). Universally Composable Quantum Multi-party Computation. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2010, French Riviera, France."},{"key":"ref_29","unstructured":"Albrecht, M. (2019, January 15\u201317). A Framework for Universally Composable Oblivious Transfer from One-Round Key-Exchange. Proceedings of the IMA International Conference on Cryptography and Coding, Oxford, UK."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Branco, P., Fiolhais, L., Goul\u00e3o, M., Martins, P., Mateus, P., and Sousa, L. (2021, June 07). ROTed: Random Oblivious Transfer for Embedded Devices. Available online: https:\/\/eprint.iacr.org\/2021\/935.","DOI":"10.46586\/tches.v2021.i4.215-238"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Halevi, S. (2009, January 16\u201320). Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. Proceedings of the Advances in Cryptology\u2014CRYPTO 2009, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-03356-8"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Canetti, R. (2001, January 14\u201317). Universally Composable Security: A New Paradigm for Cryptographic Protocols. Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, USA.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref_33","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_34","unstructured":"Ding, J., Xie, X., and Lin, X. (2021, June 07). A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem. Cryptology ePrint Archive, Report 2012\/688. Available online: https:\/\/eprint.iacr.org\/2012\/688."},{"key":"ref_35","unstructured":"Canetti, R., Sarkar, P., and Wang, X. (2021, June 07). Triply Adaptive UC NIZK. Cryptology ePrint Archive, Report 2020\/1212. Available online: https:\/\/eprint.iacr.org\/2020\/1212."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/8\/1001\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:38:08Z","timestamp":1760164688000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/8\/1001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,31]]},"references-count":35,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["e23081001"],"URL":"https:\/\/doi.org\/10.3390\/e23081001","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,31]]}}}