Adaptively-secure optimal-resilience proactive rsa

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

Volumn 1716, Issue , 1999, Pages 196-207

  Frankel, Yair ^a   MacKenzie, Philip ^b   Yung, Moti ^a  

^a CertCo ^*  (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

ADAPTIVE ADVERSARY; COMMUNICATION HISTORY; DISTRIBUTED PROTOCOLS; OPTIMAL RESILIENCE; SECURE SPACE;

CRYPTOGRAPHY;

EID: 84956868458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (34)

1. D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In Advances in Cryptology—EUROCRYPT 92, volume 658 of Lecture Notes in Computer Science, pages 307–323. Springer-Verlag, 24–28 May 1992.
2. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In STOC’96 [33], pages 639–648.
3. R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive security of threshold systems. to appear in Crypto’99, 1999.
4. R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, University of Amsterdam, 1995.
5. R. Cramer, I. Damgárd, and P. MacKenzie. Zk for free: the case of proofs of knowledge. manuscript, 1999.
6. Advances in Cryptology—CRYPTO’89, volume 435 of Lecture Notes in Computer Science. Springer-Verlag, 1990, 20–24 Aug. 1989.
7. Advances in Cryptology—CRYPTO’91, volume 576 of Lecture Notes in Computer Science. Springer-Verlag, 1992, 11–15 Aug. 1991.
8. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely (extended summary). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 522–533, Montréal, Québec, Canada, 23–25 May 1994.
9. Y. Desmedt. Threshold cryptosystems. In J. Seberry and Y. Zheng, editors, Advances in Cryptology—AUSCRYPT’92, volume 718 of Lecture Notes in Computer Science, pages 3–14, Gold Coast, Queensland, Australia, 13–16 Dec. 1992. Springer-Verlag.
10. Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures (extended abstract). In CRYPTO’91 [7], pages 457–469.
11. C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. In STOC’98 [34], pages 409–428.
12. C. Dwork and A. Sahai. Concurrent zero-knowledge: Reducing the need for timing constraints. In Krawczyk [27], pages 442–457.
13. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In CRYPTO’89 [6], pages 526–545.
14. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In 28th Annual Symposium on Foundations of Computer Science, pages 427–437, Los Angeles, California, 12–14 Oct. 1987. IEEE. 182
15. Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Optimal-resilience proactive public-key cryptosystems. In 38th Annual Symposium on Foundations of Computer Science, pages 384–393, Miami Beach, Florida, 20–22 Oct. 1997. IEEE. 181, 182
16. Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Proactive RSA. In Advances in Cryptology—CRYPTO’97, volume 1294 of Lecture Notes in Computer Science, pages 440–454. Springer-Verlag, 17–21 Aug. 1997.
17. Y. Frankel, P. Gemmell, and M. Yung. Witness-based cryptographic program checking and robust function sharing. In STOC’96 [33], pages 499–508.
18. Y. Frankel, P. D. MacKenzie, and M. Yung. Manuscript of current paper with complete proof.
19. Y. Frankel, P. D. MacKenzie, and M. Yung. Adaptively-secure distributed public-key systems. In European Symposium on Algorithms—ESA’99, volume 1643 of Lecture Notes in Computer Science, pages 4–27. Springer-Verlag, 16–18 July 1998.
20. Y. Frankel, P. D. MacKenzie, and M. Yung. Robust efficient distributed rsa-key generation. In STOC’98 [34], pages 663–672.
21. Y. Frankel and M. Yung. Distributed public-key cryptosystems. In H. Imai and Y. Zheng, editors, Advances in Public Key Cryptography—PKC’98, volume 1431 of Lecture Notes in Computer Science, pages 1–13. Springer-Verlag, Feb. 1998. invited talk.
22. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Advances in Cryptology—CRYPTO’96, volume 1109 of Lecture Notes in Computer Science, pages 157–172. Springer-Verlag, 18–22 Aug. 1996.
23. S. Goldwasser. Multi-party computations: Past and present. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pages 1–6, 1997. invited talk.
24. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public-key and signature schemes. In Proceedings of the Third Annual Conference on Computer and Communications Security, pages 100–110, 1996.
25. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing, or: How to cope with perpetual leakage. In Advances in Cryptology—CRYPTO’95, volume 963 of Lecture Notes in Computer Science, pages 339–352. Springer-Verlag, 27–31 Aug. 1995.
26. J. Kilian, E. Petrank, and C. Rackoff. Lower bounds for zero knowledge on the internet. In 39th Annual Symposium on Foundations of Computer Science, pages 484–492. IEEE, Nov. 1998. 193
27. H. Krawczyk, editor. Advances in Cryptology—CRYPTO’98, volume 1462 of Lecture Notes in Computer Science. Springer-Verlag, 17–21 Aug. 1998.
28. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pages 51–61, 1991.
29. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO’91 [7], pages 129–140.
30. T. Rabin. A simplified approach to threshold and proactive rsa. In Krawczyk [27], pages 89–104.
31. C. P. Schnorr. Efficient identification and signatures for smart cards. In CRYPTO’89 [6], pages 239–252.
32. A. Shamir. How to share a secret. Commun. ACM, 22:612–613, 1979.
33. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, 22–24 May 1996.
34. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, Texas, 23–26 May 1998.