{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:06:37Z","timestamp":1771700797539,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,29]],"date-time":"2018-01-29T00:00:00Z","timestamp":1517184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370203"],"award-info":[{"award-number":["61370203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Scholars Development Fund of SWPU","award":["201599010139"],"award-info":[{"award-number":["201599010139"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11277-018-5357-6","type":"journal-article","created":{"date-parts":[[2018,1,29]],"date-time":"2018-01-29T09:28:01Z","timestamp":1517218081000},"page":"907-921","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Trapdoor Security Lattice-Based Public-Key Searchable Encryption with a Designated Cloud Server"],"prefix":"10.1007","volume":"100","author":[{"given":"Xiaojun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,29]]},"reference":[{"key":"5357_CR1","doi-asserted-by":"crossref","unstructured":"Boneh, D., Crescenzo, G. D., Ostrovsky, R., & Persiano, G. (2004). Public key encryption with keyword search. In Proceedings of advances in cryptology\u2014Eurocrypt\u201904,LNCS 3027 (pp. 506\u2013522).","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"5357_CR2","unstructured":"Baek, J., Safavi-Naini, R., & Susilo, W. (2006). Public key encryption with keyword search revisited. In Proceedings of ACIS\u201906, LNCS 5072 (pp. 1249\u20131259)."},{"issue":"5","key":"5357_CR3","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.jss.2009.11.726","volume":"83","author":"HS Rhee","year":"2010","unstructured":"Rhee, H. S., Park, J. H., Susilo, W., & Lee, D. H. (2010). Trapdoor security in a searchable public-key encryption scheme with a designated tester. Journal of Systems and Software, 83(5), 763\u2013771.","journal-title":"Journal of Systems and Software"},{"key":"5357_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ins.2012.03.020","volume":"205","author":"HS Rhee","year":"2012","unstructured":"Rhee, H. S., Park, J. H., & Lee, D. H. (2012). Generic construction of designated tester public-key encryption with keyword search. Information Sciences, 205, 93\u2013109.","journal-title":"Information Sciences"},{"issue":"1\/2","key":"5357_CR5","first-page":"72","volume":"3","author":"Y Zhao","year":"2012","unstructured":"Zhao, Y., Chen, X., Ma, H., Tang, Q., & Zhu, H. (2012). A new trapdoor-indistinguishable public key encryption with keyword search. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, 3(1\/2), 72\u201381.","journal-title":"Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications"},{"issue":"7-8","key":"5357_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s12243-013-0398-z","volume":"69","author":"TY Wu","year":"2014","unstructured":"Wu, T. Y., Tsai, T. T., & Tseng, Y. M. (2014). Efficient searchable identity-based encryption with a designated server. Annales des T\u00e9l\u00e9communications, 69(7-8), 391\u2013402.","journal-title":"Annales des T\u00e9l\u00e9communications"},{"issue":"5","key":"5357_CR7","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484\u20131509.","journal-title":"SIAM Journal on Computing"},{"key":"5357_CR8","doi-asserted-by":"crossref","unstructured":"Ajtai, M. (1999). Generating hard instances of the short basis problem. In Proceedings of automata, languages and Programming ICALP 1999, LNCS 1644 (pp. 1\u20139). Prague: Springer.","DOI":"10.1007\/3-540-48523-6_1"},{"key":"5357_CR9","doi-asserted-by":"crossref","unstructured":"Regev, O. (2005). On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of STOC\u201905, Baltimore, MD, USA (pp. 84\u201393).","DOI":"10.1145\/1060590.1060603"},{"key":"5357_CR10","unstructured":"Gordon, S. D., Katz, J., & Vaikuntanathan, V. (2010). A group signature from lattice assumptions. In Proceedings of advances in cryptology\u2014ASIACRYPT\u201910, LNCS 6477 (pp. 395\u2013412). Singapore: Springer."},{"key":"5357_CR11","unstructured":"Alwen, J., & Peikert, C. (1996). Generating shorter bases for hard random lattices. In Proceedings of the 20th annual ACM symposium on the theory of computing, STOC 1996, Philadelphia, Pennsylvania, USA (pp. 99\u2013108)."},{"key":"5357_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008). Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the 40th annual ACM symposium on theory of computing, STOC 2008, Victoria, British Columbia, Canada, (pp. 197\u2013206).","DOI":"10.1145\/1374376.1374407"},{"key":"5357_CR13","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., & Boyen, X. (2010). Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Proceedings of advances in cryptology\u2014CRYPTO 2010, LNCS (Vol. 6223, pp. 98\u2013115). Springer.","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"5357_CR14","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010). Bonsai trees, or how to delegate a lattice basis. In Proceedings of advances in cryptology\u2014EUROCRYPT 2010, LNCS (pp. 523\u2013552). Springer.","DOI":"10.1007\/978-3-642-13190-5_27"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-018-5357-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5357-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5357-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T21:07:42Z","timestamp":1548709662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-018-5357-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,29]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["5357"],"URL":"https:\/\/doi.org\/10.1007\/s11277-018-5357-6","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,29]]},"assertion":[{"value":"29 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}