Name
Abstract | ||
|---|---|---|
We describe an algorithm for fully-anonymous broadcast in large-scale networks. The protocol is similar to the dining cryptographers networks (DC-Nets) in that both are based on secure multi-party computation (MPC) techniques. However, we address the weaknesses of DC-Nets, which are poor scalability and vulnerability to jamming attacks. When compared to the state-of-the-art, our protocol reduces the total bit complexity from O(n2) to Õ(n) per anonymous message sent in a network of size n at the expense of an increase in total latency from O(1) to polylog(n). Our protocol can tolerate up to 1/3 dishonest parties, which are controlled by a static computationally-unbounded Byzantine adversary. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2484239.2484290 | PODC |
Keywords | Field | DocType |
total bit complexity,anonymous message,byzantine adversary,poor scalability,brief announcement,secure multi-party computation,total latency,dining cryptographers network,jamming attack,dishonest party,scalable anonymous communication,fully-anonymous broadcast,large-scale network,anonymity | Dining cryptographers problem,Broadcasting,Byzantine adversary,Computer security,Computer science,Latency (engineering),Anonymity,Quantum Byzantine agreement,Jamming,Distributed computing,Scalability | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josh Karlin | 1 | 193 | 20.74 |
| Joud Khoury | 2 | 17 | 5.43 |
| Jared Saia | 3 | 1019 | 96.95 |
| Mahdi Zamani | 4 | 73 | 9.32 |