Jared Saia

Theor. Comput. Sci., 2024

Defending hash tables from algorithmic complexity attacks with resource burning.

[BibT_eX]

[DOI]

Trisha Chakraborty

Theor. Comput. Sci., 2024

Navigating the Edge: UAS Boundary Tracing for Efficient Volcanic Plume Monitoring.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Safety Security Rescue Robotics, 2024

Fraud Detection for Random Walks.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Defending Hash Tables from Subterfuge with Depth Charge.

[BibT_eX]

[DOI]

Trisha Chakraborty

Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023

Bankrupting Sybil despite churn.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., August, 2023

2022

Bankrupting DoS Attackers Despite Uncertainty.

[BibT_eX]

[DOI]

CoRR, 2022

2020

Resource Burning for Permissionless Systems.

[BibT_eX]

[DOI]

CoRR, 2020

ToGCom: An Asymmetric Sybil Defense.

[BibT_eX]

[DOI]

CoRR, 2020

Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Resource Burning for Permissionless Systems (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

ANTS on a Plane.

[BibT_eX]

[DOI]

Abhinav Aggarwal

Proceedings of the Structural Information and Communication Complexity, 2020

A Scalable Algorithm for Multiparty Interactive Communication with Private Channels.

[BibT_eX]

[DOI]

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

Making social networks more human: A topological approach.

[BibT_eX]

[DOI]

Jonathan W. Berry

Cynthia A. Phillips

Stat. Anal. Data Min., 2019

A Most Irrational Foraging Algorithm.

[BibT_eX]

[DOI]

CoRR, 2019

Resource-Competitive Sybil Defenses.

[BibT_eX]

[DOI]

CoRR, 2019

Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols.

[BibT_eX]

[DOI]

CoRR, 2019

Bootstrapping Public Blockchains Without a Trusted Setup.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Multiparty Interactive Communication with Private Channels.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Peace Through Superior Puzzling: An Asymmetric Sybil Defense.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018

Interactive communication with unknown noise rate.

[BibT_eX]

[DOI]

Inf. Comput., 2018

A resource-competitive jamming defense.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Communication-efficient randomized consensus.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016.

[BibT_eX]

[DOI]

CoRR, 2018

Tiny Groups Tackle Byzantine Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Proof of Work Without All the Work.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Sending a Message with Unknown Noise.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Distributed Computing with Channel Noise.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

A theoretical and empirical evaluation of an algorithm for self-healing computation.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Secure multi-party computation in large networks.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Good Things Come in LogLog(n)-Sized Packages: Robustness with Small Quorums.

[BibT_eX]

[DOI]

CoRR, 2017

TorBricks: Blocking-Resistant Tor Bridge Distribution.

[BibT_eX]

[DOI]

Jedidiah R. Crandall

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

2016

Editorial to the Special Issue on SODA'12.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Byzantine Agreement in Expected Polynomial Time.

[BibT_eX]

[DOI]

J. ACM, 2016

Secure one-way interactive communication.

[BibT_eX]

[DOI]

CoRR, 2016

Secure Multiparty Interactive Communication with Unknown Noise Rate.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Resource-Competitive Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2015

Secure Multi-Party Shuffling.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Scalable mechanisms for rational secret sharing.

[BibT_eX]

[DOI]

Varsha Dani

Distributed Comput., 2015

Cooperative Computing for Autonomous Data Centers.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Shuffle to Baffle: Towards Scalable Protocols for Secure Multi-party Shuffling.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

Interactive Communication with Unknown Noise Rate.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Millions of Millionaires: Multiparty Computation in Large Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Recent Results in Scalable Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Secure Anonymous Broadcast.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Self-healing Computation.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

(Near) optimal resource-competitive broadcast with jamming.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Faster Agreement via a Spectral Method for Detecting Malicious Behavior.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

2013

Towards Provably-Secure Scalable Anonymous Broadcast.

[BibT_eX]

[DOI]

Proceedings of the 3rd USENIX Workshop on Free and Open Communications on the Internet, 2013

Byzantine agreement in polynomial expected time: [extended abstract].

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Self-Healing of Byzantine Faults.

[BibT_eX]

[DOI]

Jeffrey Knockel

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

The Power of Mediation in an Extended El Farol Game.

[BibT_eX]

[DOI]

Dieter Mitsche

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Brief announcement: byzantine agreement with a strong adversary in polynomial expected time.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Brief announcement: scalable anonymous communication with byzantine adversary.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack.

[BibT_eX]

[DOI]

Thomas P. Hayes

Amitabh Trehan

Distributed Comput., 2012

Self-Healing Algorithms for Byzantine Faults

[BibT_eX]

[DOI]

Jeffrey Knockel

CoRR, 2012

Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary

[BibT_eX]

[DOI]

CoRR, 2012

Resource-Competitive Communication

[BibT_eX]

[DOI]

CoRR, 2012

Whiskey, Weed, and Wukan on the World Wide Web: On Measuring Censors' Resources and Motivations.

[BibT_eX]

[DOI]

Proceedings of the 2nd USENIX Workshop on Free and Open Communications on the Internet, 2012

Scalable Byzantine Agreement with a Random Beacon.

[BibT_eX]

[DOI]

Olumuyiwa Oluwasanmi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Resource-competitive analysis: a new perspective on attack-resistant distributed computing.

[BibT_eX]

[DOI]

Proceedings of the FOMC'12, 2012

2011

Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary.

[BibT_eX]

[DOI]

J. ACM, 2011

A note on improving the performance of approximation algorithms for radiation therapy.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks.

[BibT_eX]

[DOI]

Algorithmica, 2011

Three Researchers, Five Conjectures: An Empirical Analysis of TOM-Skype Censorship and Surveillance.

[BibT_eX]

[DOI]

Jeffrey Knockel

Jedidiah R. Crandall

Proceedings of the USENIX Workshop on Free and Open Communications on the Internet, 2011

Single valued combinatorial auctions with budgets.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Conflict on a communication channel.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Scalable rational secret sharing.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

Fast asynchronous Byzantine agreement and leader election with full information.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Scalable byzantine computation.

[BibT_eX]

[DOI]

SIGACT News, 2010

Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary

[BibT_eX]

[DOI]

CoRR, 2010

Combinatorial Auctions with Budgets

[BibT_eX]

[DOI]

CoRR, 2010

Algorithms for Data Migration.

[BibT_eX]

[DOI]

Algorithmica, 2010

Attack-resistant frequency counting.

[BibT_eX]

[DOI]

Bo Wu

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

An empirical study of a scalable Byzantine agreement algorithm.

[BibT_eX]

[DOI]

Olumuyiwa Oluwasanmi

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009

Fixed-Parameter Tractability and Improved Approximations for Segment Minimization

[BibT_eX]

[DOI]

CoRR, 2009

On the Power of Mediators.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Reducing communication costs in robust peer-to-peer networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

The forgiving tree: a self-healing distributed data structure.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Finding Spread Blockers in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Social Network Mining and Analysis, 2008

Picking up the Pieces: Self-Healing in reconfigurable networks.

[BibT_eX]

[DOI]

Amitabh Trehan

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2007

Censorship Resistant Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Amos Fiat

Theory Comput., 2007

Approximation algorithms for minimizing segments in radiation therapy.

[BibT_eX]

[DOI]

Shuang Luan

Inf. Process. Lett., 2007

Nonnegative integral subset representations of integer sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks

[BibT_eX]

[DOI]

CoRR, 2007

Choosing a Random Peer in Chord.

[BibT_eX]

[DOI]

Algorithmica, 2007

Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?.

[BibT_eX]

[DOI]

James Aspnes

Navin Rustagi

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Brief Announcement: Self-healing Algorithms for Reconfigurable Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2006

Scalable leader election.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

A framework for analysis of dynamic social networks.

[BibT_eX]

[DOI]

Tanya Y. Berger-Wolf

Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

Towards Secure and Scalable Computation in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Discrete sensor placement problems in distribution networks.

[BibT_eX]

[DOI]

Tanya Y. Berger-Wolf

William E. Hart

Math. Comput. Model., 2005

Parameters Affecting the Resilience of Scale-Free Networks to Random Failures

[BibT_eX]

[DOI]

Hamilton Link

Randall A. LaViolette

Terran Lane

CoRR, 2005

The Impact of Social Networks on Multi-Agent Recommender Systems

[BibT_eX]

[DOI]

Hamilton Link

Terran Lane

Randall A. LaViolette

CoRR, 2005

Making Chord Robust to Byzantine Attacks.

[BibT_eX]

[DOI]

Amos Fiat

Proceedings of the Algorithms, 2005

2004

Choosing a random peer.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2002

Censorship resistant peer-to-peer content addressable networks.

[BibT_eX]

[DOI]

Amos Fiat