{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:39:04Z","timestamp":1773931144759,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":77,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T00:00:00Z","timestamp":1507939200000},"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":[[2017,10,14]]},"DOI":"10.1145\/3132747.3132755","type":"proceedings-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T12:51:09Z","timestamp":1507812669000},"page":"406-422","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Atom"],"prefix":"10.1145","author":[{"given":"Albert","family":"Kwon","sequence":"first","affiliation":[{"name":"MIT"}]},{"given":"Henry","family":"Corrigan-Gibbs","sequence":"additional","affiliation":[{"name":"Stanford"}]},{"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[{"name":"MIT"}]},{"given":"Bryan","family":"Ford","sequence":"additional","affiliation":[{"name":"EPFL"}]}],"member":"320","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Advanced crypto library for the Go language. https:\/\/github.com\/DeDiS\/crypto.  Advanced crypto library for the Go language. https:\/\/github.com\/DeDiS\/crypto."},{"key":"e_1_3_2_2_2_1","unstructured":"Off-the-Record Messaging. https:\/\/otr.cypherpunks.ca\/.  Off-the-Record Messaging. https:\/\/otr.cypherpunks.ca\/."},{"key":"e_1_3_2_2_3_1","unstructured":"Tor Metrics Portal. https:\/\/metrics.torproject.org.  Tor Metrics Portal. https:\/\/metrics.torproject.org."},{"key":"e_1_3_2_2_4_1","volume-title":"Mix-networks on permutation networks","author":"Abe Masayuki","unstructured":"Masayuki Abe . 1999. Mix-networks on permutation networks . In ASIACRYPT. Springer , 258--273. Masayuki Abe. 1999. Mix-networks on permutation networks. In ASIACRYPT. Springer, 258--273."},{"key":"e_1_3_2_2_5_1","volume-title":"Remarks on mix-network based on permutation networks","author":"Abe Masayuki","unstructured":"Masayuki Abe and Fumitaka Hoshino . 2001. Remarks on mix-network based on permutation networks . In PKC. Springer , 317--324. Masayuki Abe and Fumitaka Hoshino. 2001. Remarks on mix-network based on permutation networks. In PKC. Springer, 317--324."},{"key":"e_1_3_2_2_6_1","unstructured":"Mehmet Adalier. 2015. Efficient and Secure Elliptic Curve Cryptography Implementation of Curve P-256. (2015).  Mehmet Adalier. 2015. Efficient and Secure Elliptic Curve Cryptography Implementation of Curve P-256. (2015)."},{"key":"e_1_3_2_2_7_1","volume-title":"USENIX Security Symposium. USENIX Association","author":"Alexopoulos Nikolaos","year":"2017","unstructured":"Nikolaos Alexopoulos , Aggelos Kiayias , Riivo Talviste , and Thomas Zacharias . 2017 . MCMix: Anonymous Messaging via Secure Multiparty Computation . In USENIX Security Symposium. USENIX Association , Vancouver, BC, 1217--1234. Nikolaos Alexopoulos, Aggelos Kiayias, Riivo Talviste, and Thomas Zacharias. 2017. MCMix: Anonymous Messaging via Secure Multiparty Computation. In USENIX Security Symposium. USENIX Association, Vancouver, BC, 1217--1234."},{"key":"e_1_3_2_2_8_1","volume-title":"Unobservable Communication over Fully Untrusted Infrastructure","author":"Angel Sebastian","unstructured":"Sebastian Angel and Srinath Setty . 2016. Unobservable Communication over Fully Untrusted Infrastructure . In OSDI. USENIX Association , GA , 551--569. Sebastian Angel and Srinath Setty. 2016. Unobservable Communication over Fully Untrusted Infrastructure. In OSDI. USENIX Association, GA, 551--569."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314336"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33481-8_9"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/648184.749735"},{"key":"e_1_3_2_2_14_1","unstructured":"On Bitcoin as a public randomness source. https:\/\/eprint.iacr.org\/2015\/1015.pdf.  On Bitcoin as a public randomness source. https:\/\/eprint.iacr.org\/2015\/1015.pdf."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11767831_2"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150415"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382260"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/54235.54239"},{"key":"e_1_3_2_2_20_1","volume-title":"Pedersen","author":"Chaum David","year":"1993","unstructured":"David Chaum and Torben P . Pedersen . 1993 . Wallet Databases with Observers. In CRYPTO. 89--105. David Chaum and Torben P. Pedersen. 1993. Wallet Databases with Observers. In CRYPTO. 89--105."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.27"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746629"},{"key":"e_1_3_2_2_24_1","unstructured":"Artur Czumaj Przemyslawa Kanarek Miroslaw Kutylowski and Krzysztof Lorys. 1999. Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. In SODA. 271--280.   Artur Czumaj Przemyslawa Kanarek Miroslaw Kutylowski and Krzysztof Lorys. 1999. Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. In SODA. 271--280."},{"key":"e_1_3_2_2_25_1","volume-title":"Switching Networks: Recent Advances","author":"Czumaj Artur","unstructured":"Artur Czumaj , Przemka Kanarek , Krzysztof Lory\u015b , and Miroslaw Kutylowski . 2001. Switching networks for generating random permutations . In Switching Networks: Recent Advances . Springer , 25--61. Artur Czumaj, Przemka Kanarek, Krzysztof Lory\u015b, and Miroslaw Kutylowski. 2001. Switching networks for generating random permutations. In Switching Networks: Recent Advances. Springer, 25--61."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Artur Czumaj and Berthold Vocking. 2014. Thorp Shuffling Butterflies and Non-Markovian Couplings. In ICALP. 344--355.  Artur Czumaj and Berthold Vocking. 2014. Thorp Shuffling Butterflies and Non-Markovian Couplings. In ICALP. 344--355.","DOI":"10.1007\/978-3-662-43948-7_29"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/829515.830555"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30114-1_21"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Morris J. Dworkin. 2014. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. (2014).  Morris J. Dworkin. 2014. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. (2014).","DOI":"10.6028\/NIST.FIPS.202"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.28"},{"key":"e_1_3_2_2_32_1","volume-title":"A public-key cryptosystem and a signature scheme based on discrete logarithms","author":"ElGamal Taher","unstructured":"Taher ElGamal . 1984. A public-key cryptosystem and a signature scheme based on discrete logarithms . In CRYPTO. Springer , 10--18. Taher ElGamal. 1984. A public-key cryptosystem and a signature scheme based on discrete logarithms. In CRYPTO. Springer, 10--18."},{"key":"e_1_3_2_2_33_1","volume-title":"An efficient scheme for proving a shuffle","author":"Furukawa Jun","unstructured":"Jun Furukawa and Kazue Sako . 2001. An efficient scheme for proving a shuffle . In CRYPTO. Springer-Verlag , 368--387. Jun Furukawa and Kazue Sako. 2001. An efficient scheme for proving a shuffle. In CRYPTO. Springer-Verlag, 368--387."},{"key":"e_1_3_2_2_34_1","volume-title":"Herbivore: A Scalable and Efficient Protocol for Anonymous Communication. Technical Report 2003-1890","author":"Goel Sharad","year":"2003","unstructured":"Sharad Goel , Mark Robson , Milo Polte , and Emin G\u00fcn Sirer . 2003 . Herbivore: A Scalable and Efficient Protocol for Anonymous Communication. Technical Report 2003-1890 . Cornell University , Ithaca, NY . Sharad Goel, Mark Robson, Milo Polte, and Emin G\u00fcn Sirer. 2003. Herbivore: A Scalable and Efficient Protocol for Anonymous Communication. Technical Report 2003-1890. Cornell University, Ithaca, NY."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030113"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/647098.717164"},{"key":"e_1_3_2_2_38_1","volume-title":"the whistleblower behind the NSA surveillance revelations. Accessed","author":"Snowden Edward","year":"2016","unstructured":"Edward Snowden : the whistleblower behind the NSA surveillance revelations. Accessed 2 November 2016 , https:\/\/www.theguardian.com\/world\/2013\/jun\/09\/edward-snowden-nsa-whistleblower-surveillance. Edward Snowden: the whistleblower behind the NSA surveillance revelations. Accessed 2 November 2016, https:\/\/www.theguardian.com\/world\/2013\/jun\/09\/edward-snowden-nsa-whistleblower-surveillance."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Jens Groth and Steve Lu. 2007. Verifiable shuffle of large size cipher-texts. In PKC. 377--392.   Jens Groth and Steve Lu. 2007. Verifiable shuffle of large size cipher-texts. In PKC. 377--392.","DOI":"10.1007\/978-3-540-71677-8_25"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v29:4"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2994620.2994635"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1655008.1655013"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.31"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516651"},{"key":"e_1_3_2_2_45_1","volume-title":"International Workshop on Information Hiding. Springer, 53--69","author":"Kedogan Dogan","year":"2002","unstructured":"Dogan Kedogan , Dakshi Agrawal , and Stefan Penz . 2002 . Limits of anonymity in open environments . In International Workshop on Information Hiding. Springer, 53--69 . Dogan Kedogan, Dakshi Agrawal, and Stefan Penz. 2002. Limits of anonymity in open environments. In International Workshop on Information Hiding. Springer, 53--69."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_37"},{"key":"e_1_3_2_2_47_1","volume-title":"One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval","author":"Kushilevitz Eyal","unstructured":"Eyal Kushilevitz and Rafail Ostrovsky . 2000. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval . In EUROCRYPT. Springer , 104--121. Eyal Kushilevitz and Rafail Ostrovsky. 2000. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In EUROCRYPT. Springer, 104--121."},{"key":"e_1_3_2_2_48_1","first-page":"115","article-title":"Riffle: An Efficient Communication System With Strong Anonymity","volume":"2016","author":"Kwon Albert","year":"2015","unstructured":"Albert Kwon , David Lazar , Srinivas Devadas , and Bryan Ford . 2015 . Riffle: An Efficient Communication System With Strong Anonymity . PETS 2016 , 2, 115 -- 134 . Albert Kwon, David Lazar, Srinivas Devadas, and Bryan Ford. 2015. Riffle: An Efficient Communication System With Strong Anonymity. PETS 2016, 2, 115--134.","journal-title":"PETS"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_50_1","volume-title":"Alpenhorn: Bootstrapping Secure Communication without Leaking Metadata. In OSDI.","author":"Lazar David","year":"2016","unstructured":"David Lazar and Nickolai Zeldovich . 2016 . Alpenhorn: Bootstrapping Secure Communication without Leaking Metadata. In OSDI. David Lazar and Nickolai Zeldovich. 2016. Alpenhorn: Bootstrapping Secure Communication without Leaking Metadata. In OSDI."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486002"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/050636231"},{"key":"e_1_3_2_2_53_1","volume-title":"Improved mixing time bounds for the Thorp shuffle and L-reversal chain. The Annals of Probability","author":"Morris Ben","year":"2009","unstructured":"Ben Morris . 2009. Improved mixing time bounds for the Thorp shuffle and L-reversal chain. The Annals of Probability ( 2009 ), 453--477. Ben Morris. 2009. Improved mixing time bounds for the Thorp shuffle and L-reversal chain. The Annals of Probability (2009), 453--477."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000478"},{"key":"e_1_3_2_2_55_1","volume-title":"Secure anonymous broadcast. arXiv preprint arXiv:1405.5326","author":"Movahedi Mahnush","year":"2014","unstructured":"Mahnush Movahedi , Jared Saia , and Mahdi Zamani . 2014. Secure anonymous broadcast. arXiv preprint arXiv:1405.5326 ( 2014 ). Mahnush Movahedi, Jared Saia, and Mahdi Zamani. 2014. Secure anonymous broadcast. arXiv preprint arXiv:1405.5326 (2014)."},{"key":"e_1_3_2_2_56_1","volume-title":"Murdoch and Piotr Zieli\u0144ski","author":"Steven","year":"2007","unstructured":"Steven J. Murdoch and Piotr Zieli\u0144ski . 2007 . Sampled Traffic Analysis by Internet-Exchange-Level Adversaries. In PET, Nikita Borisov and Philippe Golle (Eds.). Springer . Steven J. Murdoch and Piotr Zieli\u0144ski. 2007. Sampled Traffic Analysis by Internet-Exchange-Level Adversaries. In PET, Nikita Borisov and Philippe Golle (Eds.). Springer."},{"key":"e_1_3_2_2_57_1","unstructured":"Ulf M\u00e2\u00edoller Lance Cottrell and Peter Palfrader. 2003. Mixmaster Protocol Version 2. (2003).  Ulf M\u00e2\u00edoller Lance Cottrell and Peter Palfrader. 2003. Mixmaster Protocol Version 2. (2003)."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100273"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046556.2046570"},{"key":"e_1_3_2_2_61_1","volume-title":"The Loopix Anonymity System. In USENIX Security Symposium. USENIX Association","author":"Piotrowska Ania M.","year":"2017","unstructured":"Ania M. Piotrowska , Jamie Hayes , Tariq Elahi , Sebastian Meiser , and George Danezis . 2017 . The Loopix Anonymity System. In USENIX Security Symposium. USENIX Association , Vancouver, BC, 1199--1216. Ania M. Piotrowska, Jamie Hayes, Tariq Elahi, Sebastian Meiser, and George Danezis. 2017. The Loopix Anonymity System. In USENIX Security Symposium. USENIX Association, Vancouver, BC, 1199--1216."},{"key":"e_1_3_2_2_62_1","volume-title":"Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack","author":"Rackoff Charles","unstructured":"Charles Rackoff and Daniel R Simon . 1991. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack . In CRYPTO. Springer , 433--444. Charles Rackoff and Daniel R Simon. 1991. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In CRYPTO. Springer, 433--444."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167260"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/293411.293778"},{"key":"e_1_3_2_2_65_1","volume-title":"Cryptography and Data Security","author":"Robling Denning Dorothy Elizabeth","unstructured":"Dorothy Elizabeth Robling Denning . 1982. Cryptography and Data Security . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA . Dorothy Elizabeth Robling Denning. 1982. Cryptography and Data Security. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA."},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.5555\/646038.678297"},{"key":"e_1_3_2_2_68_1","volume-title":"Scalable Bias-Resistant Distributed Randomness. In IEEE Symposium on Security and Privacy. 444--460","author":"Syta E.","unstructured":"E. Syta , P. Jovanovic , E. K. Kogias , N. Gailly , L. Gasser , I. Khoffi , M. J. Fischer , and B. Ford . 2017 . Scalable Bias-Resistant Distributed Randomness. In IEEE Symposium on Security and Privacy. 444--460 . E. Syta, P. Jovanovic, E. K. Kogias, N. Gailly, L. Gasser, I. Khoffi, M. J. Fischer, and B. Ford. 2017. Scalable Bias-Resistant Distributed Randomness. In IEEE Symposium on Security and Privacy. 444--460."},{"key":"e_1_3_2_2_69_1","volume-title":"https:\/\/www.washingtonpost.com\/business\/economy\/the-nsa-slide-you-havent-seen\/2013\/07\/10\/32801426-e8e6-11e2-aa9f-c03a72e2d342_story.html. Accessed","author":"NSA","year":"2016","unstructured":"NSA slide shows surveillance of undersea cables. https:\/\/www.washingtonpost.com\/business\/economy\/the-nsa-slide-you-havent-seen\/2013\/07\/10\/32801426-e8e6-11e2-aa9f-c03a72e2d342_story.html. Accessed 26 October 2016 . NSA slide shows surveillance of undersea cables. https:\/\/www.washingtonpost.com\/business\/economy\/the-nsa-slide-you-havent-seen\/2013\/07\/10\/32801426-e8e6-11e2-aa9f-c03a72e2d342_story.html. Accessed 26 October 2016."},{"key":"e_1_3_2_2_70_1","volume-title":"https:\/\/metrics.torproject.org\/bubbles.html. Accessed","author":"Metrics Tor","year":"2017","unstructured":"Tor Metrics . https:\/\/metrics.torproject.org\/bubbles.html. Accessed 19 April 2017 .. The visualization in Figure 8 is a modified version of the Tor Metric visualization. The original diagram carries a Creative Commons Attribution 3.0 United States License . Tor Metrics. https:\/\/metrics.torproject.org\/bubbles.html. Accessed 19 April 2017.. The visualization in Figure 8 is a modified version of the Tor Metric visualization. The original diagram carries a Creative Commons Attribution 3.0 United States License."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132783"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815417"},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_2_74_1","volume-title":"Effective Attacks and Provable Defenses for Website Fingerprinting. In USENIX Security Symposium. USENIX Association","author":"Wang Tao","year":"2014","unstructured":"Tao Wang , Xiang Cai , Rishab Nithyanand , Rob Johnson , and Ian Goldberg . 2014 . Effective Attacks and Provable Defenses for Website Fingerprinting. In USENIX Security Symposium. USENIX Association , San Diego, CA. Tao Wang, Xiang Cai, Rishab Nithyanand, Rob Johnson, and Ian Goldberg. 2014. Effective Attacks and Provable Defenses for Website Fingerprinting. In USENIX Security Symposium. USENIX Association, San Diego, CA."},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517840.2517851"},{"key":"e_1_3_2_2_76_1","volume-title":"Dissent in Numbers: Making Strong Anonymity Scale","author":"Wolinsky David Isaac","unstructured":"David Isaac Wolinsky , Henry Corrigan-Gibbs , Bryan Ford , and Aaron Johnson . 2012. Dissent in Numbers: Making Strong Anonymity Scale . In OSDI. USENIX Association , Hollywood, CA , 179--182. David Isaac Wolinsky, Henry Corrigan-Gibbs, Bryan Ford, and Aaron Johnson. 2012. Dissent in Numbers: Making Strong Anonymity Scale. In OSDI. USENIX Association, Hollywood, CA, 179--182."},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516740"},{"key":"e_1_3_2_2_78_1","unstructured":"Mahdi Zamani Jared Saia Mahnush Movahedi and Joud Khoury. 2013. Towards Provably-Secure Scalable Anonymous Broadcast. In FOCI.  Mahdi Zamani Jared Saia Mahnush Movahedi and Joud Khoury. 2013. Towards Provably-Secure Scalable Anonymous Broadcast. In FOCI."}],"event":{"name":"SOSP '17: ACM SIGOPS 26th Symposium on Operating Systems Principles","location":"Shanghai China","acronym":"SOSP '17","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","USENIX Assoc USENIX Assoc"]},"container-title":["Proceedings of the 26th Symposium on Operating Systems Principles"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132747.3132755","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132747.3132755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:10:57Z","timestamp":1750212657000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132747.3132755"}},"subtitle":["Horizontally Scaling Strong Anonymity"],"short-title":[],"issued":{"date-parts":[[2017,10,14]]},"references-count":77,"alternative-id":["10.1145\/3132747.3132755","10.1145\/3132747"],"URL":"https:\/\/doi.org\/10.1145\/3132747.3132755","relation":{},"subject":[],"published":{"date-parts":[[2017,10,14]]},"assertion":[{"value":"2017-10-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}