Valerie King
Jared Saia
- M. Abd-El-Malek, G. Ganger, G. Goodson, M. Reiter, and J. Wylie. Fault-scalable Byzantine faulttolerant services. ACM SIGOPS Operating Systems Review, 39(5):74, 2005. Google Scholar
Digital Library
- I. Abraham, D. Dolev, R. Gonen, and J. Halper. Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In Principles of Distributed Computing( PODC), 2006. Google ScholarDigital Library
- I. Abraham, D. Dolev, and J. Halper. Lower bounds on implementing robust and resilient mediators. In IACR Theory of Cryptography Conference(TCC), 2008. Google ScholarDigital Library
- A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Annual Symposium on Operating Systems Design and Implementation (OSDI), 2002. Google ScholarDigital Library
- R. Anderson and T. Moore. The economics of information security. Science, 314(5799):610--613, 2006.Google ScholarCross Ref
- R. Anderson and T. Moore. Information security economics - and beyond. In CRYPTO, pages 68--91, 2007. Google ScholarDigital Library
- R. J. Anderson. Why information security is hard-an economic perspective. In ACSAC, pages 358--365. IEEE Computer Society, 2001. Google ScholarDigital Library
- J. Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. Journal of the Association for Computing Machinery, 45(3):415--450, May 1998. Google ScholarDigital Library
- J. Aspnes, K. Chang, and A. Yampolskiy. Inoculation strategies for victims of viruses and the sum-of-squares partition problem. Journal of Computer and System Science, 72(6):1077--1093, 2006. Google ScholarDigital Library
- H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. J. ACM, 55(5), 2008. Google ScholarDigital Library
- B. Awerbuch and C. Scheideler. Towards a scalable and robust dht. Theory Comput. Syst., 45(2):234- 260, 2009. Google ScholarDigital Library
- M. Ben-Or. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols. In Proceedings of the second annual ACM symposium on Principles of distributed computing, pages 27--30. ACM New York, NY, USA, 1983. Google ScholarDigital Library
- F. Berman, G. Fox, and A. Hey. Grid computing: making the global infrastructure a reality. John Wiley & Sons Inc, 2003. Google ScholarDigital Library
- V. Bhandari and N. H. Vaidya. On reliable broadcast in a radio network. In 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 138--147, 2005. Google ScholarDigital Library
- V. Bhandari and N. H. Vaidya. On reliable broadcast in a radio network: A simplified characterization. Technical report, CSL, UIUC, May 2005.Google Scholar
- V. Bhandhari, J. Katz, C.-Y. Koo, and N. Vaidya. Reliable broadcast in radio networks: The bounded collision case. In 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 258 - 264, 2006. Google ScholarDigital Library
- E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer. Brahms: Byzantine resilient random membership sampling. Computer Networks, 53(13):2340--2359, 2009. Google ScholarDigital Library
- G. Bracha. An asynchronous {(n - 1)/3}-resilient consensus protocol. In PODC '84: Proceedings of the third annual ACM symposium on Principles of distributed computing, pages 154--162, New York, NY, USA, 1984. ACM. Google ScholarDigital Library
- M. Castro and B. Liskov. Practical Byzantine fault tolerance. Operating Systems Review, 33:173--186, 1998.Google ScholarDigital Library
- C.-F. Cheng, S.-C. Wang, and T. Liang. The anatomy study of server-initial agreement for general hierarchy wired/wireless networks. Computer Standards & Interfaces, 31(1):219 - 226, 2009. Google ScholarDigital Library
- B. Chun, P. Maniatis, S. Shenker, and J. Kubiatowicz. Attested append-only memory: making adversaries stick to their word. ACM SIGOPS Operating Systems Review, 41(6):189--204, 2007. Google ScholarDigital Library
- A. Clement, M. Kapritsos, S. Lee, Y. Wang, L. Alvisi, M. Dahlin, and T. Riché. Upright cluster services. In Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, pages 277--290. ACM, 2009. Google ScholarDigital Library
- A. Clement, M. Marchetti, E. Wong, L. Alvisi, and M. Dahlin. Byzantine fault tolerance: the time is now. In LADIS '08: Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware, pages 1--4, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- A. Clement, E. Wong, L. Alvisi, M. Dahlin, and M. Marchetti. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, 2009.Google Scholar
- J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. Hq replication: A hybrid quorum protocol for byzantine fault tolerance. In In Proceedings of Operating Systems Design and Implementation (OSDI), San Diego, CA, USA, 2005. Google ScholarDigital Library
- J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of the 7th symposium on Operating systems design and implementation, page 190. USENIX Association, 2006. Google ScholarDigital Library
- F. Cristian, H. Aghili, R. Strong, and D. Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. Information and Computation, 118(1):158, 1995. Google ScholarDigital Library
- D. Dolev and R. Reischuk. Bounds on information exchange for byzantine agreement. Journal of the ACM, 32(1):191--204, 1985. Google ScholarDigital Library
- V. Drabkin, R. Friedman, and M. Segal. Efficient byzantine broadcast in wireless ad-hoc networks. In International Conference on Dependable Systems and Networks (ICDSN), pages 160--169, 2005. Google ScholarDigital Library
- C. Dwork, D. Peleg, N. Pippenger, and E. Upfal. Fault tolerance in networks of bounded degree. In Proceedings of the eighteenth annual ACM symposium on Theory of computing, page 379. ACM, 1986. Google ScholarDigital Library
- Farsite. The Farsite Project. http://research.microsoft.com/farsite.Google Scholar
- U. Feige. Noncryptographic selection protocols. In FOCS, pages 142--153, 1999. Google ScholarDigital Library
- P. Feldman and S. Micali. Byzantine agreement in constant expected time (and trusting no one). In FOCS, pages 267--276, 1985. Google ScholarDigital Library
- M. Fischer. The consensus problem in unreliable distributed systems (a brief survey). In Fundamentals of Computation Theory, pages 127--140, 1983. Google ScholarDigital Library
- M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382, 1985. Google ScholarDigital Library
- I. T. Foster, N. R. Jennings, and C. Kesselman. Brain meets brawn: Why grid and agents need each other. In P. Ritrovato, S. A. Cerri, S. Salerno, M. Gaeta, C. Allison, and T. Dimitrakos, editors, Towards the Learning Grid, volume 127 of Frontiers in Artificial Intelligence and Applications, pages 28--40. IOS Press, 2005. Google ScholarDigital Library
- N. Fultz and J. Grossklags. Blue versus red: Towards a model of distributed security attacks. In Financial Cryptography, pages 167--183, 2009. Google ScholarDigital Library
- R. Gradwohl, S. P. Vadhan, and D. Zuckerman. Random selection with an adversarial majority. In CRYPTO, pages 409--426, 2006. Google ScholarDigital Library
- M. Humphrey and M. Thompson. Security Implications of Typical Grid Computing Usage Scenarios, 2000. Security Working Group GRIP forum draft.Google Scholar
- N. R. Josep Diaz, Dieter Mitsche and J. Saia. On the power of mediators. In Proceedings of the Workshop on Internet and Network Economics (WINE), 2009. Google ScholarDigital Library
- B. M. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Fast asynchronous byzantine agreement and leader election with full information. In SODA, pages 1038--1047, 2008. Google ScholarDigital Library
- M. J. Kearns and L. E. Ortiz. Algorithms for interdependent security games. In Advances in Neural Information Processing Systems (NIPS), 2003.Google Scholar
- V. King, S. Lonergan, J. Saia, and A. Trehan. Load balanced scalable byzantine agreement through quorum building, with full information. In submitted to ICDCN, 2011. Google ScholarDigital Library
- V. King, C. A. Phillips, J. Saia, and M. Young. Sleeping on the job: energy-efficient and robust broadcast for radio networks. In R. A. Bazzi and B. Patt-Shamir, editors, PODC, pages 243--252. ACM, 2008. Google ScholarDigital Library
- V. King and J. Saia. From almost everywhere to everywhere: Byzantine agreement with Üo(n3/2) bits. In DISC, pages 464--478, 2009. Google ScholarDigital Library
- V. King and J. Saia. Breaking the o(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary. In PODC, 2010. Google ScholarDigital Library
- V. King, J. Saia, V. Sanwalani, and E. Vee. Scalable leader election. In SODA, pages 990--999, 2006. Google ScholarDigital Library
- V. King, J. Saia, V. Sanwalani, and E. Vee. Towards secure and scalable computation in peer-to-peer networks. In FOCS, pages 87--98, 2006. Google ScholarDigital Library
- G. Kol and M. Naor. Games for exchanging information. In Proceedings of the Symposium on the Theory of Computing, 2008. Google ScholarDigital Library
- R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: speculative byzantine fault tolerance. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, page 58. ACM, 2007. Google ScholarDigital Library
- E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999. Google ScholarDigital Library
- J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2000. Google ScholarDigital Library
- L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):401, 1982. Google ScholarDigital Library
- H. Li, A. Clement, E.Wong, J. Napper, I. Roy, L. Alvisi, and M. Dahlin. BAR gossip. In Proceedings of the 7th symposium on Operating systems design and implementation, page 204. USENIX Association, 2006. Google ScholarDigital Library
- Y. Mao, F. Junqueira, and K. Marzullo. Towards low latency state machine replication for uncivil wide-area networks. In Workshop on Hot Topics in System Dependability. Citeseer, 2009.Google Scholar
- Y. Minsky and F. Schneider. Tolerating malicious gossip. Distributed Computing, 16(1):49--68, 2003. Google ScholarDigital Library
- T. Ngan, D.Wallach, and P. Druschel. Enforcing fair sharing of peer-to-peer resources. In International Workshop on Peer-to-Peer Systems (IPTPS), 2003.Google ScholarCross Ref
- Nisan, Roughgarden, Tardos, and Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007. Google ScholarDigital Library
- Oceanstore. The Oceanstore Project. http://oceanstore.cs.berkeley.edu.Google Scholar
- A. Patra and P. Rangan. Brief announcement: Communication efficient asynchronous byzantine agreement. In PODC '10: Proceedings of the 28th ACM symposium on Principles of distributed computing, pages 243--244, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz. Pond: the OceanStore prototype. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pages 1--14, 2003. Google ScholarDigital Library
- F. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys (CSUR), 22(4):319, 1990. Google ScholarDigital Library
- E. Shi, A. Perrig, et al. Designing secure sensor networks. IEEE Wireless Communications, 11(6):38- 43, 2004. Google ScholarDigital Library
- I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceedings of the 2001 ACM SIGCOMM Conference, 2001. Google ScholarDigital Library
- E. Upfal. Tolerating linear number of faults in networks of bounded degree. In Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, pages 83--89. ACM New York, NY, USA, 1992. Google ScholarDigital Library
- V. Vishnumurthy, S. Chandrakumar, and E. Sirer. Karma: A secure economic framework for peer-topeer resource sharing. In Workshop on Economics of Peer-to-Peer Systems, 2003.Google Scholar
- Wikipedia. Anonymous Peer-to-peer. http://en.wikipedia.org/wiki/AnonymousP2P.Google Scholar
- J. Yan, S. Early, and R. Anderson. The xenoservice-a distributed defeat for distributed denial of service. Proceedings of Information Survivability Workshop (ISW), 2000.Google Scholar
Recommendations
Scalable and unconditionally secure multiparty computation
CRYPTO'07: Proceedings of the 27th annual international cryptology conference on Advances in cryptologyWe present a multiparty computation protocol that is unconditionally secure against adaptive and active adversaries, with communication complexity O(Cn)k + O(Dn2)k + poly(nκ), where C is the number of gates in the circuit, n is the number of parties, k ...
Asynchronous Byzantine Agreement with optimal resilience
We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving $$n = 3t+1$$n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting ...
Lower bound for scalable Byzantine Agreement
We consider the problem of computing Byzantine Agreement in a synchronous network with n processors, each with a private random string, where each pair of processors is connected by a private communication line. The adversary is malicious and non-...
Comments