{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:34:56Z","timestamp":1768073696651,"version":"3.49.0"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:p>\n            <jats:italic toggle=\"yes\">Ego-centric<\/jats:italic>\n            queries, focusing on a target vertex and its direct neighbors, are essential for various applications. Enabling such queries on graphs owned by mutually distrustful data providers without breaching privacy holds promise for more comprehensive results.\n          <\/jats:p>\n          <jats:p>\n            In this paper, we propose GORAM, a graph-oriented data structure that enables efficient ego-centric queries on federated graphs with strong privacy guarantees. GORAM leverages\n            <jats:italic toggle=\"yes\">secure multiparty computation (MPC)<\/jats:italic>\n            and ensures that no information about the graphs or the querying keys is exposed during the process. For practical performance, GORAM partitions the federated graph and constructs an\n            <jats:italic toggle=\"yes\">Oblivious RAM (ORAM<\/jats:italic>\n            )-inspired index atop these partitions. This design enables each ego-centric query to process only a single partition, which can be accessed fast and securely.\n          <\/jats:p>\n          <jats:p>Utilizing GORAM, we develop a prototype querying engine on a real-world MPC framework. We then conduct a comprehensive evaluation using five commonly used queries similar to the LinkBench workload description [11] on both synthetic and real-world graphs. Our evaluation shows that all five queries can be completed in just 58.1 milliseconds to 35.7 seconds, even on graphs with up to 41.6 million vertices and 1.4 billion edges. To the best of our knowledge, this represents the first instance of processing billion-scale graphs with practical performance on MPC.<\/jats:p>","DOI":"10.14778\/3748191.3748218","type":"journal-article","created":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:50:16Z","timestamp":1756993816000},"page":"3601-3614","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["GORAM: Graph-Oriented ORAM for Efficient Ego-Centric Queries on Federated Graphs"],"prefix":"10.14778","volume":"18","author":[{"given":"Xiaoyu","family":"Fan","sequence":"first","affiliation":[{"name":"Tsinghua University and Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Chen","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiping","family":"Yu","sequence":"additional","affiliation":[{"name":"Tsinghua University and Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunyi","family":"Chen","sequence":"additional","affiliation":[{"name":"Tsinghua University and Ant Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanchen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University and Shanghai Qi, Zhi Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Xu","sequence":"additional","affiliation":[{"name":"Tsinghua University and Shanghai Qi, Zhi Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,9,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2006. https:\/\/igraph.org\/python\/api\/0.9.11\/igraph._igraph.GraphBase.html#K_Regular"},{"key":"e_1_2_1_2_1","unstructured":"2006. https:\/\/igraph.org\/python\/api\/0.9.11\/igraph.Graph.html#Random_Bipartite"},{"key":"e_1_2_1_3_1","unstructured":"2006. https:\/\/igraph.org\/python\/api\/0.9.11\/igraph._igraph.GraphBase.html#Erdos_Renyi"},{"key":"e_1_2_1_4_1","unstructured":"2006. https:\/\/igraph.org\/python\/api\/0.9.11\/igraph._igraph.GraphBase.html#Barabasi"},{"key":"e_1_2_1_5_1","unstructured":"2006. https:\/\/igraph.org\/python\/api\/0.9.11\/igraph._igraph.GraphBase.html#_GRG"},{"key":"e_1_2_1_6_1","unstructured":"2009. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters.. In Internet Mathematics."},{"key":"e_1_2_1_7_1","volume-title":"Ciphers for MPC and FHE. In Advances in Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCYRPT).","author":"Albrecht Martin R","year":"2015","unstructured":"Martin R Albrecht, Christian Rechberger, Thomas Schneider, Tyge Tiessen, and Michael Zohner. 2015. Ciphers for MPC and FHE. In Advances in Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCYRPT)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Nouf Aljuaid Alexei Lisitsa and Sven Schewe. 2023. Secure Joint Querying Over Federated Graph Databases Utilizing SMPC Protocols.. In ICISSP.","DOI":"10.5220\/0011798900003405"},{"key":"e_1_2_1_9_1","volume-title":"International Conference on Data Science, Technology and Applications (DATA).","author":"Aljuaid Nouf","year":"2024","unstructured":"Nouf Aljuaid, Alexei Lisitsa, and Sven Schewe. 2024. Efficient and Secure Multiparty Querying over Federated Graph Databases. In International Conference on Data Science, Technology and Applications (DATA)."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS).","author":"Araki Toshinori","year":"2021","unstructured":"Toshinori Araki, Jun Furukawa, Kazuma Ohara, Benny Pinkas, Hanan Rosemarin, and Hikaru Tsuchida. 2021. Secure Graph Analysis at Scale. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS)."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the International Conference on Management of Data (SIGMOD).","author":"Armstrong Timothy G","year":"2013","unstructured":"Timothy G Armstrong, Vamsi Ponnekanti, Dhruba Borthakur, and Mark Callaghan. 2013. LinkBench: a Database Benchmark based on the Facebook Social Graph. In Proceedings of the International Conference on Management of Data (SIGMOD)."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS).","author":"Asharov Gilad","year":"2023","unstructured":"Gilad Asharov, Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas, and Junichi Tomida. 2023. Secure Statistical Analysis on Multiple Datasets: Join and Group-By. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS)."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the VLDB Endowment.","author":"Bater Johes","year":"2017","unstructured":"Johes Bater, Gregory Elliott, Craig Eggen, Satyender Goel, Abel N Kho, and Jennie Rogers. 2017. SMCQL: Secure Query Processing for Private Data Networks.. In Proceedings of the VLDB Endowment."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the VLDB Endowment.","author":"Bater Johes","year":"2018","unstructured":"Johes Bater, Xi He, William Ehrich, Ashwin Machanavajjhala, and Jennie Rogers. 2018. Shrinkwrap: efficient SQL query processing in differentially private data federations. In Proceedings of the VLDB Endowment."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the VLDB Endowment.","author":"Bater Johes","year":"2020","unstructured":"Johes Bater, Yongjoo Park, Xi He, Xiao Wang, and Jennie Rogers. 2020. SAQE: Practical Privacy-preserving Approximate Query Processing for Data Federations. In Proceedings of the VLDB Endowment."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the ACM Asia Conference on Computer and Communications Security (ASIA-CCS).","author":"Blanton Marina","year":"2013","unstructured":"Marina Blanton, Aaron Steele, and Mehrdad Alisagari. 2013. Data-oblivious Graph Algorithms for Secure Computation and Outsourcing. In Proceedings of the ACM Asia Conference on Computer and Communications Security (ASIA-CCS)."},{"key":"e_1_2_1_17_1","volume-title":"Sharemind: A Framework for Fast Privacy-preserving Computations. In European Symposium on Research in Computer Security (ESORICS). Springer.","author":"Bogdanov Dan","year":"2008","unstructured":"Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A Framework for Fast Privacy-preserving Computations. In European Symposium on Research in Computer Security (ESORICS). Springer."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_19_1","volume-title":"USENIX Annual Technical Conference (ATC).","author":"Bronson Nathan","year":"2013","unstructured":"Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Hui Ding, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, Harry Li, et al. 2013. TAO:Facebook's Distributed Data Store for The Social Graph. In USENIX Annual Technical Conference (ATC)."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Paul Bunn Jonathan Katz Eyal Kushilevitz and Rafail Ostrovsky. 2020. Efficient 3-party Distributed ORAM. In Security and Cryptography for Networks (SCN).","DOI":"10.1007\/978-3-030-57990-6_11"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti. 2000. Security and Composition of Multiparty Cryptographic Protocols. In Journal of CRYPTOLOGY.","DOI":"10.1007\/s001459910006"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the VLDB Endowment.","author":"Chamani Javad Ghareh","year":"2024","unstructured":"Javad Ghareh Chamani, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou, and Rasool Jalili. 2024. GraphOS: Towards Oblivious Graph Processing. In Proceedings of the VLDB Endowment."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the International Conference on Management of Data (SIGMOD).","author":"Chang Zhao","year":"2022","unstructured":"Zhao Chang, Dong Xie, Sheng Wang, and Feifei Li. 2022. Towards Practical Oblivious Join. In Proceedings of the International Conference on Management of Data (SIGMOD)."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the International Conference on Management of Data (SIGMOD).","author":"Chang Zhao","year":"2016","unstructured":"Zhao Chang, Lei Zou, and Feifei Li. 2016. Privacy Preserving Subgraph Matching on Large Graphs in Cloud. In Proceedings of the International Conference on Management of Data (SIGMOD)."},{"key":"e_1_2_1_25_1","volume-title":"Structured Encryption and Controlled Disclosure. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT).","author":"Chase Melissa","year":"2010","unstructured":"Melissa Chase and Seny Kamara. 2010. Structured Encryption and Controlled Disclosure. In International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT)."},{"key":"e_1_2_1_26_1","unstructured":"Fan Chung. 2010. Graph Theory in the Information Age. In Notices of the AMS."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS).","author":"Doerner Jack","year":"2017","unstructured":"Jack Doerner and Abhi Shelat. 2017. Scaling ORAM for Secure Computation. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS)."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the USENIX Conference on Security Symposium (USENIX Security).","author":"Falk Brett","year":"2023","unstructured":"Brett Falk, Rafail Ostrovsky, Matan Shtepel, and Jacob Zhang. 2023. GigaDORAM: breaking the billion address barrier. In Proceedings of the USENIX Conference on Security Symposium (USENIX Security)."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS).","author":"Falzon Francesca","year":"2024","unstructured":"Francesca Falzon, Esha Ghosh, Kenneth G Paterson, and Roberto Tamassia. 2024. PathGES: An Efficient and Secure Graph Encryption Scheme for Shortest Path Queries. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS)."},{"key":"e_1_2_1_31_1","volume-title":"GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs (Technical Report). arXiv preprint arXiv:2410.02234","author":"Fan Xiaoyu","year":"2024","unstructured":"Xiaoyu Fan, Kun Chen, Jiping Yu, Xiaowei Zhu, Yunyi Chen, Huanchen Zhang, and Wei Xu. 2024. GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs (Technical Report). arXiv preprint arXiv:2410.02234 (2024). https:\/\/arxiv.org\/pdf\/2410.02234"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich and Rafail Ostrovsky. 1996. Software Protection and Simulation on Oblivious RAMs. In Journal of the ACM (JACM).","DOI":"10.1145\/233551.233553"},{"key":"e_1_2_1_33_1","unstructured":"Tam\u00e1s Nepusz G\u00e1bor Cs\u00e1rdi. 2006. The igraph Software Package for Complex Network Research. In Inter Journal Complex Systems."},{"key":"e_1_2_1_34_1","volume-title":"IEEE International Conference on Data Engineering (ICDE).","author":"Han Feng","year":"2022","unstructured":"Feng Han, Lan Zhang, Hanwen Feng, Weiran Liu, and Xiangyang Li. 2022. Scape: Scalable collaborative analytics system on private database with malicious security. In IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the USENIX Conference on Security Symposium (USENIX Security).","author":"Imola Jacob","year":"2021","unstructured":"Jacob Imola, Takao Murakami, and Kamalika Chaudhuri. 2021. Locally Differentially Private Analysis of Graph Statistics. In Proceedings of the USENIX Conference on Security Symposium (USENIX Security)."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the VLDB Endowment.","author":"Jindal Alekh","year":"2014","unstructured":"Alekh Jindal, Praynaa Rawlani, Eugene Wu, Samuel Madden, Amol Deshpande, and Mike Stonebraker. 2014. Vertexica: Your Relational Friend for Graph Analytics!. In Proceedings of the VLDB Endowment."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402749"},{"key":"e_1_2_1_38_1","unstructured":"Donald E Knuth. 1973. The Art of Computer Programming VOL. 3: Searching and Sorting (The Odd Even Mergesort Network Section). In Reading MA: Addison-Wisley."},{"key":"e_1_2_1_39_1","volume-title":"Graphiti: Secure Graph Computation Made More Scalable. In ACM SIGSAC Conference on Computer and Communications Security (CCS).","author":"Koti Nishat","year":"2024","unstructured":"Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, and Bhavish Raj Gopal. 2024. Graphiti: Secure Graph Computation Made More Scalable. In ACM SIGSAC Conference on Computer and Communications Security (CCS)."},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the ACM Asia Conference on Computer and Communications Security (ASIA-CCS).","author":"Lai Shangqi","year":"2019","unstructured":"Shangqi Lai, Xingliang Yuan, Shi-Feng Sun, Joseph K Liu, Yuhong Liu, and Dongxi Liu. 2019. GraphSE2: An Encrypted Graph Database for Privacy-preserving Social Search. In Proceedings of the ACM Asia Conference on Computer and Communications Security (ASIA-CCS)."},{"key":"e_1_2_1_41_1","volume-title":"SECRECY: Secure Collaborative Analytics in Untrusted Clouds. In USENIX Symposium on Networked Systems Design and Implementation (NSDI).","author":"Liagouris John","year":"2023","unstructured":"John Liagouris, Vasiliki Kalavri, Muhammad Faisal, and Mayank Varia. 2023. SECRECY: Secure Collaborative Analytics in Untrusted Clouds. In USENIX Symposium on Networked Systems Design and Implementation (NSDI)."},{"key":"e_1_2_1_42_1","volume-title":"Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques. In Advances in Annual International Cryptology Conference (CRYPTO).","author":"Liu Fukang","year":"2021","unstructured":"Fukang Liu, Takanori Isobe, and Willi Meier. 2021. Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques. In Advances in Annual International Cryptology Conference (CRYPTO)."},{"key":"e_1_2_1_43_1","volume-title":"Federated Graph Analytics with Differential Privacy. In International Workshop on Federated Learning for Distributed Data Mining.","author":"Liu Shang","year":"2023","unstructured":"Shang Liu, Yang Cao, Takao Murakami, Weiran Liu, Seng Pei Liew, Tsubasa Takahashi, Jinfei Liu, and Masatoshi Yoshikawa. 2023. Federated Graph Analytics with Differential Privacy. In International Workshop on Federated Learning for Distributed Data Mining."},{"key":"e_1_2_1_44_1","unstructured":"Xiaoxuan Lou Tianwei Zhang Jun Jiang and Yinqian Zhang. 2021. A Survey of Microarchitectural Side-channel Vulnerabilities Attacks and Defenses in Cryptography. In ACM Computing Surveys (CSUR)."},{"key":"e_1_2_1_45_1","volume-title":"Distributed Oblivious RAM for Secure Two-party Computation. In Theory of Cryptography Conference (TCC).","author":"Lu Steve","year":"2013","unstructured":"Steve Lu and Rafail Ostrovsky. 2013. Distributed Oblivious RAM for Secure Two-party Computation. In Theory of Cryptography Conference (TCC)."},{"key":"e_1_2_1_46_1","unstructured":"Nav Mathur. 2021. Graph Technology for Financial Services. Neo4j. https:\/\/go.neo4j.com\/rs\/710-RRC-335\/images\/Neo4j-in-Financial%20Services-white-paper.pdf (White Paper)."},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS).","author":"Mazloom Sahar","year":"2018","unstructured":"Sahar Mazloom and S Dov Gordon. 2018. Secure Computation with Differentially Private Access Patterns. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS)."},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the USENIX Conference on Security Symposium (USENIX Security).","author":"Mazloom Sahar","year":"2020","unstructured":"Sahar Mazloom, Phi Hung Le, Samuel Ranellucci, and S Dov Gordon. 2020. Secure Parallel Computation on National Scale Volumes of Data. In Proceedings of the USENIX Conference on Security Symposium (USENIX Security)."},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS).","author":"Meng Xianrui","year":"2015","unstructured":"Xianrui Meng, Seny Kamara, Kobbi Nissim, and George Kollios. 2015. GRECS: Graph Encryption for Approximate Shortest Distance Queries. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS)."},{"key":"e_1_2_1_50_1","volume-title":"ACM SIGSAC conference on computer and communications security (CCS).","author":"Mohassel Payman","year":"2018","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In ACM SIGSAC conference on computer and communications security (CCS)."},{"key":"e_1_2_1_51_1","volume-title":"Computers & Security","author":"Mu\u00f1oz Antonio","unstructured":"Antonio Mu\u00f1oz, Ruben Rios, Rodrigo Rom\u00e1n, and Javier L\u00f3pez. 2023. A survey on the (in) security of trusted execution environments. In Computers & Security. Elsevier."},{"key":"e_1_2_1_52_1","volume-title":"GraphSC: Parallel Secure Computation Made Easy. In IEEE Symposium on Security and Privacy (S&P).","author":"Nayak Kartik","year":"2015","unstructured":"Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi. 2015. GraphSC: Parallel Secure Computation Made Easy. In IEEE Symposium on Security and Privacy (S&P)."},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Shen Noether Adam Mackenzie et al. 2016. Ring Confidential Transactions. Ledger (2016).","DOI":"10.5195\/ledger.2016.34"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the VLDB Endowment.","author":"Qiu Xiafei","year":"2018","unstructured":"Xiafei Qiu, Wubin Cen, Zhengping Qian, You Peng, Ying Zhang, Xuemin Lin, and Jingren Zhou. 2018. Real-time Constrained Cycle Detection in Large Dynamic Graphs. In Proceedings of the VLDB Endowment."},{"key":"e_1_2_1_55_1","volume-title":"Differentially-private Two-party Egocentric Betweenness Centrality. In IEEE INFOCOM Conference on Computer Communications.","author":"Roohi Leyla","year":"2019","unstructured":"Leyla Roohi, Benjamin IP Rubinstein, and Vanessa Teague. 2019. Differentially-private Two-party Egocentric Betweenness Centrality. In IEEE INFOCOM Conference on Computer Communications."},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the ACM SIGOPS Symposium on Operating Systems Principles (SOSP).","author":"Roth Edo","year":"2021","unstructured":"Edo Roth, Karan Newatia, Yiping Ma, Ke Zhong, Sebastian Angel, and Andreas Haeberlen. 2021. Mycelium: Large-scale distributed graph queries with differential privacy. In Proceedings of the ACM SIGOPS Symposium on Operating Systems Principles (SOSP)."},{"key":"e_1_2_1_57_1","volume-title":"Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas.","author":"Stefanov Emil","year":"2018","unstructured":"Emil Stefanov, Marten van Dijk, Elaine Shi, T-H Hubert Chan, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. 2018. Path ORAM: an extremely simple oblivious RAM protocol. In Journal of the ACM (JACM)."},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the USENIX Conference on Security Symposium (USENIX Security).","author":"Vadapalli Adithya","year":"2023","unstructured":"Adithya Vadapalli, Ryan Henry, and Ian Goldberg. 2023. DuORAM: A Bandwidth-Efficient Distributed ORAM for 2-and 3-Party Computation. In Proceedings of the USENIX Conference on Security Symposium (USENIX Security)."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of The European Conference on Computer Systems (EuroSys).","author":"Volgushev Nikolaj","year":"2019","unstructured":"Nikolaj Volgushev, Malte Schwarzkopf, Ben Getchell, Mayank Varia, Andrei Lapets, and Azer Bestavros. 2019. Conclave: Secure Multi-party Computation on Big Data. In Proceedings of The European Conference on Computer Systems (EuroSys)."},{"key":"e_1_2_1_60_1","volume-title":"GraphGuard: Private Time-Constrained Pattern Detection Over Streaming Graphs in the Cloud. In USENIX Security Symposium (USENIX Security).","author":"Wang Songlei","year":"2024","unstructured":"Songlei Wang, Yifeng Zheng, and Xiaohua Jia. 2024. GraphGuard: Private Time-Constrained Pattern Detection Over Streaming Graphs in the Cloud. In USENIX Security Symposium (USENIX Security)."},{"key":"e_1_2_1_61_1","volume-title":"MAGO: Maliciously Secure Subgraph Counting on Decentralized Social Graphs","author":"Wang Songlei","year":"2023","unstructured":"Songlei Wang, Yifeng Zheng, Xiaohua Jia, Qian Wang, and Cong Wang. 2023. MAGO: Maliciously Secure Subgraph Counting on Decentralized Social Graphs. In IEEE Transactions on Information Forensics and Security (TIFS)."},{"key":"e_1_2_1_62_1","volume-title":"PeGraph: A System for Privacy-Preserving and Efficient Search Over Encrypted Social Graphs","author":"Wang Songlei","unstructured":"Songlei Wang, Yifeng Zheng, Xiaohua Jia, and Xun Yi. 2022. PeGraph: A System for Privacy-Preserving and Efficient Search Over Encrypted Social Graphs. In IEEE Transactions on Information Forensics and Security (TIFS)."},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the International Conference on Management of Data (SIGMOD).","author":"Xu Lyu","year":"2023","unstructured":"Lyu Xu, Byron Choi, Yun Peng, Jianliang Xu, and Sourav S Bhowmick. 2023. A framework for privacy preserving localized graph pattern query processing. In Proceedings of the International Conference on Management of Data (SIGMOD)."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Juncheng Yang Yao Yue and KV Rashmi. 2021. A large-scale analysis of hundreds of in-memory key-value cache clusters at twitter. In ACM Transactions on Storage (TOS).","DOI":"10.1145\/3468521"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_2_1_67_1","volume-title":"Revisiting Square-root ORAM: Efficient Random Access in Multi-party Computation. In IEEE Symposium on Security and Privacy (S&P).","author":"Zahur Samee","year":"2016","unstructured":"Samee Zahur, Xiao Wang, Mariana Raykova, Adri\u00e0 Gasc\u00f3n, Jack Doerner, David Evans, and Jonathan Katz. 2016. Revisiting Square-root ORAM: Efficient Random Access in Multi-party Computation. In IEEE Symposium on Security and Privacy (S&P)."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3748191.3748218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:50:56Z","timestamp":1756993856000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3748191.3748218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":67,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10.14778\/3748191.3748218"],"URL":"https:\/\/doi.org\/10.14778\/3748191.3748218","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2025,6]]},"assertion":[{"value":"2025-09-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}