Reliable Broadcast in Unknown Fixed-Identity Networks (2005) [3 citations — 0 self]

Download:

by Lakshminarayanan Subramanian, Lakshminarayanan Subramanian, Randy H. Katz, Randy H. Katz, Volker Roth, Volker Roth, Scott Shenker, Scott Shenker, Ion Stoica, Ion Stoica

In PODC ’05: Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

http://digitalassets.lib.berkeley.edu/techreports/ucb/text/CSD-04-1358.pdf

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Subramanian05reliablebroadcast,
    author = {Lakshminarayanan Subramanian and Lakshminarayanan Subramanian and Randy H. Katz and Randy H. Katz and Volker Roth and Volker Roth and Scott Shenker and Scott Shenker and Ion Stoica and Ion Stoica},
    title = {Reliable Broadcast in Unknown Fixed-Identity Networks},
    booktitle = {In PODC ’05: Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing},
    year = {2005},
    pages = {342--351},
    publisher = {ACM Press}
}

Abstract:

In this paper, we formulate a new theoretical problem, namely the reliable broadcast problem in unknown fixedidentity networks. This problem arises in the context of developing decentralized security mechanisms in a specificclass of distributed systems: Consider an undirected graph G connecting n nodes where each node is aware of only its neighbors but not of the entire graph. Additionally, each node has a unique identity and cannot fake its identity to its neighbors. Assume that k among the n nodes act in an adversarial manner and the remaining n−k are good nodes. Under what constraints does there exist a distributed algorithm Γ that enables every good node v to reliably broadcast a message m(v) to all other good nodes in G? While good nodes follow the algorithm Γ, an adversary can additionally discard messages, generate spurious messages or collude with other

Citations

1062	Distributed Algorithms – Lynch - 1996
838	The Byzantine generals problem – Lamport, Shostak, et al. - 1982
546	Identity-based encryption from the Weil pairing – Boneh, Franklin
385	Reaching agreements in the presence of faults – Pease, Shostak, et al. - 1980
357	Identity-based cryptosystems and signature schemes – Shamir - 1984
214	A random graph model for massive graphs – Aiello, Chung, et al. - 2000
200	Peer-to-Peer: Harnessing the Power of Disruptive Technologies – Oram
179	A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms – Gamal - 1985
176	Development of the Domain Name System – Mockapetris, Dunlap - 1988
154	Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract – Ben-Or - 1983
131	Randomized Byzantine generals – Rabin - 1983
101	The Byzantine Generals Strike Again – Dolev - 1982
82	Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography – Cachin, Kursawe, et al. - 2000
82	Towards capturing representative as-level internet topologies – Chang, Govindan, et al. - 2004
70	The average distances in random graphs with given expected degrees – Chung, Lu - 2002
66	Perfectly Secure Message Transmission – Dolev, Dwork, et al. - 1993
62	Optimal algorithms for byzantine agreement – Feldman, Micali - 1988
62	Secure Border Gateway Protocol (Secure-BGP – Kent, Lynn, et al. - 2000
45	Listen and whisper: Security mechanisms for BGP – Subramanian, Roth, et al. - 2004
23	Random graphs of small order – Bollob'as, Thomason - 1985
14	Challenges in mobile ad hoc networking – Giordano, Lu - 2001
10	An Identity-Based Encryption Scheme Based on Quadratic Residues – Cocks - 2001
4	Efficient Reliable Communication over Partially Authenticated Networks – Beimel, Malka - 2003
3	BGP noise tonight? NANOG mail archives – Levine - 2001
2	AS7007! NANOG mail archives – MISEL - 1997
1	Congestion and Conductance in Power-law graphs – GKANTSIDIS, MIHAIL, et al. - 2003

View or Download | Add to My Collection | Correct Errors