{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:50Z","timestamp":1750306370943,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T00:00:00Z","timestamp":1464566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"State Key Laboratory for Novel Software Technology Nanjing University","award":["NSFC-61300235","NSFC-61321491","NSFC-61402223","NSFC-61425024"],"award-info":[{"award-number":["NSFC-61300235","NSFC-61321491","NSFC-61402223","NSFC-61425024"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,30]]},"DOI":"10.1145\/2898445.2898451","type":"proceedings-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:58:31Z","timestamp":1464130711000},"page":"37-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Secure Index Supporting Efficient Index Updating and Similarity Search on Clouds"],"prefix":"10.1145","author":[{"given":"Baojia","family":"Zhang","sequence":"first","affiliation":[{"name":"NanJing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Zhang","sequence":"additional","affiliation":[{"name":"NanJing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boqun","family":"Yan","sequence":"additional","affiliation":[{"name":"NanJing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"NanJing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935306"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography -","author":"Goldreich Oded","year":"2004","unstructured":"Oded Goldreich . The Foundations of Cryptography - Volume 2 , Basic Applications. Cambridge University Press , 2004 . Oded Goldreich. The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833604"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Michael\n      Luby\n     and \n      Charles\n      Rackoff\n    .\n  How to construct pseudo-random permutations from pseudo-random functions (abstract)\n  . In Hugh C. Williams editor CRYPTO volume \n  218\n   of \n  Lecture Notes in Computer Science page \n  447\n  . Springer 1985.   Michael Luby and Charles Rackoff. How to construct pseudo-random permutations from pseudo-random functions (abstract). In Hugh C. Williams editor CRYPTO volume 218 of Lecture Notes in Computer Science page 447. Springer 1985.","DOI":"10.1007\/3-540-39799-X_34"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258581"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/882494.884426"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2012.89"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.34"},{"key":"e_1_3_2_1_12_1","first-page":"451","volume-title":"INFOCOM","author":"Wang Cong","year":"2012","unstructured":"Cong Wang , Kui Ren , Shucheng Yu , and Karthik Mahendra Raje Urs . Achieving usable and privacy-assured similarity search over outsourced cloud data. In Albert G. Greenberg and Kazem Sohraby, editors , INFOCOM , pages 451 -- 459 . IEEE, 2012 . Cong Wang, Kui Ren, Shucheng Yu, and Karthik Mahendra Raje Urs. Achieving usable and privacy-assured similarity search over outsourced cloud data. In Albert G. Greenberg and Kazem Sohraby, editors, INFOCOM, pages 451--459. IEEE, 2012."}],"event":{"name":"ASIA CCS '16: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Xi'an China","acronym":"ASIA CCS '16"},"container-title":["Proceedings of the 4th ACM International Workshop on Security in Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898445.2898451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2898445.2898451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:30Z","timestamp":1750222590000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898445.2898451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,30]]},"references-count":12,"alternative-id":["10.1145\/2898445.2898451","10.1145\/2898445"],"URL":"https:\/\/doi.org\/10.1145\/2898445.2898451","relation":{},"subject":[],"published":{"date-parts":[[2016,5,30]]},"assertion":[{"value":"2016-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}