{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:00:19Z","timestamp":1775638819196,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Alibaba Innovative Research"},{"name":"HKRGC","award":["16202317, 16201318, 16201819, 16205420"],"award-info":[{"award-number":["16202317, 16201318, 16201819, 16205420"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3452808","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"1969-1981","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Secure Yannakakis"],"prefix":"10.1145","author":[{"given":"Yilei","family":"Wang","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proc. Conference on Innovative Data Systems Research .","author":"Aggarwal Gagan","year":"2005","unstructured":"Gagan Aggarwal , Mayank Bawa , Prasanna Ganesan , Hector Garcia-Molina , Krishnaram Kenthapadi , Rajeev Motwani , Utkarsh Srivastava , Dilys Thomas , and Ying Xu . 2005 . Two Can Keep A Secret: A Distributed Architecture for Secure Database Services . In Proc. Conference on Innovative Data Systems Research . Gagan Aggarwal, Mayank Bawa, Prasanna Ganesan, Hector Garcia-Molina, Krishnaram Kenthapadi, Rajeev Motwani, Utkarsh Srivastava, Dilys Thomas, and Ying Xu. 2005. Two Can Keep A Secret: A Distributed Architecture for Secure Database Services. In Proc. Conference on Innovative Data Systems Research ."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467797"},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. International Conference on Database Theory .","author":"Arasu Arvind","year":"2014","unstructured":"Arvind Arasu and Raghav Kaushik . 2014 . Oblivious query processing . Proc. International Conference on Database Theory . Arvind Arasu and Raghav Kaushik. 2014. Oblivious query processing. Proc. International Conference on Database Theory ."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392412"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Sumeet Bajaj and Radu Sion. 2011. TrustedDB: A Trusted Hardware based Database with Privacy and Data Confidentiality. In SIGMOD .  Sumeet Bajaj and Radu Sion. 2011. TrustedDB: A Trusted Hardware based Database with Privacy and Data Confidentiality. In SIGMOD .","DOI":"10.1145\/1989323.1989346"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055334"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3291264.3291274"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"e_1_3_2_2_9_1","volume-title":"Advances in cryptology","author":"Chaum David","unstructured":"David Chaum . 1984. Blind signature system . In Advances in cryptology . Springer , 153--153. David Chaum. 1984. Blind signature system. In Advances in cryptology. Springer, 153--153."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_2_12_1","volume-title":"ABY: A framework for efficient mixed-protocol secure two-party computation.. In NDSS .","author":"Demmler Daniel","year":"2015","unstructured":"Daniel Demmler , Thomas Schneider , and Michael Zohner . 2015 . ABY: A framework for efficient mixed-protocol secure two-party computation.. In NDSS . Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY: A framework for efficient mixed-protocol secure two-party computation.. In NDSS ."},{"key":"e_1_3_2_2_13_1","first-page":"3","article-title":"The Algorithmic Foundations of Differential Privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth . 2014 . The Algorithmic Foundations of Differential Privacy . Foundations and Trends in Theoretical Computer Science , Vol. 9 , 3 -- 4 (2014), 211--407. Cynthia Dwork and Aaron Roth. 2014. The Algorithmic Foundations of Differential Privacy. Foundations and Trends in Theoretical Computer Science , Vol. 9, 3--4 (2014), 211--407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_2_14_1","volume-title":"et almbox","author":"Evans David","year":"2018","unstructured":"David Evans , Vladimir Kolesnikov , Mike Rosulek , et almbox . 2018 . A pragmatic introduction to secure multi-party computation. Foundations and Trends\u00ae in Privacy and Security , Vol. 2 , 2--3 (2018), 70--246. David Evans, Vladimir Kolesnikov, Mike Rosulek, et almbox. 2018. A pragmatic introduction to secure multi-party computation. Foundations and Trends\u00ae in Privacy and Security , Vol. 2, 2--3 (2018), 70--246."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/4229.4233"},{"key":"e_1_3_2_2_17_1","unstructured":"Yan Huang David Evans and Jonathan Katz. 2012. Private set intersection: Are garbled circuits better than custom protocols?. In NDSS .  Yan Huang David Evans and Jonathan Katz. 2012. Private set intersection: Are garbled circuits better than custom protocols?. In NDSS ."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902293"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3187009.3177733"},{"key":"e_1_3_2_2_20_1","volume-title":"Efficient Oblivious Database Joins. arXiv preprint arXiv:2003.09481","author":"Krastnikov Simeon","year":"2020","unstructured":"Simeon Krastnikov , Florian Kerschbaum , and Douglas Stebila . 2020. Efficient Oblivious Database Joins. arXiv preprint arXiv:2003.09481 ( 2020 ). Simeon Krastnikov, Florian Kerschbaum, and Douglas Stebila. 2020. Efficient Oblivious Database Joins. arXiv preprint arXiv:2003.09481 (2020)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38980-1_6"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44676-1_10"},{"key":"e_1_3_2_2_26_1","volume-title":"24th USENIX Security Symposium (USENIX Security 15)","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas , Thomas Schneider , Gil Segev , and Michael Zohner . 2015 . Phasing: Private set intersection using permutation-based hashing . In 24th USENIX Security Symposium (USENIX Security 15) . 515--530. Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015. Phasing: Private set intersection using permutation-based hashing. In 24th USENIX Security Symposium (USENIX Security 15). 515--530."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_2_2_28_1","volume-title":"Faster Private Set Intersection Based on OT Extension. In USENIX Security Symposium . 797--812","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas , Thomas Schneider , and Michael Zohner . 2014 . Faster Private Set Intersection Based on OT Extension. In USENIX Security Symposium . 797--812 . Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX Security Symposium . 797--812."},{"key":"e_1_3_2_2_29_1","volume-title":"Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. In USENIX Security Symposium .","author":"Poddar Rishabh","unstructured":"Rishabh Poddar , Sukrit Kalra , Avishay Yanai , Ryan Deng , Raluca Ada Popa , and Joseph M. Hellerstein . 2021 . Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. In USENIX Security Symposium . Rishabh Poddar, Sukrit Kalra, Avishay Yanai, Ryan Deng, Raluca Ada Popa, and Joseph M. Hellerstein. 2021. Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. In USENIX Security Symposium ."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_3_2_2_31_1","volume-title":"EnclaveDB: a secure database using SGX","author":"Priebe Christian","unstructured":"Christian Priebe , Kapil Vaswani , and Manuel Costa . 2018. EnclaveDB: a secure database using SGX . In IEEE Security & Privacy . Christian Priebe, Kapil Vaswani, and Manuel Costa. 2018. EnclaveDB: a secure database using SGX. In IEEE Security & Privacy ."},{"key":"e_1_3_2_2_32_1","unstructured":"Stephen Tu M. Frans Kaashoek Samuel Madden and Nickolai Zeldovich. 2013. Processing analytical queries over encrypted data. In PVLDB .  Stephen Tu M. Frans Kaashoek Samuel Madden and Nickolai Zeldovich. 2013. Processing analytical queries over encrypted data. In PVLDB ."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303982"},{"key":"e_1_3_2_2_34_1","first-page":"82","article-title":"Algorithms for acyclic database schemes","volume":"81","author":"Yannakakis Mihalis","year":"1981","unstructured":"Mihalis Yannakakis . 1981 . Algorithms for acyclic database schemes . In VLDB , Vol. 81. 82 -- 94 . Mihalis Yannakakis. 1981. Algorithms for acyclic database schemes. In VLDB, Vol. 81. 82--94.","journal-title":"VLDB"},{"key":"e_1_3_2_2_35_1","volume-title":"27th Annual Symposium on Foundations of Computer Science (sfcs","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986 . How to generate and exchange secrets . In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). IEEE, 162--167. Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). IEEE, 162--167."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452808","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452808"}},"subtitle":["Join-Aggregate Queries over Private Data"],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":35,"alternative-id":["10.1145\/3448016.3452808","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3452808","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}