Asynchronous verifiable secret sharing and proactive cryptosystems

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2002, Pages 88-97

  Cachin, Christian ^a   Kursawe, Klaus ^a   Lysyanskaya, Anna ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Asynchronous; Model; Proactive; Secret sharing

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA; SERVERS;

ASYNCHRONOUS VERIFIABLE SECRET SHARING; SYNCHRONOUS NETWORK; THRESHOLD CRYPTOSYSTEMS;

CRYPTOGRAPHY;

EID: 0038687710     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computation. In Proc. 25th Annual ACM Symp. on Theory of Computing, 1993.
2. G. Bracha. An asynchronous [(n - 1)/3]-resilient consensus protocol. In Proc. 3rd ACM Symp. on Principles of Dist. Computing, pages 154-162, 1984.
3. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup. Secure and efficient asynchronous broadcast protocols (extended abstract). In J. Kilian, editor, CRYPTO 2001, volume 2139 of LNCS, pages 524-541. Springer, 2001.
4. C. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. In Proc. 19th ACM Symp. on Principles of Distributed Computing, pages 123-132, 2000.
5. R. Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, 1995.
6. R. Canetti, R. Gennaro, A. Herzberg, and D. Naor. Proactive security: Long-term protection against break-ins. RSA Laboratories' CryptoBytes, 3(1), 1997.
7. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proc. 30th Annual ACM Symp. on Theory of Computing, pages 209-218, 1998.
8. R. Canetti, S. Halevi, and A. Herzberg. Maintaining authenticated communication in the presence of break-ins. J. Cryptology, 13(1):61-106, 2000.
9. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. 25th Annual ACM Symp. on Theory of Computing, pages 42-51, 1993.
10. M. Castro and B. Liskov. Proactive recovery in Byzantine-fault-tolerant systems. In Proc. 3rd USENIX Symposium on Operating System Design and Implementation (OSDI'99), 1999.
11. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proc. 26th IEEE Symp. on Found. of Computer Science, pages 383-395, 1985.
12. Y. Desmedt. Threshold cryptography. European Trans. on Telecommunications, 5(4):449-457, 1994.
13. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, Apr. 1985.
14. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure key generation for discrete-log based cryptosystems. In J. Stern, editor, EUROCRYPT'99, volume 1592 of LNCS, pages 295-310. Springer, 1999.
15. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Computing, 18(1):186-208, Feb. 1989.
16. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, Apr. 1988.
17. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In S. J. Mullender, editor, Distributed Systems. ACM Press & Addison-Wesley, New York, 1993.
18. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing or how to cope with perpetual leakage. In D. Coppersmith, editor, CRYPTO '95, volume 963 of LNCS, pages 339-352. Springer, 1995.
19. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. on Programming Languages and Systems, 4(3):382-401, July 1982.
20. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. 10th ACM Symp. on Principles of Distributed Computing, pages 51-59, 1991.
21. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, Apr. 1980.
22. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, CRYPTO '91, volume 576 of LNCS, pages 129-140. Springer, 1992.
23. V. Shoup. Practical threshold signatures. In B. Preneel, editor, EUROCRYPT 2000, volume 1087 of LNCS, pages 207-220. Springer, 2000.
24. L. Zhou. Towards fault-tolerant and secure on-line services. PhD thesis, Cornell University, USA, 2001.