{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:51:53Z","timestamp":1762005113431,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Fundamental Research Funds for the Central Universities, China","award":["30918012204"],"award-info":[{"award-number":["30918012204"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2908202","type":"journal-article","created":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T18:50:05Z","timestamp":1553885405000},"page":"43179-43189","source":"Crossref","is-referenced-by-count":4,"title":["Lattice-Based Searchable Encryption With Keywords Revocable and Bounded Trapdoor Exposure Resistance"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4860-7517","authenticated-orcid":false,"given":"Xiaoling","family":"Yu","sequence":"first","affiliation":[]},{"given":"Chungen","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9178-6640","authenticated-orcid":false,"given":"Lei","family":"Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","first-page":"609","article-title":"Coding constructions for blacklisting problems without computational assumptions","author":"kumar","year":"1999","journal-title":"Advances in Cryptology"},{"key":"ref33","first-page":"1","article-title":"Generating hard instances of the short basis problem","author":"ajtai","year":"1999","journal-title":"Proc Int Colloq Automata Lang Program"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488680"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2327758"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455823"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref36","first-page":"700","article-title":"Trapdoors for lattices: Simpler, tighter, faster, smaller","author":"micciancio","year":"2012","journal-title":"Advances in Cryptology"},{"key":"ref35","first-page":"553","article-title":"Efficient lattice (H)IBE in the standard model","author":"agrawal","year":"2010","journal-title":"Advances in Cryptology"},{"key":"ref34","first-page":"75","article-title":"Generating shorter bases for hard random lattices","author":"alwen","year":"2009","journal-title":"Proc 26th Symp on Theoretical Aspects of Computer Science"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-319-11659-4_12","article-title":"Lattice cryptography for the Internet","author":"peikert","year":"2014","journal-title":"Post-Quantum Cryptography"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3079078"},{"key":"ref12","first-page":"719","article-title":"Authenticated key exchange from ideal lattices","author":"zhang","year":"2015","journal-title":"Advances in Cryptology"},{"article-title":"A fully homomorphic encryption scheme","year":"2009","author":"gentry","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/sec.790"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-016-0584-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3608"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2861424"},{"key":"ref19","first-page":"282","article-title":"Public key encryption with searchable keywords based on Jacobi symbols","author":"crescenzo","year":"2007","journal-title":"Progress in Cryptology"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom.2015.371"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"ref27","first-page":"1249","article-title":"Public key encryption with keyword search revisited","author":"baek","year":"2008","journal-title":"Proc Int Conf Comput Sci Appl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"ref6","first-page":"303","article-title":"Programmable hash functions from lattices: Short signatures and ibes with small key sizes","author":"zhang","year":"2016","journal-title":"Advances in Cryptology"},{"key":"ref29","first-page":"205","article-title":"Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions","author":"abdalla","year":"2005","journal-title":"Advances in Cryptology"},{"key":"ref5","first-page":"738","article-title":"Lattice signatures without trapdoors","author":"lyubashevsky","year":"2012","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref8","first-page":"184","article-title":"Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance","author":"takayasu","year":"2017","journal-title":"Proc Australasian Conf Inf Security Privacy"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"journal-title":"Computer Security Division Information Technology Laboratory N I O S Technology U D O C Post-Quantum Cryptography CSRC","year":"2017","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31448-3_29"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93638-3_20"},{"key":"ref22","first-page":"409","article-title":"Multi-authority distributed attributebased encryption with application to searchable encryption on lattices","author":"kuchta","year":"2016","journal-title":"Paradigms in Cryptology-Mycrypt Malicious and Exploratory Cryptology"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-018-5357-6"},{"key":"ref24","article-title":"Lattice-based public key searchable encryption from experimental perspectives","author":"behnia","year":"0","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPSA.2014.059867"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1103"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.03.008"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08676214.pdf?arnumber=8676214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T09:47:08Z","timestamp":1643276828000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8676214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2908202","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}