{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T22:17:43Z","timestamp":1769552263873,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["No.30918012204"],"award-info":[{"award-number":["No.30918012204"]}],"id":[{"id":"10.13039\/501100012226","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-09753-1","type":"journal-article","created":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T04:07:50Z","timestamp":1600488470000},"page":"3193-3211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Multi-user search on the encrypted multimedia database: lattice-based searchable encryption scheme with time-controlled proxy re-encryption"],"prefix":"10.1007","volume":"80","author":[{"given":"Xiaoling","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chungen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bennian","family":"Dou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuntao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"9753_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X (2010) Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: CRYPTO, pp 98\u2013115","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"9753_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: ACM symposium on the theory of computing, pp 99\u2013108","DOI":"10.1145\/237814.237838"},{"key":"9753_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai M (1999) Generating hard instances of the short basis problem. In: Proceedings of ICALP, pp 1\u20139","DOI":"10.1007\/3-540-48523-6_1"},{"key":"9753_CR4","unstructured":"Alwen J, Peikert C (2009) Generating shorter bases for hard random lattices. In: Proceedings of STACS, pp 75\u201386"},{"key":"9753_CR5","doi-asserted-by":"publisher","unstructured":"Behnia R, Ozmen MO, Yavuz AA (2018) Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans Dependable Secure Comput. https:\/\/doi.org\/10.1109\/TDSC.2018.2867462","DOI":"10.1109\/TDSC.2018.2867462"},{"key":"9753_CR6","doi-asserted-by":"crossref","unstructured":"Boneh D, Crescenzo GD, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: EUROCRYPT, pp 506\u2013522","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"9753_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Langlois A, Peikert C, Regev O, Stehl\u0117 D (2013) Classical hardness of learning with errors. In: Symposium on theory of computing conference, STOC, pp 575\u2013584","DOI":"10.1145\/2488608.2488680"},{"key":"9753_CR8","doi-asserted-by":"crossref","unstructured":"Byun JW, Rhee HS, Park H, Lee DH (2006) Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Secure data management, third VLDB workshop, SDM, pp 75\u201383","DOI":"10.1007\/11844662_6"},{"key":"9753_CR9","doi-asserted-by":"crossref","unstructured":"Cash D, Hofheinz D, Kiltz E, Peikert C (2010) Bonsai trees, or how to delegate a lattice basis. In: EUROCRYPT, pp 523\u2013552","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"9753_CR10","doi-asserted-by":"crossref","unstructured":"Chen R, Mu Y, Yang G, Guo F, Wang X (2015) A new general framework for secure public key encryption with keyword search. In: ACISP, pp 59\u201376","DOI":"10.1007\/978-3-319-19962-7_4"},{"issue":"8","key":"9753_CR11","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1587\/transcom.2017EBP3274","volume":"101-B","author":"Y Chen","year":"2018","unstructured":"Chen Y, Hu Y, Zhu M, Yang G (2018) Attribute-based keyword search with proxy re-encryption in the cloud. IEICE Trans 101-B(8):1798\u20131808","journal-title":"IEICE Trans"},{"key":"9753_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ins.2013.03.008","volume":"238","author":"L Fang","year":"2013","unstructured":"Fang L, Susilo W, Ge C, Wang J (2013) Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Inf Sci 238:221\u2013241","journal-title":"Inf Sci"},{"key":"9753_CR13","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the ACM symposium on theory of computing, pp 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"9753_CR14","doi-asserted-by":"crossref","unstructured":"Gordon SD, Katz J, Vaikuntanathan V (2010) A group signature scheme from lattice assumptions. In: Advances in cryptology - ASIACRYPT, pp 395\u2013412","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"9753_CR15","doi-asserted-by":"crossref","unstructured":"Gu C, Zheng Y, Kang F, Xin D (2015) Keyword search over encrypted data in cloud computing from lattices in the standard model. In: Cloud computing and big data - second international conference, CloudCom-Asia, pp 335\u2013343","DOI":"10.1007\/978-3-319-28430-9_25"},{"key":"9753_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.03.038","volume":"403","author":"Q Huang","year":"2017","unstructured":"Huang Q, Li H (2017) An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf Sci 403:1\u201314","journal-title":"Inf Sci"},{"issue":"4s","key":"9753_CR17","first-page":"67:1","volume":"12","author":"Y Li","year":"2016","unstructured":"Li Y, Gai K, Ming Z, Zhao H, Qiu M (2016) Intercrossed access controls for secure financial services on multimedia big data in cloud systems. ACM Trans Multim Comput Commun Appl 12(4s):67:1\u201367:18","journal-title":"ACM Trans Multim Comput Commun Appl"},{"issue":"6","key":"9753_CR18","doi-asserted-by":"publisher","first-page":"34:1","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 ACM 56(6):34:1\u201334:40","journal-title":"J ACM"},{"issue":"5","key":"9753_CR19","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.jss.2009.11.726","volume":"83","author":"HS Rhee","year":"2010","unstructured":"Rhee HS, Park JH, Susilo W, Lee DH (2010) Trapdoor security in a searchable public-key encryption scheme with a designated tester. J Syst Softw 83(5):763\u2013771","journal-title":"J Syst Softw"},{"issue":"13","key":"9753_CR20","doi-asserted-by":"publisher","first-page":"2576","DOI":"10.1016\/j.ins.2010.03.026","volume":"180","author":"J Shao","year":"2010","unstructured":"Shao J, Cao Z, Liang X, Lin H (2010) Proxy re-encryption with keyword search. Inf Sci 180(13):2576\u20132587","journal-title":"Inf Sci"},{"issue":"15-16","key":"9753_CR21","doi-asserted-by":"publisher","first-page":"10717","DOI":"10.1007\/s11042-019-08573-2","volume":"79","author":"SK Sood","year":"2020","unstructured":"Sood SK (2020) Mobile fog based secure cloud-iot framework for enterprise multimedia security. Multim Tools Appl 79(15-16):10717\u201310732","journal-title":"Multim Tools Appl"},{"issue":"3","key":"9753_CR22","first-page":"038106:1","volume":"61","author":"L Sun","year":"2018","unstructured":"Sun L, Xu C, Zhang M, Chen K, Li H (2018) Secure searchable public key encryption against insider keyword guessing attacks from indistinguishability obfuscation, SCIENCE, CHINA. Inf Sci 61(3):038106:1\u2013038106:3","journal-title":"Inf Sci"},{"issue":"3","key":"9753_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCOM.2014.6766088","volume":"52","author":"H Wang","year":"2014","unstructured":"Wang H, Wu S, Chen M, Wang W (2014) Security protection between users and the mobile media cloud. IEEE Commun Mag 52(3):73\u201379","journal-title":"IEEE Commun Mag"},{"issue":"3","key":"9753_CR24","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.jss.2011.09.035","volume":"85","author":"XA Wang","year":"2012","unstructured":"Wang XA, Huang X, Yang X, Liu L, Wu X (2012) Further observation on proxy re-encryption with keyword search. J Syst Softw 85(3):643\u2013654","journal-title":"J Syst Softw"},{"key":"9753_CR25","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.jnca.2018.12.003","volume":"128","author":"L Xu","year":"2019","unstructured":"Xu L, Li J, Chen X, Li W, Tang S, Wu H (2019) Tc-pedcks: Towards time controlled public key encryption with delegatable conjunctive keyword search for internet of things. J Netw Comput Appl 128:11\u201320","journal-title":"J Netw Comput Appl"},{"key":"9753_CR26","doi-asserted-by":"crossref","unstructured":"Xu L, Yuan X, Steinfeld R, Wang C, Xu C (2019) Multi-writer searchable encryption: An lwe-based realization and implementation. In: Asia conference on computer and communications security, AsiaCCS, pp 122\u2013133","DOI":"10.1145\/3321705.3329814"},{"issue":"4","key":"9753_CR27","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TIFS.2015.2509912","volume":"11","author":"Y Yang","year":"2016","unstructured":"Yang Y, Ma M (2016) Conjunctive keyword search with designated tester and timing enabled proxy re-encryption function for e-health clouds. IEEE Trans Inf Forensic Secur 11(4):746\u2013759","journal-title":"IEEE Trans Inf Forensic Secur"},{"key":"9753_CR28","doi-asserted-by":"crossref","unstructured":"Yang Y, Zheng X, Chang V, Tang C (2017) Semantic keyword searchable proxy re-encryption for postquantum secure cloud storage. Concurr Comput 29(19)","DOI":"10.1002\/cpe.4211"},{"issue":"8","key":"9753_CR29","doi-asserted-by":"publisher","first-page":"9927","DOI":"10.1007\/s11042-017-4560-x","volume":"77","author":"Y Yang","year":"2018","unstructured":"Yang Y, Zheng X, Chang V, Ye S, Tang C (2018) Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multimedia Tools Appl 77(8):9927\u20139941","journal-title":"Multimedia Tools Appl"},{"issue":"3","key":"9753_CR30","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11277-018-5357-6","volume":"100","author":"X Zhang","year":"2018","unstructured":"Zhang X, Xu C (2018) Trapdoor security lattice-based public-key searchable encryption with a designated cloud server. Wirel Pers Commun 100 (3):907\u2013921","journal-title":"Wirel Pers Commun"},{"key":"9753_CR31","doi-asserted-by":"publisher","unstructured":"Zhang X, Xu C, Wang H, Zhang Y, Wang S (2019) Fs-peks: lattice-based forward secure public-key encryption with keyword search for cloud-assisted industrial internet of things. IEEE Trans Dependable Secure Comput. https:\/\/doi.org\/10.1109\/TDSC.2019.2914117","DOI":"10.1109\/TDSC.2019.2914117"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09753-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-020-09753-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09753-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T15:43:00Z","timestamp":1696693380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-020-09753-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,19]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["9753"],"URL":"https:\/\/doi.org\/10.1007\/s11042-020-09753-1","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,19]]},"assertion":[{"value":"19 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}