{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T16:11:03Z","timestamp":1790352663863,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The National Cryptography Development Fund","award":["Grant No. MMJJ20170209"],"award-info":[{"award-number":["Grant No. MMJJ20170209"]}]},{"name":"The National Key Research and Development Program of China","award":["Grant No. 2018YFA0704701"],"award-info":[{"award-number":["Grant No. 2018YFA0704701"]}]},{"name":"National Natural Science Foundation of China","award":["Grant No. 61872236 and 61971192"],"award-info":[{"award-number":["Grant No. 61872236 and 61971192"]}]},{"name":"The Major Program of Guangdong Basic and Applied Research","award":["Grant No. 2019B030302008"],"award-info":[{"award-number":["Grant No. 2019B030302008"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417237","type":"proceedings-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T16:21:21Z","timestamp":1614874881000},"page":"1219-1232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["LEAF: A Faster Secure Search Algorithm via Localization, Extraction, and Reconstruction"],"prefix":"10.1145","author":[{"given":"Rui","family":"Wen","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbruecken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Xie","sequence":"additional","affiliation":[{"name":"PlatON, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Zhang","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbruecken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243810"},{"key":"e_1_3_2_2_2_1","volume-title":"Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free. Symposium on Privacy Enhancing Technologies Symposium","author":"Akavia Adi","year":"2019","unstructured":"Adi Akavia , Craig Gentry , Shai Halevi , and Max Leibovich . 2019 . Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free. Symposium on Privacy Enhancing Technologies Symposium (2019). Adi Akavia, Craig Gentry, Shai Halevi, and Max Leibovich. 2019. Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free. Symposium on Privacy Enhancing Technologies Symposium (2019)."},{"key":"e_1_3_2_2_3_1","volume-title":"Public Key Encryption with Keyword Search. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 506--522","author":"Boneh Dan","year":"2004","unstructured":"Dan Boneh , Giovanni Di Crescenzo , Rafail Ostrovsky , and Giuseppe Persiano . 2004 . Public Key Encryption with Keyword Search. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 506--522 . Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. 2004. Public Key Encryption with Keyword Search. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 506--522."},{"key":"e_1_3_2_2_4_1","volume-title":"ACM Transactions on Computation Theory","author":"Brakerski Zvika","year":"2014","unstructured":"Zvika Brakerski , Craig Gentry , and Vinod Vaikuntanathan . 2014. (Leveled) Fully Homomorphic Encryption without Bootstrapping . ACM Transactions on Computation Theory ( 2014 ). Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2014. (Leveled) Fully Homomorphic Encryption without Bootstrapping. ACM Transactions on Computation Theory (2014)."},{"key":"e_1_3_2_2_5_1","series-title":"SIAM Journal on Computing","volume-title":"Efficient Fully Homomorphic Encryption from (Standard) LWE","author":"Brakerski Zvika","year":"2014","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan . 2014. Efficient Fully Homomorphic Encryption from (Standard) LWE . SIAM Journal on Computing ( 2014 ). Zvika Brakerski and Vinod Vaikuntanathan. 2014. Efficient Fully Homomorphic Encryption from (Standard) LWE. SIAM Journal on Computing (2014)."},{"key":"e_1_3_2_2_6_1","volume-title":"Homomorphic Lower Digits Removal and Improved FHE Bootstrapping. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 315--337","author":"Chen Hao","year":"2018","unstructured":"Hao Chen and Kyoohyung Han . 2018 . Homomorphic Lower Digits Removal and Improved FHE Bootstrapping. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 315--337 . Hao Chen and Kyoohyung Han. 2018. Homomorphic Lower Digits Removal and Improved FHE Bootstrapping. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 315--337."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_2_9_1","volume-title":"Homomorphic Encryption for Arithmetic of Approximate Numbers. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer, 409--437","author":"Cheon Jung Hee","year":"2017","unstructured":"Jung Hee Cheon , Andrey Kim , Miran Kim , and Yongsoo Song . 2017 b. Homomorphic Encryption for Arithmetic of Approximate Numbers. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer, 409--437 . Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song. 2017b. Homomorphic Encryption for Arithmetic of Approximate Numbers. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer, 409--437."},{"key":"e_1_3_2_2_10_1","volume-title":"Numerical Method for Comparison on Homomorphically Encrypted Numbers. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer, 415--445","author":"Cheon Jung Hee","year":"2019","unstructured":"Jung Hee Cheon , Dongwoo Kim , Duhyeong Kim , Hun Hee Lee , and Keewoo Lee . 2019 . Numerical Method for Comparison on Homomorphically Encrypted Numbers. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer, 415--445 . Jung Hee Cheon, Dongwoo Kim, Duhyeong Kim, Hun Hee Lee, and Keewoo Lee. 2019. Numerical Method for Comparison on Homomorphically Encrypted Numbers. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). Springer, 415--445."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2483486"},{"key":"e_1_3_2_2_12_1","volume-title":"Homomorphic Computation of Edit Distance. In International Conference on Financial Cryptography and Data Security (FC). Springer, 194--212","author":"Cheon Jung Hee","year":"2015","unstructured":"Jung Hee Cheon , Miran Kim , and Kristin Lauter . 2015 . Homomorphic Computation of Edit Distance. In International Conference on Financial Cryptography and Data Security (FC). Springer, 194--212 . Jung Hee Cheon, Miran Kim, and Kristin Lauter. 2015. Homomorphic Computation of Edit Distance. In International Conference on Financial Cryptography and Data Security (FC). Springer, 194--212."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3267973.3267974"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44774-1_16"},{"key":"e_1_3_2_2_16_1","volume-title":"Fully Homomorphic Encryption Using Ideal Lattices. In Annual ACM Symposium on Theory of Computing (STOC). ACM, 169--178","author":"Gentry Craig","year":"2009","unstructured":"Craig Gentry . 2009 . Fully Homomorphic Encryption Using Ideal Lattices. In Annual ACM Symposium on Theory of Computing (STOC). ACM, 169--178 . Craig Gentry. 2009. Fully Homomorphic Encryption Using Ideal Lattices. In Annual ACM Symposium on Theory of Computing (STOC). ACM, 169--178."},{"key":"e_1_3_2_2_17_1","volume-title":"Attribute-Based. In Annual International Cryptology Conference (CRYPTO). Springer, 75--92","author":"Gentry Craig","year":"2013","unstructured":"Craig Gentry , Amit Sahai , and Brent Waters . 2013 . Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster , Attribute-Based. In Annual International Cryptology Conference (CRYPTO). Springer, 75--92 . Craig Gentry, Amit Sahai, and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based. In Annual International Cryptology Conference (CRYPTO). Springer, 75--92."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_20_1","volume-title":"San Ling, Shu Qin Ren, Benjamin Hong Meng Tan, and Huaxiong Wang.","author":"Kim Myungsun","year":"2016","unstructured":"Myungsun Kim , Hyung Tae Lee , San Ling, Shu Qin Ren, Benjamin Hong Meng Tan, and Huaxiong Wang. 2016 . Better Security for Queries on Encrypted Databases. Cryptology ePrint Archive, Report 2016\/470 (2016). Myungsun Kim, Hyung Tae Lee, San Ling, Shu Qin Ren, Benjamin Hong Meng Tan, and Huaxiong Wang. 2016. Better Security for Queries on Encrypted Databases. Cryptology ePrint Archive, Report 2016\/470 (2016)."},{"key":"e_1_3_2_2_21_1","volume-title":"San Ling, Benjamin Hong Meng Tan, and Huaxiong Wang.","author":"Kim Myungsun","year":"2017","unstructured":"Myungsun Kim , Hyung Tae Lee , San Ling, Benjamin Hong Meng Tan, and Huaxiong Wang. 2017 . Private Compound Wildcard Queries Using Fully Homomorphic Encryption. IEEE Transactions on Dependable and Secure Computing ( 2017). Myungsun Kim, Hyung Tae Lee, San Ling, Benjamin Hong Meng Tan, and Huaxiong Wang. 2017. Private Compound Wildcard Queries Using Fully Homomorphic Encryption. IEEE Transactions on Dependable and Secure Computing (2017)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_2_23_1","volume-title":"Private Computation on Encrypted Genomic Data. In International Conference on Cryptology and Information Security in Latin America (LATINCRYPT). Springer, 3--27","author":"Lauter Kristin","year":"2014","unstructured":"Kristin Lauter , Adriana L\u00f3pez-Alt , and Michael Naehrig . 2014 . Private Computation on Encrypted Genomic Data. In International Conference on Cryptology and Information Security in Latin America (LATINCRYPT). Springer, 3--27 . Kristin Lauter, Adriana L\u00f3pez-Alt, and Michael Naehrig. 2014. Private Computation on Encrypted Genomic Data. In International Conference on Cryptology and Information Security in Latin America (LATINCRYPT). Springer, 3--27."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_2_25_1","volume-title":"Scalable Private Set Intersection Based on OT Extension. ACM Transactions on Privacy and Security","author":"Pinkas Benny","year":"2018","unstructured":"Benny Pinkas , Thomas Schneider , and Michael Zohner . 2018. Scalable Private Set Intersection Based on OT Extension. ACM Transactions on Privacy and Security ( 2018 ). Benny Pinkas, Thomas Schneider, and Michael Zohner. 2018. Scalable Private Set Intersection Based on OT Extension. ACM Transactions on Privacy and Security (2018)."},{"key":"e_1_3_2_2_26_1","volume-title":"Lower Bounds on the Size of Bounded Depth Circuits over a Complete Basis with Logical Addition. Mathematical notes of the Academy of Sciences of the USSR","author":"Razborov A. A.","year":"1987","unstructured":"A. A. Razborov . 1987. Lower Bounds on the Size of Bounded Depth Circuits over a Complete Basis with Logical Addition. Mathematical notes of the Academy of Sciences of the USSR ( 1987 ). A. A. Razborov. 1987. Lower Bounds on the Size of Bounded Depth Circuits over a Complete Basis with Logical Addition. Mathematical notes of the Academy of Sciences of the USSR (1987)."},{"key":"e_1_3_2_2_27_1","volume-title":"Fully Homomorphic SIMD Operations. Designs, Codes and Cryptography","author":"Smart Nigel P","year":"2014","unstructured":"Nigel P Smart and Frederik Vercauteren . 2014. Fully Homomorphic SIMD Operations. Designs, Codes and Cryptography ( 2014 ). Nigel P Smart and Frederik Vercauteren. 2014. Fully Homomorphic SIMD Operations. Designs, Codes and Cryptography (2014)."},{"key":"e_1_3_2_2_28_1","volume-title":"Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In Annual ACM Symposium on Theory of Computing (STOC). ACM, 77--82","author":"Smolensky Roman","year":"1987","unstructured":"Roman Smolensky . 1987 . Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In Annual ACM Symposium on Theory of Computing (STOC). ACM, 77--82 . Roman Smolensky. 1987. Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In Annual ACM Symposium on Theory of Computing (STOC). ACM, 77--82."},{"key":"e_1_3_2_2_29_1","volume-title":"Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy (S&P). IEEE, 44--55","author":"Song Dawn Xiaodong","year":"2000","unstructured":"Dawn Xiaodong Song , David Wagner , and Adrian Perrig . 2000 . Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy (S&P). IEEE, 44--55 . Dawn Xiaodong Song, David Wagner, and Adrian Perrig. 2000. Practical Techniques for Searches on Encrypted Data. In IEEE Symposium on Security and Privacy (S&P). IEEE, 44--55."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Haixu Tang Xiaoqian Jiang Xiaofeng Wang Shuang Wang Heidi Sofia Dov Fox Kristin Lauter Bradley Malin Amalio Telenti Li Xiong etal 2016. Protecting genomic data analytics in the cloud: state of the art and opportunities. BMC medical genomics (2016).  Haixu Tang Xiaoqian Jiang Xiaofeng Wang Shuang Wang Heidi Sofia Dov Fox Kristin Lauter Bradley Malin Amalio Telenti Li Xiong et al. 2016. Protecting genomic data analytics in the cloud: state of the art and opportunities. BMC medical genomics (2016).","DOI":"10.1186\/s12920-016-0224-3"},{"key":"e_1_3_2_2_31_1","volume-title":"Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 162--167","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986 . How to Generate and Exchange Secrets . In Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 162--167 . Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 162--167."},{"key":"e_1_3_2_2_32_1","volume-title":"Secure Pattern Matching Using Somewhat Homomorphic Encryption. In ACM Cloud Computing Security Workshop (CCSW). ACM, 65--76","author":"Yasuda Masaya","year":"2013","unstructured":"Masaya Yasuda , Takeshi Shimoyama , Jun Kogure , Kazuhiro Yokoyama , and Takeshi Koshiba . 2013 . Secure Pattern Matching Using Somewhat Homomorphic Encryption. In ACM Cloud Computing Security Workshop (CCSW). ACM, 65--76 . Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, and Takeshi Koshiba. 2013. Secure Pattern Matching Using Somewhat Homomorphic Encryption. In ACM Cloud Computing Security Workshop (CCSW). ACM, 65--76."}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:25Z","timestamp":1750199605000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":29,"alternative-id":["10.1145\/3372297.3417237","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417237","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}