{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:14Z","timestamp":1740148874781,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,10,20]],"date-time":"2018-10-20T00:00:00Z","timestamp":1539993600000},"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":"crossref","award":["61702321,61772327,61602295,61572311,61872230"],"award-info":[{"award-number":["61702321,61772327,61602295,61572311,61872230"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Excellent Young Teachers Program of Shanghai","award":["ZZsdl15152"],"award-info":[{"award-number":["ZZsdl15152"]}]},{"name":"Project of Shanghai Science and Technology Committee","award":["15110500700"],"award-info":[{"award-number":["15110500700"]}]},{"name":"Dawn Program of Shanghai Education Commission","award":["16SG47"],"award-info":[{"award-number":["16SG47"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s12083-018-0691-8","type":"journal-article","created":{"date-parts":[[2018,10,20]],"date-time":"2018-10-20T01:51:03Z","timestamp":1540000263000},"page":"893-911","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Secure, flexible and high-efficient similarity search over encrypted data in multiple clouds"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7980-0312","authenticated-orcid":false,"given":"Jinguo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mi","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kui","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kejie","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengyong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongjiao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"691_CR1","unstructured":"Mell P, Grance T (2011) The nist definition of cloud computing [recommendations of the national institute of standards and technology-special publication 800-145]. URL Recuperado de http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-145\/SP800-145"},{"issue":"4","key":"691_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I (2010) A view of cloud computing. Commun ACM 53(4):50","journal-title":"Commun ACM"},{"issue":"3","key":"691_CR3","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TCC.2015.2511769","volume":"6","author":"L Kuang","year":"2018","unstructured":"Kuang L, Yang L, Feng J, Dong M (2018) Secure tensor decomposition using fully homomorphic encryption scheme. IEEE Trans Cloud Comput 6(3):868","journal-title":"IEEE Trans Cloud Comput"},{"issue":"7","key":"691_CR4","doi-asserted-by":"publisher","first-page":"4900","DOI":"10.1109\/TVT.2015.2466651","volume":"65","author":"S Chang","year":"2016","unstructured":"Chang S, Zhu H, Dong M, Ota K, Liu X, Shen X (2016) Private and flexible urban message delivery. IEEE Trans Veh Technol 65(7):4900","journal-title":"IEEE Trans Veh Technol"},{"issue":"1","key":"691_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s12083-014-0314-y","volume":"9","author":"J He","year":"2016","unstructured":"He J, Dong M, Ota K, Fan M, Wang G (2016) Netseccc: a scalable and fault-tolerant architecture for cloud computing security. Peer-to-Peer Netw Appl 9(1):67","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"16","key":"691_CR6","doi-asserted-by":"publisher","first-page":"3777","DOI":"10.1002\/sec.1490","volume":"9","author":"L Zhang","year":"2016","unstructured":"Zhang L, Wei L, Huang D, Zhang K, Dong M, Ota K (2016) Medaps: secure multi-entities delegated authentication protocols for mobile cloud computing. Secur Commun Netw 9(16):3777","journal-title":"Secur Commun Netw"},{"issue":"1","key":"691_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/TPDS.2012.97","volume":"24","author":"M Li","year":"2013","unstructured":"Li M, Yu S, Zheng Y, Ren K, Lou W (2013) Scalable and secure sharing of personal health records in cloud computing using attribute-based encryption. IEEE Trans Parallel Distrib Syst 24(1):131","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"691_CR8","unstructured":"Song DX, Wagner D, Perrig A (2000) In: Proc. of IEEE symposium on security and privacy. Oakland, pp 44\u201355"},{"issue":"8","key":"691_CR9","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1109\/TPDS.2011.282","volume":"23","author":"C Wang","year":"2012","unstructured":"Wang C, Cao N, Ren K, Lou W (2012) Enabling secure and efficient ranked keyword search over outsourced cloud data. IEEE Trans Parallel Distrib Syst 23(8):1467","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"691_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TPDS.2013.45","volume":"25","author":"N Cao","year":"2014","unstructured":"Cao N, Wang C, Li M, Ren K, Lou W (2014) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"691_CR11","unstructured":"Li J, Wang Q, Wang C, Cao N, Ren K, Lou W (2010) In: Proc. of IEEE INFOCOM. San Diego, pp 1\u20135"},{"key":"691_CR12","unstructured":"Wang C, Ren K, Yu S, Urs KMR (2012) In: Proc. of IEEE INFOCOM. Orlando, pp 451\u2013459"},{"issue":"1","key":"691_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TETC.2013.2273889","volume":"1","author":"M Wen","year":"2013","unstructured":"Wen M, Lu R, Zhang K, Lei J, Liang X, Shen X (2013) Parq: a privacy-preserving range query scheme over encrypted metering data for smart grid. IEEE Trans Emerg Topics Comput 1(1):178","journal-title":"IEEE Trans Emerg Topics Comput"},{"key":"691_CR14","unstructured":"Zhang W, Lin Y, Xiao S, Liu Q, Zhou T (2014) In: Proc. of IEEE international symposium of quality of service (IWQoS). HongKong, pp 370\u2013379"},{"key":"691_CR15","unstructured":"AlZain MA, Soh B, Pardede E (2013) In: IEEE international conference on computational science and engineering. Sydney, pp 130\u2013137"},{"issue":"1","key":"691_CR16","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"GS Veronese","year":"2013","unstructured":"Veronese GS, Correia M, Bessani AN, Lung LC, Verissimo P (2013) Efficient byzantine fault-tolerance. IEEE Trans Comput 62(1):16","journal-title":"IEEE Trans Comput"},{"key":"691_CR17","first-page":"216","volume":"2003","author":"EJ Goh","year":"2003","unstructured":"Goh EJ (2003) Secure indexes. IACR Cryptol ePrint Archive 2003:216","journal-title":"IACR Cryptol ePrint Archive"},{"key":"691_CR18","unstructured":"Chang YC, Mitzenmacher M (2005) In: Proc. of applied cryptography and network security. New York, pp 442\u2013455"},{"key":"691_CR19","unstructured":"Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G (2004) In: Proc. of advances in cryptology-eurocrypt. Interlaken, pp 506\u2013522"},{"issue":"1","key":"691_CR20","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/TDSC.2014.2312331","volume":"12","author":"S Duan","year":"2015","unstructured":"Duan S, Peisert S, Levitt KN (2015) hbft: speculative byzantine fault tolerance with minimum cost. IEEE Trans Depend Sec Comput 12(1):58","journal-title":"IEEE Trans Depend Sec Comput"},{"issue":"5","key":"691_CR21","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola R, Garay J, Kamara S, Ostrovsky R (2011) Searchable symmetric encryption: improved definitions and efficient constructions. J Comput Secur 19(5):895","journal-title":"J Comput Secur"},{"key":"691_CR22","unstructured":"Zhang Z, Hadjieleftheriou M, Ooi BC, Srivastava D (2010) In: Proc. of ACM SIGMOD international conference on management of data. Indianapolis, pp 915\u2013926"},{"key":"691_CR23","unstructured":"Chuah M, Hu W (2011) In: Proc. of international conference on distributed computing systems workshops (ICDCSW). Minneapolis, pp 273\u2013281"},{"issue":"4","key":"691_CR24","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder A, Mitzenmacher M (2004) Network applications of bloom filters: a survey. Internet Math 1(4):485","journal-title":"Internet Math"},{"key":"691_CR25","unstructured":"Carter JL, Wegman MN (1977) In: Proc. of the annual ACM symposium on theory of computing. Boulder, pp 106\u2013112"},{"issue":"10","key":"691_CR26","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1145\/67933.67941","volume":"32","author":"M Ramakrishna","year":"1989","unstructured":"Ramakrishna M (1989) Practical performance of bloom filters and parallel free-text searching. Commun ACM 32(10):1237","journal-title":"Commun ACM"},{"issue":"1","key":"691_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans Network 11(1):17","journal-title":"IEEE\/ACM Trans Network"},{"key":"691_CR28","unstructured":"Sahin OD, Emekci F, Agrawal D, Abbadi AE (2004) In: Proc. of databases, information systems, and peer-to-peer computing. Toronto, pp 61\u201378"},{"key":"691_CR29","unstructured":"Cheng J, Hao Y, Wong SHY, Zerfos P, Songwu L (2007) In: Proc. of IEEE international conference on network protocols (ICNP). Bejing, pp 284\u2013293"},{"issue":"6","key":"691_CR30","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TNET.2012.2188540","volume":"20","author":"F Chen","year":"2012","unstructured":"Chen F, Liu AX (2012) Privacy- and integrity-preserving range queries in sensor networks. IEEE\/ACM Trans Network 20(6):1774","journal-title":"IEEE\/ACM Trans Network"},{"issue":"3","key":"691_CR31","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.comnet.2006.05.005","volume":"51","author":"YK Chang","year":"2007","unstructured":"Chang YK (2007) Fast binary and multiway prefix searches for packet forwarding. Comput Netw 51(3):588","journal-title":"Comput Netw"},{"key":"691_CR32","unstructured":"Song H, Dharmapurikar S, Turner J, Lockwood J (2005) In: Proc. of the conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM\u201905). Philadelphia, pp 181\u2013192"},{"issue":"3","key":"691_CR33","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan L, Cao P, Almeida J, Broder AZ (2000) Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans Network 8(3):281","journal-title":"IEEE\/ACM Trans Network"},{"key":"691_CR34","unstructured":"Furukawa J, Sako K (2001) In: Advances in cryptology- proc. of CRYPTO. Santa Barbara, pp 368\u2013387"},{"key":"691_CR35","doi-asserted-by":"crossref","unstructured":"Krawczyk H, Canetti R, Bellare M (1997) Hmac: keyed-hashing for message authentication. RFC 2104","DOI":"10.17487\/rfc2104"},{"key":"691_CR36","doi-asserted-by":"crossref","unstructured":"Rivest R (1992) The md5 message-digest algorithm. RFC, 1321","DOI":"10.17487\/rfc1321"},{"key":"691_CR37","unstructured":"Eastlake 3rd D, Jones P (2001) Us secure hash algorithm 1 (sha1). Report 2070\u20131721"},{"issue":"11","key":"691_CR38","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 Q, Wang W (2013) Public-key encryption with fuzzy keyword search: a provably secure scheme under keyword guessing attack. IEEE Trans Comput 62(11):2266","journal-title":"IEEE Trans Comput"},{"key":"691_CR39","doi-asserted-by":"crossref","unstructured":"Baek J, Safavi-Naini R, Susilo W (2008) Public key encryption with keyword search revisited. Computational Science and Its Applications\u2013ICCSA 2008, pp 1249\u20131259","DOI":"10.1007\/978-3-540-69839-5_96"},{"key":"691_CR40","doi-asserted-by":"crossref","unstructured":"Katz J, Lindell Y (2014) Introduction to modern cryptography, 2nd edn. CRC Press","DOI":"10.1201\/b17668"},{"key":"691_CR41","unstructured":"AMS (2016) Request for comments database. http:\/\/www.rfc-editor.org\/rfc.html http:\/\/www.rfc-editor.org\/rfc.html"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-018-0691-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-018-0691-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-018-0691-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T16:28:14Z","timestamp":1605284894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-018-0691-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,20]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["691"],"URL":"https:\/\/doi.org\/10.1007\/s12083-018-0691-8","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2018,10,20]]},"assertion":[{"value":"18 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}