{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:28Z","timestamp":1772240668498,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61632012"],"award-info":[{"award-number":["61632012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Peng Cheng Laboratory Project of Guangdong Province","award":["PCL2018KP004"],"award-info":[{"award-number":["PCL2018KP004"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Public key encryption scheme with keyword search is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it\u2019s critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user\u2019s secret keys are exposed. In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors problem on the standard model.<\/jats:p>","DOI":"10.1186\/s13638-021-02006-1","type":"journal-article","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T08:04:39Z","timestamp":1630915479000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Designated server-aided revocable identity-based keyword search on lattice"],"prefix":"10.1186","volume":"2021","author":[{"given":"Ying","family":"Guo","sequence":"first","affiliation":[]},{"given":"Fei","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Leixiao","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"2006_CR1","first-page":"506","volume":"2004","author":"D Boneh","year":"2004","unstructured":"D. Boneh, G.D. Crescenzo, R. Ostrovsky, G. Persiano, Public key encryption with keyword search. EUROCRYPT 2004, 506\u2013522 (2004)","journal-title":"EUROCRYPT"},{"key":"2006_CR2","first-page":"73","volume":"2004","author":"DJ Park","year":"2004","unstructured":"D.J. Park, K. Kim, P.J. Lee, Public key encryption with conjunctive field keyword search. WISA 2004, 73\u201386 (2004)","journal-title":"WISA"},{"key":"2006_CR3","first-page":"535","volume":"2007","author":"D Boneh","year":"2007","unstructured":"D. Boneh, B. Waters, Conjunctive, subset, and range queries on encrypted data. TCC 2007, 535\u2013554 (2007)","journal-title":"TCC"},{"key":"2006_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ins.2019.01.004","volume":"481","author":"H Li","year":"2019","unstructured":"H. Li, Q. Huang, J. Shen, G. Yang, W. Susilo, Designated-server identity-based authenticated encryption with keyword search for encrypted emails. Inf. Sci. 481, 330\u2013343 (2019)","journal-title":"Inf. Sci."},{"key":"2006_CR5","first-page":"522","volume":"2014","author":"Q Zheng","year":"2014","unstructured":"Q. Zheng, S. Xu, G. Ateniese, VABKS: verifiable attribute-based keyword search over outsourced encrypted data. INFOCOM 2014, 522\u2013530 (2014)","journal-title":"INFOCOM"},{"issue":"4","key":"2006_CR6","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1109\/TPDS.2014.2355202","volume":"27","author":"W Sun","year":"2016","unstructured":"W. Sun, S. Yu, W. Lou, Y.T. Hou, H. Li, Protecting your right: Verifiable attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. IEEE Trans. Parallel Distrib. Syst. 27(4), 1187\u20131198 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2006_CR7","doi-asserted-by":"publisher","unstructured":"F. Meng, L. Cheng, M. Wang, ABDKS: attribute-based encryption with dynamic keyword search in fog computing. Front. Comput. Sci. 15, 155810 (2021). https:\/\/doi.org\/10.1007\/s11704-020-9472-7","DOI":"10.1007\/s11704-020-9472-7"},{"key":"2006_CR8","doi-asserted-by":"publisher","unstructured":"C. Hou, F. Liu, H. Bai and L. Ren, \"Public-Key Encryption with Keyword Search from Lattice,\" 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 2013, pp. 336\u2013339. https:\/\/doi.org\/10.1109\/3PGCIC.2013.57","DOI":"10.1109\/3PGCIC.2013.57"},{"key":"2006_CR9","first-page":"1","volume":"PP","author":"B Rouzbeh","year":"2018","unstructured":"B. Rouzbeh, O.M. Ozgur, Y.A. Altay, Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans. Dependable Secure Comput. PP, 1 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"4","key":"2006_CR10","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/CC.2018.8357694","volume":"15","author":"X Zhang","year":"2018","unstructured":"X. Zhang, C. Xu, L. Mu, J. Zhao, Identity-based encryption with keyword search from lattice assumption. China Commun. 15(4), 164\u2013178 (2018)","journal-title":"China Commun."},{"issue":"11","key":"2006_CR11","doi-asserted-by":"crossref","first-page":"e3531","DOI":"10.1002\/ett.3531","volume":"30","author":"Y Mao","year":"2019","unstructured":"Y. Mao, X. Fu, C. Guo, G. Wu, Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices. Trans. Emerg. Telecommun. Technol. 30(11), e3531 (2019)","journal-title":"Trans. Emerg. Telecommun. Technol."},{"key":"2006_CR12","first-page":"102433","volume":"51","author":"P Wang","year":"2020","unstructured":"P. Wang, T. Xiang, X. Li, H. Xiang, Public key encryption with conjunctive keyword search on lattice. J. Inf. Secur. Appl. 51, 102433 (2020)","journal-title":"J. Inf. Secur. Appl."},{"key":"2006_CR13","doi-asserted-by":"crossref","unstructured":"J. Li, M. Ma, J. Zhang, S. Fan, S. Li, Attribute-based keyword search from lattices, in Scrypt (2019), (2019) pp. 66\u201385","DOI":"10.1007\/978-3-030-42921-8_4"},{"key":"2006_CR14","doi-asserted-by":"publisher","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the weil pairing, in Advances in Cryptology\u2014CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19\u201323, 2001, Proceedings, (2001), pp. 213\u2013229. https:\/\/doi.org\/10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"2006_CR15","doi-asserted-by":"publisher","unstructured":"A. Boldyreva, V. Goyal, V. Kumar, Identity-based encryption with efficient revocation, in Proceedings of the 2008 ACM Conference on Computer and Communications Security, CCS 2008, Alexandria, Virginia, USA, October 27-31, 2008, (2008), pp. 417\u2013426. https:\/\/doi.org\/10.1145\/1455770.1455823","DOI":"10.1145\/1455770.1455823"},{"key":"2006_CR16","first-page":"59","volume":"2001","author":"D Naor","year":"2001","unstructured":"D. Naor, M. Naor, J.B. Lotspiech, Revocation and tracing schemes for stateless receivers. IACR Cryptol. ePrint Arch. 2001, 59 (2001)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2006_CR17","doi-asserted-by":"publisher","unstructured":"B. Qin, R.H. Deng, Y. Li, S. Liu, Server-aided revocable identity-based encryption, in Computer Security\u2014ESORICS 2015\u201420th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I, (2015), pp. 286\u2013304. https:\/\/doi.org\/10.1007\/978-3-319-24174-6_15","DOI":"10.1007\/978-3-319-24174-6_15"},{"key":"2006_CR18","doi-asserted-by":"publisher","unstructured":"J. Chen, H.W. Lim, S. Ling, H. Wang, K. Nguyen, Revocable identity-based encryption from lattices, in Information Security and Privacy\u201417th Australasian Conference, ACISP 2012, Wollongong, NSW, Australia, July 9\u201311, 2012. Proceedings, (2012), pp. 390\u2013403. https:\/\/doi.org\/10.1007\/978-3-642-31448-3_29","DOI":"10.1007\/978-3-642-31448-3_29"},{"key":"2006_CR19","doi-asserted-by":"publisher","unstructured":"K. Nguyen, H. Wang, J. Zhang, Server-aided revocable identity-based encryption from lattices, in Cryptology and Network Security\u201415th International Conference, CANS 2016, Milan, Italy, November 14\u201316, 2016, Proceedings, (2016), pp. 107\u2013123. https:\/\/doi.org\/10.1007\/978-3-319-48965-0_7","DOI":"10.1007\/978-3-319-48965-0_7"},{"key":"2006_CR20","first-page":"52","volume":"2012","author":"A Boldyreva","year":"2012","unstructured":"A. Boldyreva, V. Goyal, V. Kumar, Identity-based encryption with efficient revocation. IACR Cryptol. ePrint Arch. 2012, 52 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2006_CR21","doi-asserted-by":"publisher","unstructured":"J.M.G. Nieto, M. Manulis, D. Sun, Fully private revocable predicate encryption, in Information Security and Privacy\u201417th Australasian Conference, ACISP 2012, Wollongong, NSW, Australia, July 9\u201311, 2012. Proceedings, (2012), pp. 350\u2013363. https:\/\/doi.org\/10.1007\/978-3-642-31448-3_26","DOI":"10.1007\/978-3-642-31448-3_26"},{"key":"2006_CR22","doi-asserted-by":"publisher","unstructured":"S. Katsumata, T. Matsuda, A. Takayasu, Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance, in Public-Key Cryptography\u2014PKC 2019\u201422nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14\u201317, 2019, Proceedings, Part II, (2019), pp. 441\u2013471. https:\/\/doi.org\/10.1007\/978-3-030-17259-6_15","DOI":"10.1007\/978-3-030-17259-6_15"},{"key":"2006_CR23","doi-asserted-by":"publisher","unstructured":"C. Gentry, C. Peikert, V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17\u201320, 2008, (2008), pp. 197\u2013206. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"issue":"3","key":"2006_CR24","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00224-010-9278-3","volume":"48","author":"J Alwen","year":"2011","unstructured":"J. Alwen, C. Peikert, Generating shorter bases for hard random lattices. Theory Comput. Syst. 48(3), 535\u2013553 (2011). https:\/\/doi.org\/10.1007\/s00224-010-9278-3","journal-title":"Theory Comput. Syst."},{"key":"2006_CR25","doi-asserted-by":"publisher","unstructured":"D. Micciancio, C. Peikert, Trapdoors for lattices: simpler, tighter, faster, smaller, in Advances in Cryptology\u2014EUROCRYPT 2012\u201431st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15\u201319, 2012. Proceedings, (2012), pp. 700\u2013718. https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"2006_CR26","doi-asserted-by":"publisher","unstructured":"S. Agrawal, D. Boneh, X. Boyen, Efficient lattice (H)IBE in the standard model, in Advances in Cryptology\u2014EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco\/French Riviera, May 30\u2013June 3, 2010. Proceedings, (2010), pp. 553\u2013572. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28","DOI":"10.1007\/978-3-642-13190-5_28"},{"issue":"4","key":"2006_CR27","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"D. Cash, D. Hofheinz, E. Kiltz, C. Peikert, Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25(4), 601\u2013639 (2012). https:\/\/doi.org\/10.1007\/s00145-011-9105-2","journal-title":"J. Cryptol."},{"key":"2006_CR28","doi-asserted-by":"publisher","unstructured":"O. Regev, On lattices, learning with errors, random linear codes, and cryptography, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22\u201324, 2005, (2005). pp. 84\u201393. https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"2006_CR29","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.aim.2004.08.004","volume":"195","author":"AE Litvak","year":"2005","unstructured":"A.E. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes. Adv. Math. 195(2), 491\u2013523 (2005)","journal-title":"Adv. Math."},{"issue":"1","key":"2006_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Y. Dodis, R. Ostrovsky, L. Reyzin, A.D. Smith, Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008). https:\/\/doi.org\/10.1137\/060651380","journal-title":"SIAM J. Comput."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-021-02006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-021-02006-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-021-02006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T10:22:22Z","timestamp":1699438942000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-021-02006-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,6]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["2006"],"URL":"https:\/\/doi.org\/10.1186\/s13638-021-02006-1","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,6]]},"assertion":[{"value":"28 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that no competing interests exist in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"174"}}