{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:07:19Z","timestamp":1753884439646,"version":"3.41.2"},"reference-count":29,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T00:00:00Z","timestamp":1535846400000},"content-version":"vor","delay-in-days":244,"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":["61802214","11701187"],"award-info":[{"award-number":["61802214","11701187"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2017A030310522"],"award-info":[{"award-number":["2017A030310522"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p><jats:italic>Authentication<\/jats:italic>is the first defence line to prevent malicious entities to access<jats:italic>smart mobile devices<\/jats:italic>(or SMD). Essentially, there exist many available cryptographic primitives to design authentication protocols.<jats:italic>Oblivious transfer<\/jats:italic>() protocol is one of the important cryptographic primitives to design authentication protocols. The first lattice\u2010based framework under universal composability (UC) model was designed by dual mode encryption and promoted us to find an alternative efficient scheme. We note that \u201clossy encryption\u201d scheme is an extension of the dual mode encryption and can be used to design UC\u2010secure protocol, but the investigations of via lossy encryption over the lattice are absent. Hence, in order to obtain an efficient authentication protocol by improving the performance of the UC\u2010secure protocol, in this paper, we first design a multibit lossy encryption under the decisional learning with errors () assumption and then design a new variant of UC\u2010secure protocol for authenticated protocol via lossy encryption scheme. Additionally, our protocol is secure against semihonest (static) adversaries in the common reference string (CRS) model and within the UC framework.<\/jats:p>","DOI":"10.1155\/2018\/5973285","type":"journal-article","created":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T23:34:09Z","timestamp":1535931249000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Oblivious Transfer via Lossy Encryption from Lattice\u2010Based Cryptography"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0758-7230","authenticated-orcid":false,"given":"Zengpeng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6706-7512","authenticated-orcid":false,"given":"Can","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"e_1_2_11_1_2","first-page":"449","article-title":"Efficient password authenticated key exchange via oblivious transfer","volume":"7293","author":"Canetti R.","year":"2012","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.03.070"},{"key":"e_1_2_11_3_2","first-page":"83","article-title":"Universally Composable RFID Mutual Authentication","volume":"14","author":"Su C.","year":"2017","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2829880"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2017.04.017"},{"key":"e_1_2_11_6_2","doi-asserted-by":"crossref","unstructured":"ZhangL. ZhangZ. andHuX. UC-secure two-server password-based authentication protocol and its applications Proceedings of the 11th ACM Asia Conference on Computer and Communications Security ASIA CCS 2016 June 2016 153\u2013164 2-s2.0-84979663146.","DOI":"10.1145\/2897845.2897872"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/0209024"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2464781"},{"key":"e_1_2_11_9_2","doi-asserted-by":"crossref","unstructured":"GertnerY. KannanS. MalkinT. ReingoldO. andViswanathan. M. The relationship between public key encryption and oblivious transfer Proceedings of the FOCS 2000 IEEE Computer Society Press 325\u2013335.","DOI":"10.1109\/SFCS.2000.892121"},{"key":"e_1_2_11_10_2","unstructured":"PeikertC. VaikuntanathanV. andWatersB. A framework for efficient and composable oblivious transfer Cryptology ePrint Archive no. 2007\/348 https:\/\/eprint.iacr.org\/2007\/348."},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_18"},{"key":"e_1_2_11_13_2","doi-asserted-by":"crossref","unstructured":"ShorP. W. Algorithms for quantum computation: discrete logarithms and factoring Proceedings of the 35th Annual Symposium on Foundations of Computer Science (SFCS \u203294) 1994 IEEE Computer Society Press 124\u2013134 https:\/\/doi.org\/10.1109\/SFCS.1994.365700.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_2_11_14_2","doi-asserted-by":"crossref","unstructured":"RegevO. On lattices learning with errors random linear codes and cryptography Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC \u203205) May 2005 Baltimore Md USA ACM Press 84\u201393 https:\/\/doi.org\/10.1145\/1060590.1060603.","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_2_11_15_2","doi-asserted-by":"crossref","unstructured":"GentryC. PeikertC. andVaikuntanathanV. Trapdoors for hard lattices and new cryptographic constructions Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC \u203208) May 2008 Victoria Canada 197\u2013206 https:\/\/doi.org\/10.1145\/1374376.1374407.","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_23"},{"key":"e_1_2_11_17_2","doi-asserted-by":"crossref","unstructured":"DavidB. DowsleyR. andNascimentoA. Universally composable oblivious transfer based on a variant of LPN Proceedings of the CANS 2014 Springer 143\u2013158.","DOI":"10.1007\/978-3-319-12280-9_10"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-017-9206-y"},{"key":"e_1_2_11_19_2","unstructured":"LiZ. GalbraithS. D. andMaC. Preventing Adaptive Key Recovery Attacks on the Gentry-Sahai-Waters Leveled Homomorphic Encryption Scheme Cryptology ePrint Archive no. 2016\/1146 https:\/\/eprint.iacr.org\/2016\/1146."},{"key":"e_1_2_11_20_2","doi-asserted-by":"crossref","unstructured":"BrakerskiZ.andVaikuntanathanV. Efficient fully homomorphic encryption from (standard) LWE Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS \u203211) October 2011 Palm Springs CA USA 97\u2013106 https:\/\/doi.org\/10.1109\/FOCS.2011.12 2-s2.0-80955132201.","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_2_11_21_2","first-page":"80","article-title":"Universally composable oblivious transfer from lossy encryption and the McEliece assumptions","volume":"7412","author":"David B. M.","year":"2012","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2726554"},{"key":"e_1_2_11_23_2","doi-asserted-by":"crossref","unstructured":"CanettiR. Universally composable security: A new paradigm for cryptographic protocols Proceedings of the FOCS 2001 IEEE Computer Society Press 136\u2013145 MR1948702.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_2_11_24_2","unstructured":"LindnerR.andPeikertC. Better key sizes (and attacks) for LWE-based encryption Cryptology ePrint Archive no. 2010\/613 https:\/\/eprint.iacr.org\/2010\/613."},{"key":"e_1_2_11_25_2","doi-asserted-by":"crossref","unstructured":"PeikertC. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract Proceedings of the STOC 2009 ACM Press 333\u2013342.","DOI":"10.1145\/1536414.1536461"},{"key":"e_1_2_11_26_2","doi-asserted-by":"crossref","unstructured":"PeikertC.andWatersB. Lossy trapdoor functions and their applications Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC \u203208) 2008 ACM Press 187\u2013196 https:\/\/doi.org\/10.1145\/1374376.1374406.","DOI":"10.1145\/1374376.1374406"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.73"},{"key":"e_1_2_11_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-0161-2"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/5973285.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/5973285.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/5973285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T19:49:28Z","timestamp":1751831368000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/5973285"}},"subtitle":[],"editor":[{"given":"Jian","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/5973285"],"URL":"https:\/\/doi.org\/10.1155\/2018\/5973285","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-04-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5973285"}}