DISTRIBUTED COMPUTING
Distributed computing studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network, often in order to accomplish a common goal. Such a system should work in spite of the existence of faulty components. Typical goals are “broadcast” and “leader election”, and typical fault models include “fail-stops”, “curious”, “malicious” groups of computers which collude against the rest of the system. Distributed systems come in many flavors: synchronous, asynchronous, with and without private channels or a public-key infrastructure.
DISTRIBUTED COMPUTING PUBLICATIONS
Akavia, A., Goldwasser, S., and Hazay, C. “Distributed Public Key Schemes Secure against Continual Leakage.” Proceedings of the 31th Annual ACM Symposium on Principles of Distributed Computing (PODC 2012), Funchal, Madeira, Portugal, pages 155-164, July 2012.
Goldwasser, S., Pavlov, E., and Vaikuntanathan, V. “Fault-Tolerant Distributed Computing in Full-Information Networks.” Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Berkeley, CA, October 2006.
Goldwasser, S. and Lindell, Y. “Secure Multi-Party Computation without Agreement.” J. Cryptology 18(3):247-287, 2005.
Goldwasser, S. and Lindell, Y. “Secure Computation without Agreement.” Proceedings of the 16th Int’l Symposium on DIStributed Computing (DISC 2002), pages 17-32, Toulouse, France, October 2002.
Canetti R. and Goldwasser S. “An efficient threshold public-key cryptosystem secure against adaptively chosen ciphertext attack.” In J. Stern, editor, Advances in Cryptology – EUROCRYPT ’99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May, 1999, volume 1592 of Lecture Notes in Computer Science, pages 90-106, Springer, 1999.
Goldwasser, S. “Multi-Party Computations: Past and Present.” Invited paper to Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), Santa Barbara, California, USA, August 21-24, 1997.
Goldreich, O., Goldwasser S., and Linial N. “Fault Tolerant Distributed Computation in the Full Information Model.” Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS 1991), Puerto Rico, October 1991.
Goldwasser, S. and Levin L. “Fair Computation of General Functions in Presence of Immoral Majority.” A. Menezes, S. Vanstone, editors Advances in Cryptology (Proceedings of CRYPTO90, Santa Barbara, CA, August 1990), volume 537 of Lecture Notes in Computer Science, 1991. Springer.
Beaver, D. and Goldwasser, S. “Multi Party Fault Tolerant Computation with Faulty Majority Based on Oblivious Transfer.” Proceedings of 30th Annual Symposium on Foundations of Computer Science (FOCS89), Duke, NC, October 1989.
Beaver, D. and Goldwasser, S. “Multi Party Fault Tolerant Computation with Faulty Majority.” G. Brassard, editor, Advances in Cryptology – Proceedings of 9th Annual Intl. Cryptology Conference (Crypto89), volume 435 of Lecture Notes in Computer Science, pages 589-590, 1989. Springer.
Chor, B., Goldwasser S., Micali S., and Awerbuch B. “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults.” Proceedings of 26th Annual Symposium on the Foundations of Computer Science (FOCS 1985), pages 383-395, October 1985.
DISTRIBUTED COMPUTING CONFERENCES