{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:27:21Z","timestamp":1740122841528,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T00:00:00Z","timestamp":1601424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T00:00:00Z","timestamp":1601424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1604156","61901160","U1804164"],"award-info":[{"award-number":["U1604156","61901160","U1804164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s11042-020-09898-z","type":"journal-article","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T15:04:03Z","timestamp":1601478243000},"page":"4655-4672","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A lattice-based searchable encryption scheme with the validity period control of files"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4106-6877","authenticated-orcid":false,"given":"En","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingying","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gongli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,30]]},"reference":[{"key":"9898_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010) Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE[c]. In: Annual cryptology conference. Springer, Berlin, pp 98\u2013115","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"9898_CR2","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00224-010-9278-3","volume":"48","author":"J Alwen","year":"2011","unstructured":"Alwen J, Peikert C (2011) Generating shorter bases for hard random lattices. Theor Comput Syst 48:535\u2013553","journal-title":"Theor Comput Syst"},{"issue":"16","key":"9898_CR3","first-page":"506","volume":"3027","author":"D BONEH","year":"2004","unstructured":"BONEH D, CRESCENZO G D, OSTROVSKY R, et al. (2004) Public key encryption with keyword search[J]. Eurocrypt 3027(16):506\u2013522","journal-title":"Eurocrypt"},{"key":"9898_CR4","doi-asserted-by":"crossref","unstructured":"Baek J, Safavi-Naini R, Susulo W (2008) Public key encryption with keyword search revisited[C]. In: International conference on computational science and its applications. Springer, Berlin, pp 1249\u20131259","DOI":"10.1007\/978-3-540-69839-5_96"},{"key":"9898_CR5","doi-asserted-by":"crossref","unstructured":"Cash D, Hofheinz D, Kiltz E, et al. (2010) Bonsai trees, or how to delegate a lattice basis[C]. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, pp 523\u2013552","DOI":"10.1007\/978-3-642-13190-5_27"},{"issue":"8","key":"9898_CR6","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1587\/transfun.E94.A.1682","volume":"94","author":"K Emura","year":"2011","unstructured":"Emura K, Miyaji A, Omote KA (2011) Timed-release proxy re-encryption scheme[J]. IEICE Trans Fundament Electron Commun Comput Sci 94 (8):1682\u20131695","journal-title":"IEICE Trans Fundament Electron Commun Comput Sci"},{"issue":"5","key":"9898_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10207-018-00426-7","volume":"18","author":"O Farr\u00e0s","year":"2019","unstructured":"Farr\u00e0s O, Ribes-Gonz\u00e1lez J (2019) Provably secure public-key encryption with conjunctive and subset keyword search[J]. Int J Inf Secur 18(5):533\u2013548","journal-title":"Int J Inf Secur"},{"key":"9898_CR8","first-page":"216","volume":"2003","author":"EJ GOH","year":"2003","unstructured":"GOH EJ (2003) Secure indexes[J]. IACR Cryptol ePrint Arc 2003:216","journal-title":"IACR Cryptol ePrint Arc"},{"key":"9898_CR9","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Vaikuntanathan V (2010) A simple BGNtype cryptosystem from LWE[C]. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, pp 506\u2013522","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"9898_CR10","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions[C]. In: Proceedings of the fortieth annual ACM symposium on Theory of computing. ACM, pp 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"issue":"1","key":"9898_CR11","first-page":"1","volume":"19","author":"CX Gu","year":"2013","unstructured":"Gu CX, Guang Y, Zhu YF, et al. (2013) Public key encryption with keyword search from lattices[J]. Int J Inform Technol 19(1):1\u201310","journal-title":"Int J Inform Technol"},{"key":"9898_CR12","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.jss.2017.12.008","volume":"137","author":"Z Guo","year":"2018","unstructured":"Guo Z, Zhang H, Sun C, et al. (2018) Secure multi-keyword ranked search over encrypted cloud data for multiple data owners[J]. J Syst Softw 137:380\u2013395","journal-title":"J Syst Softw"},{"issue":"17","key":"9898_CR13","doi-asserted-by":"publisher","first-page":"e5201","DOI":"10.1002\/cpe.5201","volume":"31","author":"R Handa","year":"2019","unstructured":"Handa R, Krishna CR, Aggarwal N (2019) Searchable encryption: a survey on privacy-preserving search schemes on encrypted outsourced data[J]. Concurr Comput Pract Exp 31(17):e5201","journal-title":"Concurr Comput Pract Exp"},{"issue":"3","key":"9898_CR14","doi-asserted-by":"publisher","first-page":"5763","DOI":"10.1007\/s10586-017-1521-0","volume":"22","author":"J Hong","year":"2019","unstructured":"Hong J, Wen T, Guo Q, et al. (2019) Privacy protection and integrity verification of aggregate queries in cloud computing[J]. Clust Comput 22 (3):5763\u20135773","journal-title":"Clust Comput"},{"key":"9898_CR15","doi-asserted-by":"crossref","unstructured":"Hou CJ, Liu F, Bai HT, et al. (2013) Public-key encryption with keyword search from Lattice[c]. In: p2p, Parallel, Grid, Cloud and Internet Computing (3PGCIC)2013 Eighth international conference on IEEE, pp 336\u2013339","DOI":"10.1109\/3PGCIC.2013.57"},{"issue":"5","key":"9898_CR16","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1109\/TSC.2016.2542813","volume":"10","author":"J Li","year":"2016","unstructured":"Li J, Lin X, Zhang Y, et al. (2016) KSF-OABE: Outsourced attribute-based encryption with keyword search function for cloud storage[J]. IEEE Trans Serv Comput 10(5):715\u2013725","journal-title":"IEEE Trans Serv Comput"},{"key":"9898_CR17","doi-asserted-by":"crossref","unstructured":"Liang K, Huang Q, Schlegel R (2013) A conditional proxy broadcast reencryption scheme supporting timed-release [C]. In: International conference on information security practice and experience. Springer, Berlin, pp 132\u2013146","DOI":"10.1007\/978-3-642-38033-4_10"},{"issue":"2","key":"9898_CR18","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/TII.2017.2703922","volume":"14","author":"MM MA","year":"2018","unstructured":"MA MM, HE DB, KUMAR N, et al. (2018) Certificateless searchable public key encryption scheme for industrial internet of things[J]. IEEE Trans Indust Inform 14(2):759\u2013767","journal-title":"IEEE Trans Indust Inform"},{"key":"9898_CR19","unstructured":"Miao Y, Liu X, Choo KKR, et al. (2019) Privacy-preserving attribute-based keyword search in shared multi-owner setting[J]. IEEE Trans Dependable Secure Comput"},{"key":"9898_CR20","doi-asserted-by":"crossref","unstructured":"Miao Y, Ma J, Liu X, et al. (2017) Attribute-based keyword search over hierarchical data in cloud computing[J]. IEEE Trans Serv Comput","DOI":"10.1109\/TSC.2017.2757467"},{"issue":"4","key":"9898_CR21","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s12083-016-0458-z","volume":"10","author":"Y Miao","year":"2017","unstructured":"Miao Y, Ma J, Wei F, et al. (2017) VCSE: verifiable conjunctive keywords search over encrypted data without secure-channel[J]. Peer-to-Peer Netw Appl 10(4):995\u20131007","journal-title":"Peer-to-Peer Netw Appl"},{"key":"9898_CR22","doi-asserted-by":"crossref","unstructured":"Peikert C (2009) Public-key cryptosystems from the worst-case shortest vector problem[C]. In: Proceedings of the forty-first annual ACM symposium on theory of computing. ACM, pp 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"issue":"6","key":"9898_CR23","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography[J]. J ACM (JACM) 56(6):34","journal-title":"J ACM (JACM)"},{"issue":"2","key":"9898_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW SHOR","year":"1999","unstructured":"SHOR PW (1999) Polynomial-time algorithms for prime factorizetion and discrete logarithms on a quantum computer[J]. SIAM Rev 41(2):303\u2013332","journal-title":"SIAM Rev"},{"key":"9898_CR25","unstructured":"Song D X, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data[C]\/\/sp. IEEE Comput Soc"},{"key":"9898_CR26","doi-asserted-by":"crossref","unstructured":"Tahir S, Ruj S, Rajarajan M (2017) An efficient disjunctive query enabled ranked searchable encryption scheme[C]. In: 2017 IEEE Trustcom\/BigDataSE\/ICESS, IEEE, pp 425\u2013432","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.267"},{"issue":"11","key":"9898_CR27","doi-asserted-by":"publisher","first-page":"e0206126","DOI":"10.1371\/journal.pone.0206126","volume":"13","author":"S Wang","year":"2018","unstructured":"Wang S, Gao T, Zhang Y (2018) Searchable and revocable multi-data owner attribute-based encryption scheme with hidden policy in cloud storage[J]. PloS one 13(11):e0206126","journal-title":"PloS one"},{"issue":"1","key":"9898_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJWGS.2018.088357","volume":"14","author":"R Xie","year":"2018","unstructured":"Xie R, Xu CX, He CL, et al. (2018) Lattice-based searchable public-key encryption scheme for secure cloud storage[J]. Int J Web Grid Serv 14 (1):3\u201320","journal-title":"Int J Web Grid Serv"},{"issue":"11","key":"9898_CR29","doi-asserted-by":"publisher","first-page":"2266","DOI":"10.1109\/TC.2012.215","volume":"62","author":"P Xu","year":"2013","unstructured":"Xu P, Jin H, Wu QH, et al. (2013) Public-key encryption with fuzzy keyword search: a provably secure scheme under keyword guessing attack[J]. IEEE Trans Comput 62(11):2266\u20132277","journal-title":"IEEE Trans Comput"},{"key":"9898_CR30","doi-asserted-by":"crossref","unstructured":"Xu L, Yuan X, Steinfeld R, et al. (2019) Multi-Writer Searchable Encryption: an LWE-based realization and implementation [C]. In: Proceedings of the 2019 ACM asia conference on computer and communications security. New York: ACM, pp 122\u2013133","DOI":"10.1145\/3321705.3329814"},{"issue":"4","key":"9898_CR31","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TIFS.2015.2509912","volume":"11","author":"Y Yang","year":"2015","unstructured":"Yang Y, Ma M (2015) Conjunctive keyword search with designated tester and timing enabled proxy re-encryption function for e-health clouds[J]. IEEE Trans Inform Foren Secur 11(4):746\u2013759","journal-title":"IEEE Trans Inform Foren Secur"},{"issue":"2018","key":"9898_CR32","first-page":"9927\u2019lC9941","volume":"77","author":"Y Yang","year":"2018","unstructured":"Yang Y, Zheng XH, Chang V (2018) Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud[J]. Multimed Tools Appl 77(2018):9927\u2019lC9941","journal-title":"Multimed Tools Appl"},{"key":"9898_CR33","doi-asserted-by":"publisher","first-page":"5682","DOI":"10.1109\/ACCESS.2018.2889754","volume":"7","author":"H Yin","year":"2019","unstructured":"Yin H, Zhang J, Xiong Y, et al. (2019) CP-ABSE: a ciphertext-policy attribute-based searchable encryption scheme[J]. IEEE Access 7:5682\u20135694","journal-title":"IEEE Access"},{"key":"9898_CR34","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ins.2016.09.056","volume":"387","author":"E Zhang","year":"2017","unstructured":"Zhang E, Li F, Niu B, et al. (2017) Server-aided private set intersection based on reputation[J]. Inform Sci 387:180\u2013194","journal-title":"Inform Sci"},{"issue":"18","key":"9898_CR35","doi-asserted-by":"publisher","first-page":"3655","DOI":"10.3390\/app9183655","volume":"9","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Li Y, Wang Y (2019) Efficient conjunctive keywords search over encrypted e-mail data in public key setting[J]. Appl Sci 9(18):3655","journal-title":"Appl Sci"},{"issue":"1","key":"9898_CR36","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1049\/iet-ifs.2017.0026","volume":"12","author":"E Zhang","year":"2017","unstructured":"Zhang E, Peng J, Li M (2017) Outsourcing secret sharing scheme based on homomorphism encryption[J]. IET Inform Secur 12(1):94\u201399","journal-title":"IET Inform Secur"},{"key":"9898_CR37","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.ins.2019.04.051","volume":"494","author":"X Zhang","year":"2019","unstructured":"Zhang X, Tang Y, Wang H (2019) Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage[J]. Inform Sci 494:193\u2013207","journal-title":"Inform Sci"},{"issue":"3","key":"9898_CR38","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11277-018-5357-6","volume":"100","author":"XJ Zhang","year":"2018","unstructured":"Zhang XJ, Xu CX (2018) Trapdoor security lattice-based public-key searchable encryption with a designated cloud server[J]. Wirel Pers Commun 100 (3):907\u2013921","journal-title":"Wirel Pers Commun"},{"issue":"1","key":"9898_CR39","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.jnca.2010.07.007","volume":"34","author":"B Zhang","year":"2011","unstructured":"Zhang B, Zhang FG (2011) An efficient public key encryption with conjunctive-subset keywords search[J]. J Netw Comput Appl 34(1):262\u2013267","journal-title":"J Netw Comput Appl"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09898-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-020-09898-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09898-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T19:18:45Z","timestamp":1696792725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-020-09898-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,30]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["9898"],"URL":"https:\/\/doi.org\/10.1007\/s11042-020-09898-z","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2020,9,30]]},"assertion":[{"value":"6 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}