Modeling complexity in secure distributed computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2584, Issue , 2003, Pages 57-61

  Cachin, Christian ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248890485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37795-6_11     Document Type: Article

References (12)

1. C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl, "Asynchronous verifiable secret sharing and proactive cryptosystems," in Proc. 9th ACM Conference on Computer and Communications Security (CCS), 2002.
2. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, "Secure and efficient asynchronous broadcast protocols (extended abstract)," in Advances in Cryptology: CRYPTO 2001 (J. Kilian, ed.), vol. 2139 of Lecture Notes in Computer Science, pp. 524-541, Springer, 2001.
3. C. Cachin, K. Kursawe, and V. Shoup, "Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography," in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 123-132, 2000.
4. R. Canetti and T. Rabin, "Fast asynchronous Byzantine agreement with optimal resilience," in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42-51, 1993. Updated version available from http://www.research.ibm.com/security/.
5. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Transactions on Information Theory, vol. 22, pp. 644-654, Nov. 1976.
6. M. J. Fischer, N. A. Lynch, and M. S. Paterson, "Impossibility of distributed consensus with one faulty process," Journal of the ACM, vol. 32, pp. 374-382, Apr. 1985.
7. O. Goldreich, Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
8. S. Goldwasser and S. Micali, "Probabilistic encryption," Journal of Computer and System Sciences, vol. 28, pp. 270-299, 1984.
9. S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM Journal on Computing, vol. 18, pp. 186-208, Feb. 1989.
10. K. Kursawe and V. Shoup, "Optimistic asynchronous atomic broadcast." Cryptology ePrint Archive, Report 2001/022, Mar. 2001. http://eprint.iacr.org/.
11. N. A. Lynch, Distributed Algorithms. San Francisco: Morgan Kaufmann, 1996.
12. M. Pease, R. Shostak, and L. Lamport, "Reaching agreement in the presence of faults," Journal of the ACM, vol. 27, pp. 228-234, Apr. 1980.