{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:55:07Z","timestamp":1762332907771,"version":"build-2065373602"},"reference-count":20,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T00:00:00Z","timestamp":1707955200000},"content-version":"vor","delay-in-days":45,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902303","61972457","62172266","62002288","U19B2021"],"award-info":[{"award-number":["61902303","61972457","62172266","62002288","U19B2021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2024JC-YBMS-475","2021JM-514"],"award-info":[{"award-number":["2024JC-YBMS-475","2021JM-514"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Projects of Shaanxi Province","doi-asserted-by":"publisher","award":["2020ZDLGY08-04"],"award-info":[{"award-number":["2020ZDLGY08-04"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009103","name":"Education Department of Shaanxi Province","doi-asserted-by":"publisher","award":["23JP058"],"award-info":[{"award-number":["23JP058"]}],"id":[{"id":"10.13039\/501100009103","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["GK202103093"],"award-info":[{"award-number":["GK202103093"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013057","name":"Innovation Scientists and Technicians Troop Construction Projects of Henan Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013057","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>Universal composability (UC) is a primary security flavor for designing oblivious transfer (OT) due to its advantage of arbitrary composition. However, the study of UC\u2010secure OT over lattices is still far behind compared with constructions over prequantum assumptions. Relying on the learning with errors (LWE) assumption, Quach proposes a dual\u2010mode encryption scheme (SCN\u201920) for deriving a two\u2010round OT whose security is provably UC\u2010secure in the common reference string (CRS) model. Due to its use of a randomized rounding function proposed by Benhamouda et al. (PKC\u201918), this OT can only be limited to transmitting single\u2010bit messages. Therefore, conducting trivial repetitions of Quach\u2019s OT when transmitting multibit strings would be very costly. In this work, we put forward a modified dual\u2010mode encryption cryptosystem under the decisional LWE assumption, from which we can derive a UC\u2010secure string OT with both full\u2010fledged dual\u2010mode security and better efficiency on transmitting strings. The key technique we adopt is a key reconciliation scheme proposed by Jiang et al. (PKC\u201920), which is utilized to extend the single\u2010bit symmetric encryption key (produced by the aforementioned rounding function) to a multibit case. Through a comprehensive performance analysis, we demonstrate that our proposal can indeed strike a balance between security and efficiency.<\/jats:p>","DOI":"10.1049\/2024\/5513292","type":"journal-article","created":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T18:57:01Z","timestamp":1708023421000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dual\u2010Mode Encryption for UC\u2010Secure String OT from Learning with Errors"],"prefix":"10.1049","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8545-5551","authenticated-orcid":false,"given":"Momeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1977-0959","authenticated-orcid":false,"given":"Yupu","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5265-1225","authenticated-orcid":false,"given":"Qiqi","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2964-1082","authenticated-orcid":false,"given":"Shanshan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9289-5918","authenticated-orcid":false,"given":"Huiwen","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9923-068X","authenticated-orcid":false,"given":"Wen","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2554-4464","authenticated-orcid":false,"given":"Baocang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"e_1_2_8_1_2","unstructured":"RabinM. O. How to exchange secrets with oblivious transfer Technical Report TR-81 Aiken Computation Lab1981 Harvard University."},{"key":"e_1_2_8_2_2","doi-asserted-by":"crossref","unstructured":"YaoA. C.-C. How to generate and exchange secrets 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) October 1986 Toronto ON Canada IEEE 162\u2013167 https:\/\/doi.org\/10.1109\/SFCS.1986.25.","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_2_8_3_2","doi-asserted-by":"crossref","unstructured":"GoldreichO. MicaliS. andWigdersonA. How to play any mental game STOC \u203287: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing January 1987 New York NY USA Association for Computing Machinery 218\u2013229 https:\/\/doi.org\/10.1145\/28395.28420.","DOI":"10.1145\/28395.28420"},{"key":"e_1_2_8_4_2","doi-asserted-by":"crossref","unstructured":"CanettiR. Universally composable security: a new paradigm for cryptographic protocols Proceedings 42nd IEEE Symposium on Foundations of Computer Science October 2001 Newport Beach CA USA IEEE 136\u2013145 https:\/\/doi.org\/10.1109\/SFCS.2001.959888.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_2_8_5_2","doi-asserted-by":"crossref","unstructured":"PeikertC. VaikuntanathanV. andWatersB. A framework for efficient and composable oblivious transfer Proceedings of the Annual International Cryptology Conference-CRYPTO 2008 August 2008 Santa Barbara USA Springer Berlin Heidelberg 554\u2013571.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"e_1_2_8_6_2","doi-asserted-by":"crossref","unstructured":"QuachW. UC-secure OT from LWE revisited Proceedings of International Conference on Security and Cryptography for Networks-SCN 2020 September 2020 Amalfi Italy Springer Cham 192\u2013211.","DOI":"10.1007\/978-3-030-57990-6_10"},{"key":"e_1_2_8_7_2","doi-asserted-by":"crossref","unstructured":"BenhamoudaF. BlazyO. DucasL. andQuachW. Hash proof systems over lattices revisited Proceedings of the IACR International Conference on Public-Key Cryptography-PKC 2018 Rio de Janeiro March 2018 Brazil Springer Cham 644\u2013674.","DOI":"10.1007\/978-3-319-76581-5_22"},{"key":"e_1_2_8_8_2","doi-asserted-by":"crossref","unstructured":"KalaiY. T. Smooth projective hashing and two-message oblivious transfer Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques-EUROCRYPT 2005 May 2005 Aarhus Denmark Springer Berlin Heidelberg 78\u201395 https:\/\/doi.org\/10.1007\/11426639_5.","DOI":"10.1007\/11426639_5"},{"key":"e_1_2_8_9_2","doi-asserted-by":"crossref","unstructured":"JiangS. GongG. HeJ. NguyenK. andWangH. PAKEs: new framework new techniques and more efficient lattice-based constructions in the standard model Proceedings of the IACR International Conference on Public-Key Cryptography-PKC 2020 May 2020 Edinburgh UK Springer Cham 396\u2013427 https:\/\/doi.org\/10.1007\/978-3-030-45374-9_14.","DOI":"10.1007\/978-3-030-45374-9_14"},{"key":"e_1_2_8_10_2","doi-asserted-by":"crossref","unstructured":"KatzJ.andVaikuntanathanV. Smooth projective hashing and password-based authenticated key exchange from lattices Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security-ASIACRYPT 2009 December 2009 Tokyo Japan Springer Berlin Heidelberg 636\u2013652 https:\/\/doi.org\/10.1007\/978-3-642-10366-7_37 2-s2.0-72449123735.","DOI":"10.1007\/978-3-642-10366-7_37"},{"key":"e_1_2_8_11_2","doi-asserted-by":"crossref","unstructured":"BrakerskiZ.andD\u00f6ttlingN. Two-message statistically sender-private OT from LWE Proceedings of the Theory of Cryptography Conference-TCC 2018 November 2018 Panaji India Springer Cham 370\u2013390 https:\/\/doi.org\/10.1007\/978-3-030-03810-6_14.","DOI":"10.1007\/978-3-030-03810-6_14"},{"key":"e_1_2_8_12_2","doi-asserted-by":"crossref","unstructured":"D\u00f6ttlingN. GargS. HajiabadiM. MasnyD. andWichsD. Two-round oblivious transfer from CDH or LPN Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques-EUROCRYPT 2020 May 2020 Zagreb Croatia Springer Cham 768\u2013797 https:\/\/doi.org\/10.1007\/978-3-030-45724-2_26.","DOI":"10.1007\/978-3-030-45724-2_26"},{"key":"e_1_2_8_13_2","doi-asserted-by":"crossref","unstructured":"CanettiR. ChenY. HolmgrenJ. LombardiA. RothblumG. N. RothblumR. D. andWichsD. Fiat-Shamir: from practice to theory STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing June 2019 Phoenix AZ USA Association for Computing Machinery 1082\u20131090 https:\/\/doi.org\/10.1145\/3313276.3316380 2-s2.0-85065129547.","DOI":"10.1145\/3313276.3316380"},{"key":"e_1_2_8_14_2","doi-asserted-by":"crossref","unstructured":"PeikertC.andShiehianS. Noninteractive zero knowledge for NP from (plain) learning with errors Proceedings of the Annual International Cryptology Conference-CRYPTO 2019 August 2019 Santa Barbara USA Springer Cham 89\u2013114 https:\/\/doi.org\/10.1007\/978-3-030-26948-7_4 2-s2.0-85071671192.","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"e_1_2_8_15_2","doi-asserted-by":"crossref","unstructured":"MicciancioD.andRegevO. Worst-case to average-case reductions based on Gaussian measures 45th Annual IEEE Symposium on Foundations of Computer Science October 2004 Rome Italy IEEE 372\u2013381 https:\/\/doi.org\/10.1109\/FOCS.2004.72.","DOI":"10.1109\/FOCS.2004.72"},{"key":"e_1_2_8_16_2","doi-asserted-by":"crossref","unstructured":"GentryC. PeikertC. andVaikuntanathanV. Trapdoors for hard lattices and new cryptographic constructions STOC \u201908: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing May 2008 Victoria BC Canada Association for Computing Machinery 197\u2013206 https:\/\/doi.org\/10.1145\/1374376.1374407.","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0251-3"},{"key":"e_1_2_8_18_2","doi-asserted-by":"crossref","unstructured":"RegevO. On lattices learning with errors random linear codes and cryptography STOC \u201905: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing May 2005 Baltimore MD USA Association for Computing Machinery 84\u201393 https:\/\/doi.org\/10.1145\/1060590.1060603 2-s2.0-33745571012.","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_2_8_19_2","doi-asserted-by":"crossref","unstructured":"MicciancioD.andPeikertC. Trapdoors for lattices: simpler tighter faster smaller Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques-EUROCRYPT 2012 April 2012 UK Springer Berlin Heidelberg 700\u2013718 https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41 2-s2.0-84859976564.","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"e_1_2_8_20_2","doi-asserted-by":"crossref","unstructured":"AsharovG. JainA. L\u00f3opez-AltA. TromerE. VaikuntanathanV. andWichsD. Multiparty computation with low communication computation and interaction via threshold FHE Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques-EUROCRYPT 2012 April 2012 Cambridge UK Springer Berlin Heidelberg 83\u2013501 https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29 2-s2.0-84859950107.","DOI":"10.1007\/978-3-642-29011-4_29"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2024\/5513292.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2024\/5513292.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/2024\/5513292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:50:45Z","timestamp":1762332645000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/2024\/5513292"}},"subtitle":[],"editor":[{"given":"Naghmeh","family":"Moradpoor","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1049\/2024\/5513292"],"URL":"https:\/\/doi.org\/10.1049\/2024\/5513292","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"type":"print","value":"1751-8709"},{"type":"electronic","value":"1751-8717"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"2023-06-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5513292"}}