{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:26Z","timestamp":1750220006806,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"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":[[2022,11,7]]},"DOI":"10.1145\/3548606.3563544","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"3371-3373","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Poster"],"prefix":"10.1145","author":[{"given":"Pranav","family":"Jangir","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Nishat","family":"Koti","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Varsha Bhat","family":"Kukkala","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Bhavish","family":"Raj Gopal","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Somya","family":"Sangal","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2017. Learning with Privacy at Scale. \"https:\/\/machinelearning.apple.com\/ research\/learning-with-privacy-at-scale\".  2017. Learning with Privacy at Scale. \"https:\/\/machinelearning.apple.com\/ research\/learning-with-privacy-at-scale\"."},{"key":"e_1_3_2_1_2_1","volume-title":"Prio: Privacy preserving aggregate statistics via boolean shares. Cryptology ePrint Archive","author":"Addanki Surya","year":"2021","unstructured":"Surya Addanki , Kevin Garbe , Eli Jaffe , Rafail Ostrovsky , and Antigoni Polychroniadou . 2021 . Prio: Privacy preserving aggregate statistics via boolean shares. Cryptology ePrint Archive (2021). Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, and Antigoni Polychroniadou. 2021. Prio: Privacy preserving aggregate statistics via boolean shares. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Toshinori Araki Jun Furukawa Kazuma Ohara Benny Pinkas Hanan Rosemarin and Hikaru Tsuchida. 2021. Secure Graph Analysis at Scale. In ACM CCS.  Toshinori Araki Jun Furukawa Kazuma Ohara Benny Pinkas Hanan Rosemarin and Hikaru Tsuchida. 2021. Secure Graph Analysis at Scale. In ACM CCS.","DOI":"10.1145\/3460120.3484560"},{"key":"e_1_3_2_1_4_1","volume-title":"Optorama: Optimal oblivious ram. In EuroCrypt.","author":"Asharov Gilad","year":"2020","unstructured":"Gilad Asharov , Ilan Komargodski , Wei-Kai Lin , Kartik Nayak , Enoch Peserico , and Elaine Shi . 2020 . Optorama: Optimal oblivious ram. In EuroCrypt. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, and Elaine Shi. 2020. Optorama: Optimal oblivious ram. In EuroCrypt."},{"volume-title":"Lightweight techniques for private heavy hitters","author":"Boneh Dan","key":"e_1_3_2_1_5_1","unstructured":"Dan Boneh , Elette Boyle , Henry Corrigan-Gibbs , Niv Gilboa , and Yuval Ishai . 2021. Lightweight techniques for private heavy hitters . In IEEE SP. Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, and Yuval Ishai. 2021. Lightweight techniques for private heavy hitters. In IEEE SP."},{"key":"e_1_3_2_1_6_1","volume-title":"NeurIPS 2021 Workshop Privacy in Machine Learning.","author":"Braun Lennart","year":"2021","unstructured":"Lennart Braun , Rosario Cammarota , and Thomas Schneider . 2021 . A Generic Hybrid 2PC Framework with Application to Private Inference of Unmodified Neural Networks (Extended Abstract) . In NeurIPS 2021 Workshop Privacy in Machine Learning. Lennart Braun, Rosario Cammarota, and Thomas Schneider. 2021. A Generic Hybrid 2PC Framework with Application to Private Inference of Unmodified Neural Networks (Extended Abstract). In NeurIPS 2021 Workshop Privacy in Machine Learning."},{"key":"e_1_3_2_1_7_1","volume-title":"Prio: Private, robust, and scalable computation of aggregate statistics. In NSDI 17.","author":"Corrigan-Gibbs Henry","year":"2017","unstructured":"Henry Corrigan-Gibbs and Dan Boneh . 2017 . Prio: Private, robust, and scalable computation of aggregate statistics. In NSDI 17. Henry Corrigan-Gibbs and Dan Boneh. 2017. Prio: Private, robust, and scalable computation of aggregate statistics. In NSDI 17."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_13"},{"key":"e_1_3_2_1_9_1","volume-title":"ITC","author":"Falk Brett Hemenway","year":"2021","unstructured":"Brett Hemenway Falk and Rafail Ostrovsky . 2021 . Secure Merge with O (n log log n) Secure Operations . In ITC 2021. Brett Hemenway Falk and Rafail Ostrovsky. 2021. Secure Merge with O (n log log n) Secure Operations. In ITC 2021."},{"key":"e_1_3_2_1_10_1","volume-title":"SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In USENIX Security.","author":"Koti Nishat","year":"2021","unstructured":"Nishat Koti , Mahak Pancholi , Arpita Patra , and Ajith Suresh . 2021 . SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In USENIX Security. Nishat Koti, Mahak Pancholi, Arpita Patra, and Ajith Suresh. 2021. SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In USENIX Security."},{"key":"e_1_3_2_1_11_1","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A mixed protocol framework for machine learning. In ACM CCS.  Payman Mohassel and Peter Rindal. 2018. ABY3: A mixed protocol framework for machine learning. In ACM CCS."},{"key":"e_1_3_2_1_12_1","volume-title":"Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi.","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 S &P. Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi. 2015. GraphSC: Parallel secure computation made easy. In IEEE S&P."},{"key":"e_1_3_2_1_13_1","volume-title":"BLAZE: Blazing Fast Privacy-Preserving Machine Learning. In NDSS.","author":"Patra Arpita","year":"2020","unstructured":"Arpita Patra and Ajith Suresh . 2020 . BLAZE: Blazing Fast Privacy-Preserving Machine Learning. In NDSS. Arpita Patra and Ajith Suresh. 2020. BLAZE: Blazing Fast Privacy-Preserving Machine Learning. In NDSS."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028802"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Los Angeles CA USA","acronym":"CCS '22"},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3563544","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3563544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:06Z","timestamp":1750182666000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3563544"}},"subtitle":["Vogue: Faster Computation of Private Heavy Hitters"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":14,"alternative-id":["10.1145\/3548606.3563544","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3563544","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}