{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T16:44:24Z","timestamp":1758905064182,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1149832"],"award-info":[{"award-number":["CNS-1149832"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","award":["FTCY1500057"],"award-info":[{"award-number":["FTCY1500057"]}],"id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134034","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"2295-2312","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Distributed Measurement with Private Set-Union Cardinality"],"prefix":"10.1145","author":[{"given":"Ellis","family":"Fenske","sequence":"first","affiliation":[{"name":"Tulane University, New Orleans, LA, USA"}]},{"given":"Akshaya","family":"Mani","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]},{"given":"Aaron","family":"Johnson","sequence":"additional","affiliation":[{"name":"U.S. Naval Research Laboratory, Washington, DC, USA"}]},{"given":"Micah","family":"Sherr","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"S. Bayer and J. Groth. 2012. Efficient Zero-knowledge Argument for Correctness of a Shuffle Theory and Applications of Cryptographic Techniques (EUROCRYPT '12).","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"A. Blum K. Ligett and A. Roth 2008. A Learning Theory Approach to Non-interactive Database Privacy Symposium on Theory of Computing (STOC '08).","DOI":"10.1145\/1374376.1374464"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"D. Boneh and P. Golle. 2002. Almost Entirely Correct Mixing With Application to Voting Computer and Communications Security (CCS 2002). 68--77.","DOI":"10.1145\/586110.586121"},{"volume-title":"Efficient cryptographic protocol design based on distributed El Gamal encryption International Conference on Information Security and Cryptology","author":"Brandt F.","key":"e_1_3_2_2_5_1","unstructured":"F. Brandt. 2005. Efficient cryptographic protocol design based on distributed El Gamal encryption International Conference on Information Security and Cryptology. Springer, 32--47."},{"key":"e_1_3_2_2_6_1","volume-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols Foundations of Computer Science (FOCS","author":"Canetti R.","year":"2001","unstructured":"R. Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols Foundations of Computer Science (FOCS 2001)."},{"volume-title":"Universally Composable Two-Party and Multi-Party Secure Computation Symposium on Theory of Computing (STOC).","author":"Canetti R.","key":"e_1_3_2_2_7_1","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. 2002. Universally Composable Two-Party and Multi-Party Secure Computation Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48071-4_7"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"I. Damgard V. Pastro N.P. Smart and S. Zakarias. 2012. Multiparty Computation from Somewhat Homomorphic Encryption Advances in Cryptology (CRYPTO 2012).","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_2_11_1","volume-title":"Mixminion: Design of a Type III Anonymous Remailer Protocol Symposium on Security and Privacy. 2--15.","author":"Danezis G.","year":"2003","unstructured":"G. Danezis, R. Dingledine, and N. Mathewson. 2003. Mixminion: Design of a Type III Anonymous Remailer Protocol Symposium on Security and Privacy. 2--15."},{"key":"e_1_3_2_2_12_1","volume-title":"Fast and Private Computation of Cardinality of Set Intersection and Union Cryptology and Network Security (CANS","author":"De Cristofaro E.","year":"2012","unstructured":"E. De Cristofaro, P. Gasti, and G. Tsudik 2012. Fast and Private Computation of Cardinality of Set Intersection and Union Cryptology and Network Security (CANS 2012)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_39"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA465464"},{"key":"e_1_3_2_2_15_1","volume-title":"Automata, Languages and Programming","author":"Differential Privacy C.","year":"2006","unstructured":"C. Dwork 2006. Differential Privacy. Automata, Languages and Programming (2006), 1--12."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"C. Dwork F. McSherry K. Nissim and A. Smith. 2006. Calibrating Noise to Sensitivity in Private Data Analysis Theory of Cryptography Conference (TCC).","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_17_1","first-page":"3","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork C.","year":"2014","unstructured":"C. Dwork, A. Roth, and others 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_18_1","doi-asserted-by":"crossref","unstructured":"R. Egert M. Fischlin D. Gens S. Jacob M. Senker and J. Tillmanns. 2012. Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters Information Security and Privacy (ACISP 2015).","DOI":"10.1007\/978-3-319-19962-7_24"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660280"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_2_21_1","volume-title":"Prove Yourself: Practical Solutions to Identification and Signature Problems Advances in Cryptology (CRYPTO '86).","author":"Fiat A.","year":"1987","unstructured":"A. Fiat and A. Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems Advances in Cryptology (CRYPTO '86)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"M. J Freedman K. Nissim and B. Pinkas 2004. Efficient Private Matching and Set Intersection. Advances in Cryptology (Eurocrypt).","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"J. Furukawa H. Miyauchi K. Mori S. Obana and K. Sako 2003. An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling Financial Cryptography (FC'02).","DOI":"10.1007\/3-540-36504-4_2"},{"key":"e_1_3_2_2_24_1","unstructured":"J. A. Garay P. MacKenzie and K. Yang. Strengthening Zero-knowledge Protocols Using Signatures Theory and Applications of Cryptographic Techniques (EUROCRYPT '03)."},{"volume-title":"Foundations of Cryptography","author":"Goldreich O.","key":"e_1_3_2_2_25_1","unstructured":"O. Goldreich. 2001. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0319-z"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"J. Groth 2003. A Verifiable Secret Shuffle of Homomorphic Encryptions Theory and Practice in Public Key Cryptography (PKC '03).","DOI":"10.1007\/3-540-36288-6_11"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9098-x"},{"key":"e_1_3_2_2_29_1","unstructured":"M. Jakobsson A. Juels and R. L. Rivest 2002. Making mix nets robust for electronic voting by randomized partial checking USENIX Security Symposium."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978310"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v6i1.634"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"e_1_3_2_2_33_1","volume-title":"Smart","author":"Larraia E.","year":"2014","unstructured":"E. Larraia, E. Orsini, and N.P. Smart 2014. Dishonest Majority Multi-Party Computation for Binary Circuits Advances in Cryptology (CRYPTO 2014)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Y. Lindell B. Pinkas N.P. Smart and A. Yanai. 2015. Efficient Constant Round Multi-party Computation Combining BMR and SPDZ Advances in Cryptology (CRYPTO 2015).","DOI":"10.1007\/978-3-662-48000-7_16"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"K. Loesing S. J Murdoch and R. Dingledine 2010. A Case Study on Measuring Statistical Data in the Tor Anonymity Network. Financial Cryptography and Data Security (FC).","DOI":"10.1007\/978-3-642-14992-4_19"},{"volume-title":"Histor\u03b5: Differentially Private and Robust Statistics Collection for Tor Network and Distributed System Security Symposium (NDSS).","author":"Mani A.","key":"e_1_3_2_2_36_1","unstructured":"A. Mani and M. Sherr. 2017. Histor\u03b5: Differentially Private and Robust Statistics Collection for Tor Network and Distributed System Security Symposium (NDSS)."},{"key":"e_1_3_2_2_37_1","volume-title":"Shining Light in Dark Places: Understanding the Tor Network Privacy Enhancing Technologies Symposium (PETS).","author":"McCoy D.","year":"2008","unstructured":"D. McCoy, K. Bauer, D. Grunwald, T. Kohno, and D. Sicker 2008. Shining Light in Dark Places: Understanding the Tor Network Privacy Enhancing Technologies Symposium (PETS)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","unstructured":"F. McSherry and K. Talwar 2007. Mechanism design via differential privacy. In Foundations of Computer Science (FOCS'07). 10.1109\/FOCS.2007.66","DOI":"10.1109\/FOCS.2007.66"},{"key":"e_1_3_2_2_39_1","volume-title":"Mixmaster Protocol -- Version 2. IETF Internet Draft. (July","author":"M\u00f6ller U.","year":"2003","unstructured":"U. M\u00f6ller, L. Cottrell, P. Palfrader, and L. Sassaman 2003. Mixmaster Protocol -- Version 2. IETF Internet Draft. (July 2003)."},{"key":"e_1_3_2_2_40_1","unstructured":"C. Andrew Neff. 2001. A Verifiable Secret Shuffle and its Application to E-voting ACM Conference on Computer and Communications Security (CCS)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24852-1_5"},{"volume-title":"Smooth Sensitivity and Sampling in Private Data Analysis Symposium on Theory of Computing (STOC '07)","author":"Nissim K.","key":"e_1_3_2_2_42_1","unstructured":"K. Nissim, S. Raskhodnikova, and A. Smith. 2007. Smooth Sensitivity and Sampling in Private Data Analysis Symposium on Theory of Computing (STOC '07)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_2_44_1","first-page":"332","article-title":"Sequences of games: a tool for taming complexity in security proofs","volume":"2004","author":"Shoup V.","year":"2004","unstructured":"V. Shoup 2004. Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology EPrint Archive Vol. 2004 (2004), 332.","journal-title":"IACR Cryptology EPrint Archive"},{"key":"e_1_3_2_2_45_1","volume-title":"Enforced Community Standards For Research on Users of the Tor Anonymity Network Workshop on Ethics in Computer Security Research (WECSR).","author":"Soghoian C.","year":"2011","unstructured":"C. Soghoian. 2011. Enforced Community Standards For Research on Users of the Tor Anonymity Network Workshop on Ethics in Computer Security Research (WECSR)."},{"key":"e_1_3_2_2_46_1","volume-title":"Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM).","author":"Stoica I.","year":"2001","unstructured":"I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan 2001. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM)."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2005-13401"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815417"},{"key":"e_1_3_2_2_49_1","volume-title":"Available at least as early as Jul","author":"K.","year":"2008","unstructured":"K. Varda 2008. Protocol buffers: Google's data interchange format. Google Open Source Blog, Available at least as early as Jul (2008)."}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134034","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134034","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T19:35:14Z","timestamp":1750966514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":48,"alternative-id":["10.1145\/3133956.3134034","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134034","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}