{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:16Z","timestamp":1750220656197,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["IIS-1528041"],"award-info":[{"award-number":["IIS-1528041"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412035","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:03Z","timestamp":1603085463000},"page":"1345-1354","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Index Obfuscation for Oblivious Document Retrieval in a Trusted Execution Environment"],"prefix":"10.1145","author":[{"given":"Jinjin","family":"Shao","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara, Santa Barabra, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Ji","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barabra, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvin Oliver","family":"Glova","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barabra, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Qiao","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barabra, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barabra, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Sherwood","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barabra, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proceedings of the 2018 World Wide Web Conference. 1725--1734","author":"Agun Daniel","year":"2018","unstructured":"Daniel Agun , Jinjin Shao , Shiyu Ji , Stefano Tessaro , and Tao Yang . 2018 . Privacy and efficiency tradeoffs for multiword top k search with linear additive rank scoring . In Proceedings of the 2018 World Wide Web Conference. 1725--1734 . Daniel Agun, Jinjin Shao, Shiyu Ji, Stefano Tessaro, and Tao Yang. 2018. Privacy and efficiency tradeoffs for multiword top k search with linear additive rank scoring. In Proceedings of the 2018 World Wide Web Conference. 1725--1734."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:INRT.0000048490.99518.5c"},{"key":"e_1_3_2_2_3_1","volume-title":"11th USENIX Workshop on Offensive Technologies","author":"Brasser Ferdinand","year":"2017","unstructured":"Ferdinand Brasser , Urs M\u00fcller , Alexandra Dmitrienko , Kari Kostiainen , Srdjan Capkun , and Ahmad-Reza Sadeghi . 2017 . Software grand exposure: SGX cache attacks are practical . In 11th USENIX Workshop on Offensive Technologies , 2017. Ferdinand Brasser, Urs M\u00fcller, Alexandra Dmitrienko, Kari Kostiainen, Srdjan Capkun, and Ahmad-Reza Sadeghi. 2017. Software grand exposure: SGX cache attacks are practical. In 11th USENIX Workshop on Offensive Technologies, 2017."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.45"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"e_1_3_2_2_7_1","first-page":"23","article-title":"Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation","volume":"14","author":"Cash David","year":"2014","unstructured":"David Cash , Joseph Jaeger , Stanislaw Jarecki , Charanjit S Jutla , Hugo Krawczyk , Marcel-Catalin Rosu , and Michael Steiner . 2014 . Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation . In NDSS , Vol. 14. 23 -- 26 . David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit S Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. 2014. Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation. In NDSS, Vol. 14. 23--26.","journal-title":"NDSS"},{"key":"e_1_3_2_2_8_1","volume-title":"Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In CRYPTO","author":"Cash David","year":"2013","unstructured":"David Cash , Stanislaw Jarecki , Charanjit S. Jutla , Hugo Krawczyk , Marcel-Catalin Rosu , and Michael Steiner . 2013 . Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In CRYPTO 2013. 353--373. David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. 2013. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In CRYPTO 2013. 353--373."},{"key":"e_1_3_2_2_9_1","volume-title":"Efficient and effective spam filtering and re-ranking for large web datasets. Information retrieval","author":"Cormack Gordon V","year":"2011","unstructured":"Gordon V Cormack , Mark D Smucker , and Charles LA Clarke . 2011. Efficient and effective spam filtering and re-ranking for large web datasets. Information retrieval , Vol. 14 , 5 ( 2011 ), 441--465. Gordon V Cormack, Mark D Smucker, and Charles LA Clarke. 2011. Efficient and effective spam filtering and re-ranking for large web datasets. Information retrieval, Vol. 14, 5 (2011), 441--465."},{"key":"e_1_3_2_2_10_1","volume-title":"IACR Cryptology ePrint Archive","author":"Costan Victor","year":"2016","unstructured":"Victor Costan and Srinivas Devadas . 2016. Intel SGX Explained. IACR Cryptology ePrint Archive ( 2016 ), 1--118. Victor Costan and Srinivas Devadas. 2016. Intel SGX Explained. IACR Cryptology ePrint Archive (2016), 1--118."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2590701.2590705"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61176-1_22"},{"key":"e_1_3_2_2_15_1","volume-title":"Fully Homomorphic Encryption Using Ideal Lattices. STOC '09","author":"Gentry Craig","year":"2009","unstructured":"Craig Gentry . 2009 . Fully Homomorphic Encryption Using Ideal Lattices. STOC '09 . ACM, 169--178. Craig Gentry. 2009. Fully Homomorphic Encryption Using Ideal Lattices. STOC '09. ACM, 169--178."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0010"},{"key":"e_1_3_2_2_18_1","unstructured":"Haibo Hu Jianliang Xu Chushi Ren and Byron Choi. 2011. Processing private queries over untrusted data cloud through privacy homomorphism. In ICDE. 601--612.  Haibo Hu Jianliang Xu Chushi Ren and Byron Choi. 2011. Processing private queries over untrusted data cloud through privacy homomorphism. In ICDE. 601--612."},{"key":"e_1_3_2_2_19_1","volume-title":"Attack and Mitigation. In NDSS","author":"Islam Mohammad Saiful","year":"2012","unstructured":"Mohammad Saiful Islam , Mehmet Kuzu , and Murat Kantarcioglu . 2012 . Access Pattern disclosure on Searchable Encryption: Ramification , Attack and Mitigation. In NDSS 2012. Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation. In NDSS 2012."},{"key":"e_1_3_2_2_20_1","volume-title":"Privacy-aware Ranking with Tree Ensembles on the Cloud. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval. ACM, 315--324","author":"Ji Shiyu","year":"2018","unstructured":"Shiyu Ji , Jinjin Shao , Daniel Agun , and Tao Yang . 2018 . Privacy-aware Ranking with Tree Ensembles on the Cloud. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval. ACM, 315--324 . Shiyu Ji, Jinjin Shao, Daniel Agun, and Tao Yang. 2018. Privacy-aware Ranking with Tree Ensembles on the Cloud. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval. ACM, 315--324."},{"key":"e_1_3_2_2_21_1","volume-title":"Robertson","author":"Jones Karen","year":"2000","unstructured":"Karen Sp\"arck Jones , Steve Walker , and Stephen E . Robertson . 2000 . A probabilistic model of information retrieval: development and comparative experiments. In Information Processing and Management . 779--840. Karen Sp\"arck Jones, Steve Walker, and Stephen E. Robertson. 2000. A probabilistic model of information retrieval: development and comparative experiments. In Information Processing and Management. 779--840."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"e_1_3_2_2_24_1","volume-title":"Viewing morphology as an inference process. Artificial intelligence","author":"Krovetz Robert","year":"2000","unstructured":"Robert Krovetz . 2000. Viewing morphology as an inference process. Artificial intelligence , Vol. 118 , 1--2 ( 2000 ), 277--294. Robert Krovetz. 2000. Viewing morphology as an inference process. Artificial intelligence, Vol. 118, 1--2 (2000), 277--294."},{"key":"e_1_3_2_2_25_1","volume-title":"Search pattern leakage in searchable encryption: Attacks and new construction. nformation Sciences","author":"Liu Chang","year":"2014","unstructured":"Chang Liu , Liehuang Zhu , Mingzhong Wang , and Yu-An Tan . 2014. Search pattern leakage in searchable encryption: Attacks and new construction. nformation Sciences , Vol. 265 ( 2014 ), 176--188. Chang Liu, Liehuang Zhu, Mingzhong Wang, and Yu-An Tan. 2014. Search pattern leakage in searchable encryption: Attacks and new construction. nformation Sciences, Vol. 265 (2014), 176--188."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080780"},{"key":"e_1_3_2_2_27_1","volume-title":"Ferreira","author":"Masters Oliver","year":"2019","unstructured":"Oliver Masters , Hamish Hunt , Enrico Steffinlongo , Jack Crawford , Flavio Bergamaschi , Maria E. Dela Rosa , Caio C. Quini , Camila T. Alves , Feranda de Souza , and Deise G . Ferreira . 2019 . Towards a Homomorphic Machine Learning Big Data Pipeline for the Financial Services Sector. Cryptology ePrint Archive, Report 2019\/1113. (2019). Oliver Masters, Hamish Hunt, Enrico Steffinlongo, Jack Crawford, Flavio Bergamaschi, Maria E. Dela Rosa, Caio C. Quini, Camila T. Alves, Feranda de Souza, and Deise G. Ferreira. 2019. Towards a Homomorphic Machine Learning Big Data Pipeline for the Financial Services Sector. Cryptology ePrint Archive, Report 2019\/1113. (2019)."},{"volume-title":"SIGIR (SIGIR '06)","author":"Matveeva Irina","key":"e_1_3_2_2_28_1","unstructured":"Irina Matveeva , Chris Burges , Timo Burkard , Andy Laucius , and Leon Wong . 2006. High Accuracy Retrieval with Multiple Nested Ranker . In SIGIR (SIGIR '06) . Association for Computing Machinery , New York, NY, USA , 437--444. Irina Matveeva, Chris Burges, Timo Burkard, Andy Laucius, and Leon Wong. 2006. High Accuracy Retrieval with Multiple Nested Ranker. In SIGIR (SIGIR '06). Association for Computing Machinery, New York, NY, USA, 437--444."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00045"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.47"},{"key":"e_1_3_2_2_31_1","volume-title":"Proc. of 2016 USENIX Security Symp. 619--636","author":"Ohrimenko Olga","year":"2016","unstructured":"Olga Ohrimenko , Felix Schuster , C\u00e9dric Fournet , Aastha Mehta , Sebastian Nowozin , Kapil Vaswani , and Manuel Costa . 2016 . Oblivious multi-party machine learning on trusted processors . In Proc. of 2016 USENIX Security Symp. 619--636 . Olga Ohrimenko, Felix Schuster, C\u00e9dric Fournet, Aastha Mehta, Sebastian Nowozin, Kapil Vaswani, and Manuel Costa. 2016. Oblivious multi-party machine learning on trusted processors. In Proc. of 2016 USENIX Security Symp. 619--636."},{"key":"e_1_3_2_2_32_1","volume-title":"Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT '99","author":"Paillier Pascal","year":"1999","unstructured":"Pascal Paillier . 1999 . Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT '99 . 223--238. Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT '99. 223--238."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331189"},{"key":"e_1_3_2_2_34_1","volume-title":"Practical Techniques for Searches on Encrypted Data (SP '00)","author":"Song Dawn Xiaodong","year":"2000","unstructured":"Dawn Xiaodong Song , David Wagner , and Adrian Perrig . 2000 . Practical Techniques for Searches on Encrypted Data (SP '00) . IEEE Computer Society. Dawn Xiaodong Song, David Wagner, and Adrian Perrig. 2000. Practical Techniques for Searches on Encrypted Data (SP '00). IEEE Computer Society."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177872"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277774"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.282"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485838"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2800684"},{"key":"e_1_3_2_2_40_1","volume-title":"SIGIR (SIGIR '11)","author":"Wang Lidan","year":"2009","unstructured":"Lidan Wang , Jimmy Lin , and Donald Metzler . 2011. A Cascade Ranking Model for Efficient Ranked Retrieval . In SIGIR (SIGIR '11) . Association for Computing Machinery , New York, NY, USA , 105--114. https:\/\/doi.org\/10.1145\/ 2009 916.2009934 10.1145\/2009916.2009934 Lidan Wang, Jimmy Lin, and Donald Metzler. 2011. A Cascade Ranking Model for Efficient Ranked Retrieval. In SIGIR (SIGIR '11). Association for Computing Machinery, New York, NY, USA, 105--114. https:\/\/doi.org\/10.1145\/2009916.2009934"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2401003"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367550"},{"key":"e_1_3_2_2_43_1","volume-title":"Joseph E Gonzalez, and Ion Stoica.","author":"Zheng Wenting","year":"2017","unstructured":"Wenting Zheng , Ankur Dave , Jethro G Beekman , Raluca Ada Popa , Joseph E Gonzalez, and Ion Stoica. 2017 . Opaque : An oblivious and encrypted distributed analytics platform. In NSDI 17. 283--298. Wenting Zheng, Ankur Dave, Jethro G Beekman, Raluca Ada Popa, Joseph E Gonzalez, and Ion Stoica. 2017. Opaque: An oblivious and encrypted distributed analytics platform. In NSDI 17. 283--298."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Ireland","acronym":"CIKM '20"},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412035","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:29Z","timestamp":1750197749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":43,"alternative-id":["10.1145\/3340531.3412035","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412035","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}