{"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":1750306370571,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"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":"Fundamental Research Funds for the Central Universities","award":["2012JBZ010 K13JB00160"],"award-info":[{"award-number":["2012JBZ010 K13JB00160"]}]},{"name":"111 Project","award":["B14005"],"award-info":[{"award-number":["B14005"]}]},{"name":"the US National Science Foundation","award":["1218085"],"award-info":[{"award-number":["1218085"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,30]]},"DOI":"10.1145\/2898445.2898453","type":"proceedings-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:58:31Z","timestamp":1464130711000},"page":"29-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast, Private and Verifiable"],"prefix":"10.1145","author":[{"given":"Shuo","family":"Qiu","sequence":"first","affiliation":[{"name":"Beijing Jiaotong University, Beijing, China"}]},{"given":"Boyang","family":"Wang","sequence":"additional","affiliation":[{"name":"The University of Arizona, Tucson, AZ, USA"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[{"name":"The University of Arizona, Tucson, AZ, USA"}]},{"given":"Jesse","family":"Victors","sequence":"additional","affiliation":[{"name":"Utah State University, Logan, UT, USA"}]},{"given":"Jiqiang","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing Jiaotong University, Beijing, China"}]},{"given":"Yanfeng","family":"Shi","sequence":"additional","affiliation":[{"name":"Beijing Jiaotong University, Beijing, China"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Jiaotong University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2016,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{Online}. Available: https:\/\/www.dropbox.com\/s\/fyes896paljrssd\/similarity_full.pdf?dl=0&preview=similarity_full.pdf  {Online}. Available: https:\/\/www.dropbox.com\/s\/fyes896paljrssd\/similarity_full.pdf?dl=0&preview=similarity_full.pdf"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335438"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2597910.2597911"},{"key":"e_1_3_2_1_7_1","first-page":"21","volume-title":"Proc. of SEQUENCES'97","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder . On the Resemblance and Containment of Documents . In Proc. of SEQUENCES'97 , pages 21 -- 29 . IEEE, 1997 . A. Z. Broder. On the Resemblance and Containment of Documents. In Proc. of SEQUENCES'97, pages 21--29. IEEE, 1997."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-319-06811-4_12","volume-title":"Pro. of Secure Data Management","author":"Buyrukbilen S.","year":"2014","unstructured":"S. Buyrukbilen and S. Bakiras . Secure similar document detection with simhash . In Pro. of Secure Data Management , pages 61 -- 75 . Springer , 2014 . S. Buyrukbilen and S. Bakiras. Secure similar document detection with simhash. In Pro. of Secure Data Management, pages 61--75. Springer, 2014."},{"key":"e_1_3_2_1_10_1","volume-title":"Outsourcing Secure Two-Party Computation as a Black Box","author":"Carter H.","year":"2014","unstructured":"H. Carter , B. Mood , P. Traynor , and K. Butler . Outsourcing Secure Two-Party Computation as a Black Box , 2014 . http:\/\/eprint.iacr.org\/. H. Carter, B. Mood, P. Traynor, and K. Butler. Outsourcing Secure Two-Party Computation as a Black Box, 2014. http:\/\/eprint.iacr.org\/."},{"key":"e_1_3_2_1_11_1","first-page":"289","volume-title":"Proc. of USENIX Security'13","author":"Carter H.","year":"2013","unstructured":"H. Carter , B. Mood , P. Traynor , and K. R. Butler . Secure outsourced garbled circuit evaluation for mobile devices . In Proc. of USENIX Security'13 , pages 289 -- 304 , Washington, D.C. , 2013 . H. Carter, B. Mood, P. Traynor, and K. R. Butler. Secure outsourced garbled circuit evaluation for mobile devices. In Proc. of USENIX Security'13, pages 289--304, Washington, D.C., 2013."},{"key":"e_1_3_2_1_12_1","volume-title":"A Measure of Asymptotic Efficiency for Tests of A Hypothesis Based on the Sum of Observations. The Annals of Mathematical Statistics, 23(4):493--507","author":"Chernoff H.","year":"1952","unstructured":"H. Chernoff . A Measure of Asymptotic Efficiency for Tests of A Hypothesis Based on the Sum of Observations. The Annals of Mathematical Statistics, 23(4):493--507 , 1952 . H. Chernoff. A Measure of Asymptotic Efficiency for Tests of A Hypothesis Based on the Sum of Observations. The Annals of Mathematical Statistics, 23(4):493--507, 1952."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2012.048080"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39256-6_9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Automata, Languages and Programming","author":"Feigenbaum J.","year":"2001","unstructured":"J. Feigenbaum , Y. Ishai , T. Malkin , K. Nissim , M. J. Strauss , and R. N. Wright . Secure multiparty computation of approximations . In Automata, Languages and Programming , pages 927 -- 938 . Springer , 2001 . J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. In Automata, Languages and Programming, pages 927--938. Springer, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_48"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich . Foundations of cryptography : volume 2 , basic applications. Cambridge University Press , 2004 . O. Goldreich. Foundations of cryptography: volume 2, basic applications. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802628"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9098-x"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of NDSS'12","author":"Huang Y.","year":"2012","unstructured":"Y. Huang , D. Evans , and J. Katz . Private Set Intersection: Are Garbled Circuits Better than Custom Protocols ? In Proc. of NDSS'12 , 2012 . Y. Huang, D. Evans, and J. Katz. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? In Proc. of NDSS'12, 2012."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885535.1885573"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1206501"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414506"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2787930"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. of NDSS'11","author":"Narayanan A.","year":"2011","unstructured":"A. Narayanan , N. Thiagarajan , M. Lakhani , M. Hamburg , and D. Boneh . Location Privacy via Private Proximity Testing . In Proc. of NDSS'11 . Citeseer , 2011 . A. Narayanan, N. Thiagarajan, M. Lakhani, M. Hamburg, and D. Boneh. Location Privacy via Private Proximity Testing. In Proc. of NDSS'11. Citeseer, 2011."},{"key":"e_1_3_2_1_33_1","first-page":"797","volume-title":"Proc. of USENIX Security'14","author":"Pinkas B.","year":"2014","unstructured":"B. Pinkas , T. Schneider , and M. Zohner . Faster Private Set Intersection based on OT Extension . In Proc. of USENIX Security'14 , pages 797 -- 812 , 2014 . B. Pinkas, T. Schneider, and M. Zohner. Faster Private Set Intersection based on OT Extension. In Proc. of USENIX Security'14, pages 797--812, 2014."},{"key":"e_1_3_2_1_34_1","volume-title":"Fingerprinting by random polynomials","author":"Rabin M. O.","year":"1981","unstructured":"M. O. Rabin Fingerprinting by random polynomials . Center for Research in Computing Techn., Aiken Computation Laboratory, Univ., 1981 . M. O. Rabin et al. Fingerprinting by random polynomials. Center for Research in Computing Techn., Aiken Computation Laboratory, Univ., 1981."},{"key":"e_1_3_2_1_35_1","first-page":"160","volume-title":"Protocols for Secure Computations. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science","author":"Yao A. C.","year":"1982","unstructured":"A. C. Yao . Protocols for Secure Computations. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages 160 -- 164 . IEEE, 1982 . A. C. Yao. Protocols for Secure Computations. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 160--164. IEEE, 1982."}],"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.2898453","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2898445.2898453","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.2898453"}},"subtitle":["Server-aided Approximate Similarity Computation over Large-Scale Datasets"],"short-title":[],"issued":{"date-parts":[[2016,5,30]]},"references-count":35,"alternative-id":["10.1145\/2898445.2898453","10.1145\/2898445"],"URL":"https:\/\/doi.org\/10.1145\/2898445.2898453","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"}}]}}