{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:09:07Z","timestamp":1760123347940,"version":"build-2065373602"},"reference-count":15,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union\u2019s Horizon Europe research and innovation program","doi-asserted-by":"publisher","award":["101114043","QSNP","101091642","QCI-CAT","QSCAN"],"award-info":[{"award-number":["101114043","QSNP","101091642","QCI-CAT","QSCAN"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DIGITAL-2021-QCI-01 Digital European Program","award":["101114043","QSNP","101091642","QCI-CAT","QSCAN"],"award-info":[{"award-number":["101114043","QSNP","101091642","QCI-CAT","QSCAN"]}]},{"DOI":"10.13039\/501100004955","name":"National Foundation for Research, Technology and Development","doi-asserted-by":"publisher","award":["101114043","QSNP","101091642","QCI-CAT","QSCAN"],"award-info":[{"award-number":["101114043","QSNP","101091642","QCI-CAT","QSCAN"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science for Peace and Security (SPS) NATO Programme","award":["101114043","QSNP","101091642","QCI-CAT","QSCAN"],"award-info":[{"award-number":["101114043","QSNP","101091642","QCI-CAT","QSCAN"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Commitment schemes (CSs) are essential to many cryptographic protocols and schemes with applications that include privacy-preserving computation on data, privacy-preserving authentication, and, in particular, oblivious transfer protocols. For quantum oblivious transfer (qOT) protocols, unconditionally binding commitment schemes that do not rely on hardness assumptions from structured mathematical problems are required. These additional constraints severely limit the choice of commitment schemes to random oracle-based constructions or Naor\u2019s bit commitment scheme. As these protocols commit to individual bits, the use of such commitment schemes comes at a high bandwidth and computational cost. In this work, we investigate improvements to the efficiency of commitment schemes used in qOT protocols and propose an extension of Naor\u2019s commitment scheme requiring the existence of one-way functions (OWFs) to reduce communication complexity for 2-bit strings. Additionally, we provide an interactive string commitment scheme with preprocessing to enable the fast and efficient computation of commitments.<\/jats:p>","DOI":"10.3390\/e27070751","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T11:52:58Z","timestamp":1752580378000},"page":"751","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Commitment Schemes from OWFs with Applications to Quantum Oblivious Transfer"],"prefix":"10.3390","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1829-4882","authenticated-orcid":false,"given":"Thomas","family":"Lor\u00fcnser","sequence":"first","affiliation":[{"name":"AIT Austrian Institute of Technology, Center for Digital Safety and Security, Giefinggasse 4, 1210 Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1957-3725","authenticated-orcid":false,"given":"Sebastian","family":"Ramacher","sequence":"additional","affiliation":[{"name":"AIT Austrian Institute of Technology, Center for Digital Safety and Security, Giefinggasse 4, 1210 Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2065-2673","authenticated-orcid":false,"given":"Federico","family":"Valbusa","sequence":"additional","affiliation":[{"name":"AIT Austrian Institute of Technology, Center for Digital Safety and Security, Giefinggasse 4, 1210 Vienna, Austria"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Naor, M., and Pinkas, B. (1999, January 1\u20134). Oblivious Transfer and Polynomial Evaluation. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, USA.","DOI":"10.1145\/301250.301312"},{"key":"ref_2","first-page":"214","article-title":"SPHF-Friendly Non-interactive Commitments","volume":"Volume 8269","author":"Sako","year":"2013","journal-title":"Proceedings of the 19th International Conference on the Theory and Application of Cryptology and Information"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/3387108","article-title":"Secure multiparty computation","volume":"64","author":"Lindell","year":"2021","journal-title":"Commun. ACM"},{"key":"ref_4","unstructured":"Deswarte, Y., Cuppens, F., Jajodia, S., and Wang, L. (2004). Efficient Simultaneous Contract Signing. Security and Protection in Information Processing Systems, Proceedings of the IFIP 18th World Computer Congress TC11 19th International Information Security Conference, Toulouse, France, 22\u201327 August 2004, Springer."},{"key":"ref_5","unstructured":"Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., and Halevi, S. (2016, January 24\u201328). Efficient Batched Oblivious PRF with Applications to Private Set Intersection. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria."},{"key":"ref_6","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., and Viswanathan, M. (2000, January 2\u201314). The Relationship between Public Key Encryption and Oblivious Transfer. Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Santos, M.B., Mateus, P., and Pinto, A.N. (2022). Quantum oblivious transfer: A short review. Entropy, 24.","DOI":"10.20944\/preprints202206.0209.v1"},{"key":"ref_8","unstructured":"Lemus, M., Schiansky, P., Goul\u00e3o, M., Bozzio, M., Elkouss, D., Paunkovi\u0107, N., Mateus, P., and Walther, P. (2025). Performance of Practical Quantum Oblivious Key Distribution. arXiv."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J. (1992). Practical Quantum Oblivious Transfer. Advances in Cryptology\u2014CRYPTO \u201991, Springer.","DOI":"10.1007\/3-540-46766-1"},{"key":"ref_10","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, Montreal, QC, Canada.","DOI":"10.1145\/509998.509999"},{"key":"ref_11","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_12","first-page":"663","article-title":"Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise","volume":"Volume 7658","author":"Wang","year":"2012","journal-title":"Proceedings of the 18th International Conference on the Theory and Application of Cryptology and Information Security"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Koblitz, N. (1996). Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. Advances in Cryptology\u2014CRYPTO \u201996, Proceedings of the 16th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 1996, Springer.","DOI":"10.1007\/3-540-68697-5"},{"key":"ref_14","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_15","doi-asserted-by":"crossref","unstructured":"Faz-Hernandez, A., L\u00f3pez, J., and de Oliveira, A.K.D.S. (2018, January 4). SoK: A Performance Evaluation of Cryptographic Instruction Sets on Modern Architectures. Proceedings of the ASIA CCS \u201918: ACM Asia Conference on Computer and Communications Security, Incheon, Republic of Korea.","DOI":"10.1145\/3197507.3197511"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/7\/751\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:09:46Z","timestamp":1760033386000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/7\/751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,15]]},"references-count":15,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["e27070751"],"URL":"https:\/\/doi.org\/10.3390\/e27070751","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,7,15]]}}}