Jared Saia
YOU?
Author Swipe
View article: Defending Hash Tables from Subterfuge with Depth Charge
Defending Hash Tables from Subterfuge with Depth Charge Open
We consider the problem of defending a hash table against a Byzantine attacker that is trying to degrade the performance of query, insertion and deletion operations. Our defense makes use of resource burning (RB)—the verifiable expenditure…
View article: Defending Hash Tables from Subterfuge with Depth Charge
Defending Hash Tables from Subterfuge with Depth Charge Open
We consider the problem of defending a hash table against a Byzantine attacker that is trying to degrade the performance of query, insertion and deletion operations. Our defense makes use of resource burning (RB) -- the the verifiable expe…
View article: Bankrupting DoS Attackers
Bankrupting DoS Attackers Open
Can we make a denial-of-service attacker pay more than the server and honest clients? Consider a model where a server sees a stream of jobs sent by either honest clients or an adversary. The server sets a price for servicing each job with …
View article: Bankrupting Sybil Despite Churn
Bankrupting Sybil Despite Churn Open
A Sybil attack occurs when an adversary controls multiple identifiers (IDs) in a system. Limiting the number of Sybil (bad) IDs to a minority is critical to the use of well-established tools for tolerating malicious behavior, such as Byzan…
View article: Resource Burning for Permissionless Systems
Resource Burning for Permissionless Systems Open
Proof-of-work puzzles and CAPTCHAS consume enormous amounts of energy and time. These techniques are examples of resource burning: verifiable consumption of resources solely to convey information. Can these costs be eliminated? It seems un…
View article: ToGCom: An Asymmetric Sybil Defense
ToGCom: An Asymmetric Sybil Defense Open
Proof-of-work (PoW) is one of the most common techniques to defend against Sybil attacks. Unfortunately, current PoW defenses have two main drawbacks. First, they require work to be done even in the absence of an attack. Second, during an …
View article: Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols Open
The last decade has seen substantial progress on designing Byzantine agreement algorithms which do not require all-to-all communication. However, these protocols do require each node to play a particular role determined by its ID. Motivate…
View article: Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols Open
The last decade has seen substantial progress on designing Byzantine agreement algorithms which do not require all-to-all communication. However, these protocols do require each node to play a particular role determined by its ID. Motivate…
View article: A Most Irrational Foraging Algorithm
A Most Irrational Foraging Algorithm Open
We present a foraging algorithm, GoldenFA, in which search direction is chosen based on the Golden Ratio. We show both theoretically and empirically that GoldenFA is more efficient for a single searcher than a comparable algorithm where se…
View article: Resource-Competitive Sybil Defenses
Resource-Competitive Sybil Defenses Open
Proof-of-work(PoW) is an algorithmic tool used to secure networks by imposing a computational cost on participating devices. Unfortunately, traditional PoW schemes require that correct devices perform significant computational work in perp…
View article: Information-Theoretically Secure Distributed Machine Learning
Information-Theoretically Secure Distributed Machine Learning Open
A previously obscure area of cryptography known as Secure Multiparty Computation (MPC) is enjoying increased attention in the field of privacy-preserving machine learning (ML), because ML models implemented using MPC can be uniquely resist…
View article: Making social networks more human: A topological approach
Making social networks more human: A topological approach Open
A key problem in social network analysis is to identify nonhuman interactions. State‐of‐the‐art bot‐detection systems like Botometer train machine‐learning models on user‐specific data. Unfortunately, these methods do not work on data sets…
View article: Multiparty Interactive Communication with Private Channels
Multiparty Interactive Communication with Private Channels Open
A group of n players wants to run a distributed protocol ℘ over a network where communication occurs via private point-to-point channels. Can we efficiently simulate ℘ in the presence of an adversary who knows ℘ and is able to maliciously …
View article: Bootstrapping Public Blockchains Without a Trusted Setup
Bootstrapping Public Blockchains Without a Trusted Setup Open
We propose a protocol that allows the participants of a permissionless decentralized system to agree on a set of identities in the presence of a computationally-bounded Byzantine adversary. Our protocol guarantees that the fraction of iden…
View article: Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016
Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016 Open
This is a correction by the authors to "Byzantine Agreement in Expected Polynomial Time" which appeared in the Journal of the ACM in 2016. It corrects a failure in the paper to consider the adversary's ability to decide the number of fair …
View article: Tiny Groups Tackle Byzantine Adversaries
Tiny Groups Tackle Byzantine Adversaries Open
A popular technique for tolerating malicious faults in open distributed systems is to establish small groups of participants, each of which has a non-faulty majority. These groups are used as building blocks to design attack-resistant algo…
View article: Sending a Message with Unknown Noise
Sending a Message with Unknown Noise Open
Alice and Bob are connected via a two-way channel, and Alice wants to send a message of $L$ bits to Bob. An adversary flips an arbitrary but finite number of bits, $T$, on the channel. This adversary knows our algorithm and Alice's message…
View article: Communication-efficient randomized consensus
Communication-efficient randomized consensus Open
We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchrono…
View article: Proof of Work Without All the Work: Computationally Efficient Attack-Resistant Systems
Proof of Work Without All the Work: Computationally Efficient Attack-Resistant Systems Open
Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a computational cost on participating devices. Unfortunately, traditional PoW schemes require that correct devices perform computational work perpetually, even …
View article: Distributed Computing with Channel Noise
Distributed Computing with Channel Noise Open
A group of $n$ users want to run a distributed protocol $π$ over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows $π$, is able to maliciously flip bits on the channels. Can we…
View article: TorBricks: Blocking-Resistant Tor Bridge Distribution
TorBricks: Blocking-Resistant Tor Bridge Distribution Open
Tor is currently the most popular network for anonymous Internet access. It critically relies on volunteer nodes called bridges for relaying Internet traffic when a user's ISP blocks connections to Tor. Unfortunately, current methods for d…
View article: Secure one-way interactive communication.
Secure one-way interactive communication. Open
Alice and Bob are connected via a two-way binary channel. This paper describes an algorithm to enable Alice to send a message to Bob when 1) an oblivious adversary flips an unknown number of bits, $T$, on the channel; and 2) the message le…
View article: Transmission Line Theory
Transmission Line Theory Open
This chapter presents aspects of transmission line theory that are beyond the techniques used to describe general two-port networks using scattering parameters. The extension of scattering parameters to multiport networks is straightforwar…
View article: Editorial to the Special Issue on SODA'12
Editorial to the Special Issue on SODA'12 Open
No abstract available.