{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:24:45Z","timestamp":1760145885398,"version":"build-2065373602"},"reference-count":41,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T00:00:00Z","timestamp":1726444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Support Plan for Scientific and Technological Innovation Teams in Universities of Henan Province","award":["20IRTSTHN013","ICNS202006"],"award-info":[{"award-number":["20IRTSTHN013","ICNS202006"]}]},{"name":"Shaanxi Key Laboratory of Information Communication Network and Security, Xi\u2019an University of Posts &amp; Telecommunications","award":["20IRTSTHN013","ICNS202006"],"award-info":[{"award-number":["20IRTSTHN013","ICNS202006"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The existing lattice-based cut-and-choose oblivious transfer protocol is constructed based on the learning-with-errors (LWE) problem, which generally has the problem of inefficiency. An efficient cut-and-choose oblivious transfer protocol is proposed based on the difficult module-learning-with-errors (MLWE) problem. Compression and decompression techniques are introduced in the LWE-based dual-mode encryption system to improve it to an MLWE-based dual-mode encryption framework, which is applied to the protocol as an intermediate scheme. Subsequently, the security and efficiency of the protocol are analysed, and the security of the protocol can be reduced to the shortest independent vector problem (SIVP) on the lattice, which is resistant to quantum attacks. Since the whole protocol relies on the polynomial ring of elements to perform operations, the efficiency of polynomial modulo multiplication can be improved by using fast Fourier transform (FFT). Finally, this paper compares the protocol with an LWE-based protocol in terms of computational and communication complexities. The analysis results show that the protocol reduces the computation and communication overheads by at least a factor of n\u00a0while maintaining the optimal number of communication rounds under malicious adversary attacks.<\/jats:p>","DOI":"10.3390\/e26090793","type":"journal-article","created":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T11:36:37Z","timestamp":1726486597000},"page":"793","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An MLWE-Based Cut-and-Choose Oblivious Transfer Protocol"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2783-7065","authenticated-orcid":false,"given":"Yongli","family":"Tang","sequence":"first","affiliation":[{"name":"School of Software, Henan Polytechnic University, Jiaozuo 454000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1516-4116","authenticated-orcid":false,"given":"Menghao","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0825-8348","authenticated-orcid":false,"given":"Yachao","family":"Huo","sequence":"additional","affiliation":[{"name":"Jiyuan Branch, Bank of Communications Co., Ltd., Jiyuan 459099, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongqu","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Software, Henan Polytechnic University, Jiaozuo 454000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5079-7906","authenticated-orcid":false,"given":"Jinxia","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7617-5462","authenticated-orcid":false,"given":"Baodong","family":"Qin","sequence":"additional","affiliation":[{"name":"Shaanxi Key Laboratory of Information Communication Network and Security, Xi\u2019an University of Posts & Telecommunications, Xi\u2019an 710121, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,9,16]]},"reference":[{"key":"ref_1","first-page":"1879","article-title":"Survey on Oblivious Transfer Protocols","volume":"34","author":"Gao","year":"2023","journal-title":"Ruan Jian Xue Bao\/J. Softw."},{"key":"ref_2","unstructured":"Rabin, M.O. (2024, September 11). How to exchange secrets with oblivious transfer, Crytology. ePrint Arch., Available online: https:\/\/eprint.iacr.org\/2005\/187."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/s00145-014-9177-x","article-title":"An efficient protocol for secure two-party computation in the presence of malicious adversaries","volume":"28","author":"Lindell","year":"2015","journal-title":"J. Cryptol."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Lindell, Y., and Riva, B. (2015, January 12\u201316). Blazing fast 2PC in the offline\/online setting with security for malicious adversaries. Proceedings of the 22nd ACM Conference on Computer and Communications Security, Denver, CO, USA.","DOI":"10.1145\/2810103.2813666"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","article-title":"Fast cut-and-choose-based protocols for malicious and covert adversaries","volume":"29","author":"Lindell","year":"2016","journal-title":"J. Cryptol."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., and Scholl, P. (2016, January 24\u201328). MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978357"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Mansy, D., and Rindal, P. (2019, January 11\u201315). Endemic oblivious transfer. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3354210"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., and Raykova, M. (2019, January 11\u201315). Distributed vector-OLE: Improved constructions and implementation. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3363228"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Grag, S., Hajiabadi, M., and Ostrovsky, R. (2020, January 16\u201319). Efficient range-trapdoor functions and applications: Rate-1 OT and more. Proceedings of the Theory of Cryptography Conference Cham, Durham, NC, USA.","DOI":"10.1007\/978-3-030-64375-1_4"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., and Wang, X. (2020, January 9\u201313). Ferret: Fast extension for correlated OT with small communication. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA.","DOI":"10.1145\/3372297.3417276"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Chase, M., Grag, S., Hajiabadi, M., Li, J., and Miao, P. (2021, January 8\u201311). Amortizing rate-1 OT and applications to PIR and PSI. Proceedings of the Theory of Cryptography Conference Cham, Raleigh, NC, USA.","DOI":"10.1007\/978-3-030-90456-2_5"},{"key":"ref_12","unstructured":"Naor, M., and Pinkas, B. (2001, January 7\u20139). Efficient oblivious transfer protocols. Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, USA. Available online: https:\/\/api.semanticscholar.org\/CorpusID:9870028."},{"key":"ref_13","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, Toronto, ON, Canada.","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref_14","unstructured":"Kiraz, M.S., and Schoenmakers, B. (2006, January 8\u20139). A protocol issue for the malicious case of Yao\u2019s garbled circuit construction. Proceedings of the 27th Symposium on Information Theory in the Benelux, Noordwijk, The Netherlands. Available online: https:\/\/api.semanticscholar.org\/CorpusID:9024240."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Zhao, C., Jiang, H., Wei, X.C., Xu, Q.L., and Zhao, M.H. (2015, January 20\u201322). Cut-and-choose bilateral oblivious transfer and its application. Proceedings of the 2015 IEEE Trustcom\/BigDataSE\/ISPA, Helsinki, Finland.","DOI":"10.1109\/Trustcom.2015.398"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wei, X., Jiang, H., Zhao, C., Zhao, M., and Xu, Q. (2016, January 23\u201326). Fast cut-and-choose bilateral oblivious transfer for malicious adversaries. Proceedings of the 2016 IEEE Trustcom\/BigDataSE\/ISPA, Tianjin, China.","DOI":"10.1109\/TrustCom.2016.0092"},{"key":"ref_17","first-page":"2022","article-title":"Secure Two-Party Computation Based on Fast Cut-and-Choose Bilateral Oblivious Transfer","volume":"10","author":"Wang","year":"2022","journal-title":"Secur. Commun. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","article-title":"On lattices, learning with errors, random linear codes, and cryptography","volume":"56","author":"Regev","year":"2009","journal-title":"J. ACM"},{"key":"ref_21","unstructured":"Peikert, C., Vaikuntanathan, V., and Waters, B. (2008, January 17\u201321). A framework for efficient and composable oblivious transfer. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Palacio, A., and Segev, G. (2010, January 9\u201311). Public-key cryptographic primitives provably as secure as subset sum. Proceedings of the 7th International Conference on Theory of Cryptography, Zurich, Switzerland.","DOI":"10.1007\/978-3-642-11799-2_23"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., and Kazmi, R.A. (2015, January 24\u201328). Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem. Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, Milan, Italy.","DOI":"10.1007\/978-3-662-48054-0_22"},{"key":"ref_24","unstructured":"Zeng, B., Tartary, C., and Hsu, C. (2024, September 11). A Framework for Fully-Simulatable t-out-of-n Oblivious Transfer, Cryptol. ePrint Arch., Available online: https:\/\/eprint.iacr.org\/2010\/199."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Blazy, O., and Chevalier, C. (2015, January 2\u20135). Generic construction of uc-secure oblivious transfer. Proceedings of the 13th Applied Cryptography and Network Security, New York, NY, USA.","DOI":"10.1007\/978-3-319-28166-7_4"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s11704-018-6507-4","article-title":"Universally composable oblivious transfer from ideal lattice","volume":"13","author":"Liu","year":"2019","journal-title":"Front. Comput. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Quach, W. (2020, January 14\u201316). UC-secure OT from LWE, revisited. Security and Cryptography for Networks. Proceedings of the 12th International Conference, Amalfi, Italy.","DOI":"10.1007\/978-3-030-57990-6_10"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"9974604","DOI":"10.1155\/2021\/9974604","article-title":"Postquantum cut-and-choose oblivious transfer protocol based on LWE","volume":"2021","author":"Ding","year":"2021","journal-title":"Secur. Commun. Netw."},{"key":"ref_29","unstructured":"Liu, M.M. (2018). Analysis and Design of Lattice-Based Oblivious Transfer Protocols. [Ph.D. Thesis, Xidian University]. Available online: https:\/\/kns.cnki.net\/kcms2\/article\/abstract?v=gisQO9UvOsYh8WQQTMP2a-dLrjy20afwQxOIVz5JJqeQm557LfGHxw17MhoSwHgRFCVLqe0bf-k6Y2QAnAgjHN5qwIKX2_izezrK1Q123c1PYCW52YBz-ZxfKLNP4c53wNZYMr310yeyaSEXqGzlIvUaMT6AsohvdVgbW3Io_kabjCrNEBn99_L-YwvLQafk-9vk19xwpmo=&uniplatform=NZKPT&language=CHS."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"13567","DOI":"10.1109\/TVT.2020.3031063","article-title":"Efficient and secure location-based services scheme in VANET","volume":"69","author":"Yadav","year":"2020","journal-title":"IEEE Trans. Vehic. Technol."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., and Vaikuntanathan, V. (2012, January 8\u201310). Fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Cambridge, MA, USA.","DOI":"10.1145\/2090236.2090262"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","article-title":"Worst-case to average-casereductions for modulelattices","volume":"75","author":"Langlois","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Schwabe, P., Seiler, G., and Stehle, D. (2018, January 24\u201326). Crystals-kyber: A cca-secure module-lattice-based kem. Proceedings of the 2018 IEEE European Symposium on Security and Privacy (EuroS P), London, UK.","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"ref_34","first-page":"144","article-title":"Low Expansion Rate Encryption Algorithm Based on MLWE","volume":"46","author":"Ke","year":"2019","journal-title":"Comput. Sci."},{"key":"ref_35","first-page":"20","article-title":"An overview on lattice-based public key encryption and key encapsulation mechanism in candidate schemes for post quantum cryptography standard of NIST","volume":"10","author":"Xiang","year":"2023","journal-title":"J. Cryptologic Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"e7923","DOI":"10.1002\/cpe.7923","article-title":"Post-quantum secure two-party computing protocols against malicious adversaries","volume":"36","author":"Huo","year":"2024","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., and Wichs, D. (2012, January 15\u201319). Multiparty computation with low communication, computation and interaction via threshold FHE. Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","article-title":"Worst-case to average-case reductions based on Gaussian measures","volume":"37","author":"Micciancio","year":"2007","journal-title":"SIAM J. Comput."},{"key":"ref_39","first-page":"300","article-title":"Limits on the hardness of lattice problems in \u2113p norms","volume":"17","author":"Peikert","year":"2008","journal-title":"SIAM J. Comput."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17\u201320). Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Blazy, O., L\u2019eo, D., and Quach, W. (2018, January 25\u201329). Hash proof systems over lattices revisited. Proceedings of the 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil.","DOI":"10.1007\/978-3-319-76581-5_22"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/9\/793\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:57:24Z","timestamp":1760111844000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/9\/793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,16]]},"references-count":41,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["e26090793"],"URL":"https:\/\/doi.org\/10.3390\/e26090793","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2024,9,16]]}}}