{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:19:48Z","timestamp":1783610388040,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,2]]},"DOI":"10.1145\/3321705.3329803","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"41-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["GraphSE\u00b2"],"prefix":"10.1145","author":[{"given":"Shangqi","family":"Lai","sequence":"first","affiliation":[{"name":"Monash University\/Data61, CSIRO, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingliang","family":"Yuan","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[{"name":"Monash University\/Data61, CSIRO, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph K.","family":"Liu","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhong","family":"Liu","sequence":"additional","affiliation":[{"name":"Santa Clara University, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongxi","family":"Liu","sequence":"additional","affiliation":[{"name":"Data61, CSIRO, Syndey, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache. 2015. Hadoop. https:\/\/hadoop.apache.org{online}. (2015).  Apache. 2015. Hadoop. https:\/\/hadoop.apache.org{online}. (2015)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_3_1","unstructured":"AWS. 2018a. AWS Case Study: Airbnb . https:\/\/aws.amazon.com\/solutions\/case-studies\/airbnb\/{online}. (2018).  AWS. 2018a. AWS Case Study: Airbnb . https:\/\/aws.amazon.com\/solutions\/case-studies\/airbnb\/{online}. (2018)."},{"key":"e_1_3_2_1_4_1","unstructured":"AWS. 2018b. AWS Case Study: PIXNET . https:\/\/aws.amazon.com\/cn\/solutions\/case-studies\/pixnet\/{online}. (2018).  AWS. 2018b. AWS Case Study: PIXNET . https:\/\/aws.amazon.com\/cn\/solutions\/case-studies\/pixnet\/{online}. (2018)."},{"key":"e_1_3_2_1_5_1","unstructured":"AWS. 2018c. AWS Outposts: Run AWS Infrastructure On-Premises for A Truly Consistent Hybrid Experience . https:\/\/aws.amazon.com\/outposts\/{online}. (2018).  AWS. 2018c. AWS Outposts: Run AWS Infrastructure On-Premises for A Truly Consistent Hybrid Experience . https:\/\/aws.amazon.com\/outposts\/{online}. (2018)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"F. Baldimtsi and O. Ohrimenko. 2015. Sorting and Searching Behind the Curtain. In FC'15 .  F. Baldimtsi and O. Ohrimenko. 2015. Sorting and Searching Behind the Curtain. In FC'15 .","DOI":"10.1007\/978-3-662-47854-7_8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_8_1","volume-title":"CRYPTO'91 .","author":"Beaver D.","year":"1991","unstructured":"D. Beaver . 1991 . Efficient Multiparty Protocols using Circuit Randomization . In CRYPTO'91 . D. Beaver. 1991. Efficient Multiparty Protocols using Circuit Randomization. In CRYPTO'91 ."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484341"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133980"},{"key":"e_1_3_2_1_14_1","unstructured":"J.S. Breese D. Heckerman and C. Kadie. 1998. Empirical Analysis of Predictive Algorithms for Collaborative Filtering. In UAI'98 .   J.S. Breese D. Heckerman and C. Kadie. 1998. Empirical Analysis of Predictive Algorithms for Collaborative Filtering. In UAI'98 ."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.84"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2011.5983948"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"D. Cash S. Jarecki C.S. Jutla H. Krawczyk M-C. Rosu and M. Steiner. 2013. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In CRYPTO'13 .  D. Cash S. Jarecki C.S. Jutla H. Krawczyk M-C. Rosu and M. Steiner. 2013. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In CRYPTO'13 .","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882956"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"M. Chase and S. Kamara. 2010. Structured Encryption and Controlled Disclosure . In AISACRYPT'10 .  M. Chase and S. Kamara. 2010. Structured Encryption and Controlled Disclosure . In AISACRYPT'10 .","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"e_1_3_2_1_21_1","volume-title":"Nxgraph: An Efficient Graph Processing System on A Single Machine","author":"Chi Y.","year":"2016","unstructured":"Y. Chi , G. Dai , Y. Wang , G. Sun , G. Li , and H. Yang . 2016 . Nxgraph: An Efficient Graph Processing System on A Single Machine . In IEEE ICDE '16 . Y. Chi, G. Dai, Y. Wang, G. Sun, G. Li, and H. Yang. 2016. Nxgraph: An Efficient Graph Processing System on A Single Machine. In IEEE ICDE'16 ."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536239"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2590701.2590705"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"D. Demmler T. Schneider and M. Zohner. 2015. ABY-A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS'15 .  D. Demmler T. Schneider and M. Zohner. 2015. ABY-A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS'15 .","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_25_1","volume-title":"Dozens of Technologies . https:\/\/instagram-engineering.com\/what-powers-instagram-hundreds-of-instances-dozens-of-technologies\u00adadf2e22da2ad{online}.","author":"Engineering Instagram","year":"2018","unstructured":"Instagram Engineering . 2018. What Powers Instagram: Hundreds of Instances , Dozens of Technologies . https:\/\/instagram-engineering.com\/what-powers-instagram-hundreds-of-instances-dozens-of-technologies\u00adadf2e22da2ad{online}. ( 2018 ). Instagram Engineering. 2018. What Powers Instagram: Hundreds of Instances, Dozens of Technologies . https:\/\/instagram-engineering.com\/what-powers-instagram-hundreds-of-instances-dozens-of-technologies\u00adadf2e22da2ad{online}. (2018)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118748.3118939"},{"key":"e_1_3_2_1_27_1","unstructured":"Information is Beautiful. 2018. World's Biggest Data Breaches . http:\/\/www.informationisbeautiful.net\/visualizations\/worlds-biggest-data-breaches-hacks\/{online}. (2018).  Information is Beautiful. 2018. World's Biggest Data Breaches . http:\/\/www.informationisbeautiful.net\/visualizations\/worlds-biggest-data-breaches-hacks\/{online}. (2018)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"S. Kamara and T. Moataz. 2017. Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity. In EUROCRYPT'17 .  S. Kamara and T. Moataz. 2017. Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity. In EUROCRYPT'17 .","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"S. Kamara T. Moataz and O. Ohrimenko. 2018. Structured Encryption and Leakage Suppression . In CRYPTO'18 .  S. Kamara T. Moataz and O. Ohrimenko. 2018. Structured Encryption and Leakage Suppression . In CRYPTO'18 .","DOI":"10.1007\/978-3-319-96884-1_12"},{"key":"e_1_3_2_1_30_1","unstructured":"S. Kamara P. Mohassel and M. Raykova. 2011. Outsourcing Multi-Party Computation . Cryptology ePrint Archive Report 2011\/272 . (2011).  S. Kamara P. Mohassel and M. Raykova. 2011. Outsourcing Multi-Party Computation . Cryptology ePrint Archive Report 2011\/272 . (2011)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978386"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"E.M. Kornaropoulos C. Papamanthou and R. Tamassia. 2019. Data Recovery on Encrypted Databases with K-Nearest Neighbor Query Leakage. In IEEE S&P'19 .  E.M. Kornaropoulos C. Papamanthou and R. Tamassia. 2019. Data Recovery on Encrypted Databases with K-Nearest Neighbor Query Leakage. In IEEE S&P'19 .","DOI":"10.1109\/SP.2019.00015"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243753"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321705.3329803"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2587242"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2014.107"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2462840"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813672"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"P. Mohassel and Y. Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In IEEE S&P'17 .  P. Mohassel and Y. Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In IEEE S&P'17 .","DOI":"10.1109\/SP.2017.12"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813651"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.30"},{"key":"e_1_3_2_1_45_1","unstructured":"A. Nikitin. 2017. Bloom Filter Scala . https:\/\/alexandrnikitin.github.io\/blog\/bloom-filter-for-scala\/{online}. (2017).  A. Nikitin. 2017. Bloom Filter Scala . https:\/\/alexandrnikitin.github.io\/blog\/bloom-filter-for-scala\/{online}. (2017)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516751"},{"key":"e_1_3_2_1_47_1","volume-title":"et almbox","author":"Papadimitriou A.","year":"2016","unstructured":"A. Papadimitriou , R. Bhagwan , N. Chandran , R. Ramjee , A. Haeberlen , H. Singh , et almbox . 2016 . Big Data Analytics over Encrypted Datasets with Seabed. In USENIX OSDI '16 . A. Papadimitriou, R. Bhagwan, N. Chandran, R. Ramjee, A. Haeberlen, H. Singh, et almbox. 2016. Big Data Analytics over Encrypted Datasets with Seabed. In USENIX OSDI'16 ."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.30"},{"key":"e_1_3_2_1_49_1","volume-title":"Arx: A Strongly Encrypted Database System . Cryptology ePrint Archive, Report 2016\/591.","author":"Poddar R.","year":"2016","unstructured":"R. Poddar , T. Boelter , and R.A. Popa . 2016 . Arx: A Strongly Encrypted Database System . Cryptology ePrint Archive, Report 2016\/591. (2016). R. Poddar, T. Boelter, and R.A. Popa. 2016. Arx: A Strongly Encrypted Database System . Cryptology ePrint Archive, Report 2016\/591. (2016)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_3_2_1_51_1","unstructured":"P. Pullonen D. Bogdanov and T. Schneider. 2012. The Design and Implementation of A Two-Party Protocol Suite for Sharemind 3 . http:\/\/tubiblio.ulb.tu-darmstadt.de\/61259\/{online}. (2012).  P. Pullonen D. Bogdanov and T. Schneider. 2012. The Design and Implementation of A Two-Party Protocol Suite for Sharemind 3 . http:\/\/tubiblio.ulb.tu-darmstadt.de\/61259\/{online}. (2012)."},{"key":"e_1_3_2_1_52_1","unstructured":"Redis Labs. 2017. Redis. https:\/\/redis.io{online}. (2017).  Redis Labs. 2017. Redis. https:\/\/redis.io{online}. (2017)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2012.14"},{"key":"e_1_3_2_1_54_1","unstructured":"S. Sharma J. Powers and K. Chen. 2018. PrivateGraph: Privacy-Preserving Spectral Analysis of Encrypted Graphs in the Cloud . IEEE Transactions on Knowledge and Data Engineering (2018).  S. Sharma J. Powers and K. Chen. 2018. PrivateGraph: Privacy-Preserving Spectral Analysis of Encrypted Graphs in the Cloud . IEEE Transactions on Knowledge and Data Engineering (2018)."},{"key":"e_1_3_2_1_55_1","volume-title":"Facebook White Paper","volume":"5","author":"Slee M.","year":"2007","unstructured":"M. Slee , A. Agarwal , and M. Kwiatkowski . 2007. Thrift: Scalable Cross-Language Services Implementation . Facebook White Paper , Vol. 5 , 8 ( 2007 ). M. Slee, A. Agarwal, and M. Kwiatkowski. 2007. Thrift: Scalable Cross-Language Services Implementation . Facebook White Paper, Vol. 5, 8 (2007)."},{"key":"e_1_3_2_1_56_1","volume-title":"\u201cSearch Plus Your World","author":"Sullivan D.","year":"2012","unstructured":"D. Sullivan . 2012. Google's Results Get More Personal With \u201cSearch Plus Your World \u201d . https:\/\/searchengineland.com\/googles-results-get-more-personal-with-search-plus-your-world-107285{online}. ( 2012 ). D. Sullivan. 2012. Google's Results Get More Personal With \u201cSearch Plus Your World\u201d . https:\/\/searchengineland.com\/googles-results-get-more-personal-with-search-plus-your-world-107285{online}. (2012)."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243782"},{"key":"e_1_3_2_1_58_1","unstructured":"The Legion of the Bouncy Castle. 2007. Bouncy Castle Crypto APIs . https:\/\/www.bouncycastle.org{online}. (2007).  The Legion of the Bouncy Castle. 2007. Bouncy Castle Crypto APIs . https:\/\/www.bouncycastle.org{online}. (2007)."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Q. Wang K. Ren M. Du Q. Li and A. Mohaisen. 2017. SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates. In FC'17 .  Q. Wang K. Ren M. Du Q. Li and A. Mohaisen. 2017. SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates. In FC'17 .","DOI":"10.1007\/978-3-319-70972-7_5"},{"key":"e_1_3_2_1_60_1","unstructured":"X. Wang. 2018. FlexSC . https:\/\/github.com\/wangxiao1254\/FlexSC{online}. (2018).  X. Wang. 2018. FlexSC . https:\/\/github.com\/wangxiao1254\/FlexSC{online}. (2018)."},{"key":"e_1_3_2_1_61_1","unstructured":"D.J. Wu J. Zimmerman J. Planul and J.C. Mitchell. 2016. Privacy-Preserving Shortest Path Computation . ArXiv e-prints arXiv:1601.02281 . (2016).  D.J. Wu J. Zimmerman J. Planul and J.C. Mitchell. 2016. Privacy-Preserving Shortest Path Computation . ArXiv e-prints arXiv:1601.02281 . (2016)."},{"key":"e_1_3_2_1_62_1","volume-title":"et almbox","author":"Xie D.","year":"2016","unstructured":"D. Xie , G. Li , B. Yao , X. Wei , X. Xiao , Y. Gao , et almbox . 2016 . Practical Private Shortest Path Computation Based on Oblivious Storage. In IEEE ICDE '16 . D. Xie, G. Li, B. Yao, X. Wei, X. Xiao, Y. Gao, et almbox. 2016. Practical Private Shortest Path Computation Based on Oblivious Storage. In IEEE ICDE'16 ."},{"key":"e_1_3_2_1_63_1","unstructured":"P. Xie and E. Xing. 2014. CryptGraph: Privacy Preserving Graph Analytics on Encrypted Graph . ArXiv e-prints arXiv:1409.5021 . (2014).  P. Xie and E. Xing. 2014. CryptGraph: Privacy Preserving Graph Analytics on Encrypted Graph . ArXiv e-prints arXiv:1409.5021 . (2014)."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.09.028"},{"key":"e_1_3_2_1_65_1","volume-title":"Protocols for Secure Computations. In IEEE SFCS'82 .","author":"Yao A.C.","year":"1982","unstructured":"A.C. Yao . 1982 . Protocols for Secure Computations. In IEEE SFCS'82 . A.C. Yao. 1982. Protocols for Secure Computations. In IEEE SFCS'82 ."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3052973.3052977"},{"key":"e_1_3_2_1_67_1","volume-title":"Spark: Cluster Computing with Working Sets. In USENIX Workshop HotCloud'10 .","author":"Zaharia M.","unstructured":"M. Zaharia , M. Chowdhury , M.J. Franklin , S. Shenker , and I. Stoica . 2010 . Spark: Cluster Computing with Working Sets. In USENIX Workshop HotCloud'10 . M. Zaharia, M. Chowdhury, M.J. Franklin, S. Shenker, and I. Stoica. 2010. Spark: Cluster Computing with Working Sets. In USENIX Workshop HotCloud'10 ."},{"key":"e_1_3_2_1_68_1","volume-title":"Us: The Power of File-Injection Attacks on Searchable Encryption. In USENIX Security'16 .","author":"Zhang Y.","year":"2016","unstructured":"Y. Zhang , J. Katz , and C. Papamanthou . 2016 . All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption. In USENIX Security'16 . Y. Zhang, J. Katz, and C. Papamanthou. 2016. All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption. In USENIX Security'16 ."}],"event":{"name":"Asia CCS '19: ACM Asia Conference on Computer and Communications Security","location":"Auckland New Zealand","acronym":"Asia CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321705.3329803","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321705.3329803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:39Z","timestamp":1750204479000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321705.3329803"}},"subtitle":["An Encrypted Graph Database for Privacy-Preserving Social Search"],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":67,"alternative-id":["10.1145\/3321705.3329803","10.1145\/3321705"],"URL":"https:\/\/doi.org\/10.1145\/3321705.3329803","relation":{},"subject":[],"published":{"date-parts":[[2019,7,2]]},"assertion":[{"value":"2019-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}