{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:26:41Z","timestamp":1767094001457,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2210299"],"award-info":[{"award-number":["2210299"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2210300"],"award-info":[{"award-number":["2210300"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,1,6]]},"DOI":"10.1145\/3772290.3772310","type":"proceedings-article","created":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:18Z","timestamp":1767093858000},"page":"82-91","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sparser Shuffles Suffice"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0892-0414","authenticated-orcid":false,"given":"Diksha","family":"Gupta","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3376-7334","authenticated-orcid":false,"given":"Jared","family":"Saia","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-8595","authenticated-orcid":false,"given":"Maxwell","family":"Young","sequence":"additional","affiliation":[{"name":"Mississippi State University, Mississippi State, MS, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Anceaume E. Ludinard R. Ravoaja A. and Brasileiro F.\u00a0V. PeerCube: A hypercube-based P2P overlay robust against collusion and churn. In Proceedings of the 2nd IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) (2008) pp.\u00a015\u201324.","DOI":"10.1109\/SASO.2008.44"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Augustine J. Pandurangan G. and Robinson P. Fast byzantine agreement in dynamic networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) (2013) pp.\u00a074\u201383.","DOI":"10.1145\/2484239.2484275"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"crossref","unstructured":"Augustine J. Pandurangan G. and Robinson P. Fast byzantine leader election in dynamic networks. In Proceedings of the International Symposium on Distributed Computing (DISC) (2015) Springer pp.\u00a0276\u2013291.","DOI":"10.1007\/978-3-662-48653-5_19"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Awerbuch B. and Scheideler C. Group spreading: A protocol for provably secure distributed name service. In Automata Languages and Programming (Berlin Heidelberg 2004) J.\u00a0D\u00edaz J.\u00a0Karhum\u00e4ki A.\u00a0Lepist\u00f6 and D.\u00a0Sannella Eds. Springer Berlin Heidelberg pp.\u00a0183\u2013195.","DOI":"10.1007\/978-3-540-27836-8_18"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Awerbuch B. and Scheideler C. Robust random number generation for peer-to-peer systems. In Proceedings of the 10th International Conference On Principles of Distributed Systems (OPODIS) (2006) pp.\u00a0275\u2013289.","DOI":"10.1007\/11945529_20"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Awerbuch B. and Scheideler C. Towards a scalable and robust DHT. In Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2006) pp.\u00a0318\u2013327.","DOI":"10.1145\/1148109.1148163"},{"key":"e_1_3_3_1_8_2","unstructured":"Awerbuch B. and Scheideler C. Towards scalable and robust overlay networks. In Proceedings of the 6th International Workshop on Peer-to-Peer Systems (IPTPS) (2007) p.\u00a0n. pag."},{"key":"e_1_3_3_1_9_2","unstructured":"Benet J. and Greco N. Filecoin: A decentralized storage network. Protocol Labs 1 (July 2018) 1\u201336."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Castro M. Druschel P. Ganesh A. Rowstron A. and Wallach D.\u00a0S. Secure routing for structured peer-to-peer overlay networks. In Proceedings of the 5th Usenix Symposium on Operating Systems Design and Implementation (OSDI) (2002) pp.\u00a0299\u2013314.","DOI":"10.1145\/1060289.1060317"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Chernoff H. A note on an inequality involving the normal distribution. The Annals of Probability (1981) 533\u2013535.","DOI":"10.1214\/aop\/1176994428"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Chung F. and Lu L. Concentration inequalities and martingale inequalities: a survey. Internet mathematics 3 1 (2006) 79\u2013127.","DOI":"10.1080\/15427951.2006.10129115"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal V. The tail of the hypergeometric distribution. Discrete Mathematics 25 3 (1979) 285\u2013287.","DOI":"10.1016\/0012-365X(79)90084-0"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"crossref","unstructured":"Dubhashi D. and Panconesi A.Concentration of Measure for the Analysis of Randomized Algorithms 1st\u00a0ed. Cambridge University Press 2009.","DOI":"10.1017\/CBO9780511581274"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Eisenbarth J.-P. Cholez T. and Perrin O. A comprehensive study of the bitcoin p2p network. In 2021 3rd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS) (2021) IEEE pp.\u00a0105\u2013112.","DOI":"10.1109\/BRAINS52497.2021.9569782"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Falkner J. Piatek M. John J.\u00a0P. Krishnamurthy A. and Anderson T. Profiling a million user DHT. In Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement (2007) pp.\u00a0129\u2013134.","DOI":"10.1145\/1298306.1298325"},{"key":"e_1_3_3_1_17_2","unstructured":"Fiat A. and Saia J. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms (SODA) (2002) pp.\u00a094\u2013103."},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Fiat A. Saia J. and Young M. Making chord robust to byzantine attacks. In Proceedings of the 13th European Symposium on Algorithms (ESA) (2005) pp.\u00a0803\u2013814.","DOI":"10.1007\/11561071_71"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Godfrey P.\u00a0B. Shenker S. and Stoica I. Minimizing churn in distributed systems. ACM SIGCOMM Computer Communication Review 36 4 (2006) 147\u2013158.","DOI":"10.1145\/1151659.1159931"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Guerraoui R. Huc F. and Kermarrec A.-M. Highly dynamic distributed computing with byzantine failures. In Proceedings of the 2013 ACM symposium on Principles of distributed computing (2013) pp.\u00a0176\u2013183.","DOI":"10.1145\/2484239.2484263"},{"key":"e_1_3_3_1_21_2","unstructured":"Heilman E. Kendler A. Zohar A. and Goldberg S. Eclipse attacks on bitcoin\u2019s peer-to-peer network. In Proceedings of the 24th USENIX Conference on Security Symposium (2015) pp.\u00a0129\u2013144."},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"crossref","unstructured":"Hildrum K. and Kubiatowicz J. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In Proceedings of the 17th International Symposium on Distributed Computing (2004) pp.\u00a0321\u2013336.","DOI":"10.1007\/978-3-540-39989-6_23"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Hoeffding W. Probability inequalities for sums of bounded random variables. Journal of the American statistical association 58 301 (1963) 13\u201330.","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Jaiyeola M.\u00a0O. Patron K. Saia J. Young M. and Zhou Q.\u00a0M. Tiny groups tackle byzantine adversaries. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium IPDPS (2018) pp.\u00a01030\u20131039.","DOI":"10.1109\/IPDPS.2018.00112"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"crossref","unstructured":"King V. Lewis S. Saia J. and Young M. Choosing a random peer in chord. Algorithmica 49 2 (2007) 147\u2013169.","DOI":"10.1007\/s00453-007-9029-2"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"King V. and Saia J. Choosing a Random Peer. In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC) (2004) pp.\u00a0125\u2013130.","DOI":"10.1145\/1011767.1011786"},{"key":"e_1_3_3_1_27_2","unstructured":"Mitzenmacher M. and Upfal E.Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press 2017."},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Naor M. and Wieder U. Novel architectures for P2P applications: The continuous-discrete approach. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2003).","DOI":"10.1145\/777417.777421"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"crossref","unstructured":"Naor M. and Wieder U. A simple fault tolerant distributed hash table. In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS) (2003) pp.\u00a088\u201397.","DOI":"10.1007\/978-3-540-45172-3_8"},{"key":"e_1_3_3_1_30_2","unstructured":"Rhea S. Geels D. Roscoe T. and Kubiatowicz J. Handling churn in a DHT. In Proceedings of the Annual Conference on USENIX Annual Technical Conference (USA 2004) USENIX Association pp.\u00a0127\u2013149."},{"key":"e_1_3_3_1_31_2","unstructured":"Rodrigues R. and Liskov B. Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture. Tech. Rep. TR\/932 MIT LCS December 2003."},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Saia J. Fiat A. Gribble S. Karlin A. and Saroiu S. Dynamically fault-tolerant content addressable networks. In Proceedings of the First International Workshop on Peer-to-Peer Systems (Cambridge MA 2002).","DOI":"10.1007\/3-540-45748-8_26"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"Saia J. and Young M. Reducing communication costs in robust peer-to-peer networks. Information Processing Letters 106(4) (2008) 152\u2013158.","DOI":"10.1016\/j.ipl.2007.11.004"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"crossref","unstructured":"Scheideler C. How to spread adversarial nodes? rotate! In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC) (2005).","DOI":"10.1145\/1060590.1060694"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"crossref","unstructured":"Sen S. and Freedman M.\u00a0J. Commensal cuckoo: Secure group partitioning for large-scale services. ACM SIGOPS Operating Systems 46 1 (Feb. 2012) 33\u201339.","DOI":"10.1145\/2146382.2146389"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"crossref","unstructured":"Singh A. Ngan T.\u00a0W. Druschel P. and Wallach D.\u00a0S. Eclipse attacks on overlay networks: Threats and defenses. In Proceedings IEEE International Conference on Computer Communications (INFOCOM) (2006) pp.\u00a01\u201312.","DOI":"10.1109\/INFOCOM.2006.231"},{"key":"e_1_3_3_1_37_2","unstructured":"Skala M. Hypergeometric tail inequalities: ending the insanity. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1311.5939 (2013)."},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"crossref","unstructured":"Steiner M. En-Najjary T. and Biersack E.\u00a0W. A global view of KAD. In Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement (2007) pp.\u00a0117 \u2013 122.","DOI":"10.1145\/1298306.1298323"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"crossref","unstructured":"Urdaneta G. Pierre G. and Steen M.\u00a0V. A survey of dht security techniques. ACM Computing Surveys (CSUR) 43 2 (2011) 1\u201349.","DOI":"10.1145\/1883612.1883615"},{"key":"e_1_3_3_1_40_2","unstructured":"Wang L. and Kangasharju J. Measuring large-scale distributed systems: Case of bittorrent mainline dht. pp.\u00a01\u201310."},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"crossref","unstructured":"Young M. Kate A. Goldberg I. and Karsten M. Practical robust communication in dhts tolerating a byzantine adversary. In Proceedings of the 30th IEEE International Conference on Distributed Computing Systems (ICDCS) (2010) pp.\u00a0263\u2013272.","DOI":"10.1109\/ICDCS.2010.31"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"crossref","unstructured":"Young M. Kate A. Goldberg I. and Karsten M. Towards practical communication in Byzantine-resistant DHTs. IEEE\/ACM Transactions on Networking 21 1 (Feb. 2013) 190\u2013203.","DOI":"10.1109\/TNET.2012.2195729"}],"event":{"name":"ICDCN 2026: 27th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2026","location":"Nara Japan"},"container-title":["Proceedings of the 27th International Conference on Distributed Computing and Networking"],"original-title":[],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:42Z","timestamp":1767093882000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772290.3772310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":41,"alternative-id":["10.1145\/3772290.3772310","10.1145\/3772290"],"URL":"https:\/\/doi.org\/10.1145\/3772290.3772310","relation":{},"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"2026-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}