Robust forward-secure signature schemes with proactive security

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

Volumn 1992, Issue , 2001, Pages 264-276

  Tzeng, Wen Guey ^a   Tzeng, Zhi Jia ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Forward security; Proactive; Signature; Threshold

Indexed keywords

CHROMIUM COMPOUNDS; PUBLIC KEY CRYPTOGRAPHY;

FORWARD SECURITY; FORWARD-SECURE SIGNATURES; PROACTIVE; PROACTIVE SECURITY; PROOF SYSTEM; SECRET SHARING SCHEMES; SIGNATURE; THRESHOLD;

AUTHENTICATION;

EID: 23044522217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44586-2_19     Document Type: Conference Paper

References (26)

1. N. Alon, Z. Galil, M. Yung, “Dynamic-resharing verifiable secret sharing”, European Symposium on Algorithms 95 (ESA 95), Lecture Notes in Computer Science 979, pp.523-537, Springer-Verlag, 1995.
2. M. Abdalla, S. Miner, C. Namprempre, “Forward security in threshold signature schemes”, manuscripts.
3. M. Abdalla, L. Reyzin, “A new forward-secure digital signature scheme”, Proceedings of Advances in Cryptology – Asiacrypt 2000, Springer-Verlag, 2000.
4. M. Ben-Or, S. Goldwasser, A. Wigderson, “Completeness theorems for noncryptographic fault-tolerant distributed computations”, Proceedings of the 20th ACM Symposium on Theory of Computing, pp.1-10, 1988.
5. M. Bellare, S. Miner, “A forward-secure digital signature scheme”, Proceedings of Advances in Cryptology – Crypto 99, Lecture Notes in Computer Science 1666, pp.431-448, Springer-Verlag, 1999.
6. M. Bellare, P. Rogaway,”Random oracles are practical: a paradigm for designing efficient protocols”, Proceedings of the First ACM Conference on Computer and Communications Security, pp.62-73, 1993.
7. D. Chaum, C. Crepeau, I. Damgard, “Multiparty unconditionally secure protocols”, Proceedings of the 20th ACM Symposium on Theory of Computing, pp.11-19, 1988.
8. D. Chaum, T. Pedersen, “Wallet databases with observers”, Proceedings of Advances in Cryptology – Crypto 92, pp.90-105, 1992.
9. U. Feige, A. Fiat, A. Shamir, “Zero-knowledge proof of identity”, Journal of Cryptology, Vol. 1, pp.77-94, 1988.
10. Y. Frankel, P. Gemmell, P. MacKenzie, M. Yung, “Optimal-resilience proactive public-key cryptosystems”, Proceedings of 38th Annual Symposium on Foundations of Computer Science, pp.384-393, IEEE, 1997.
11. Y. Frankel, P. Gemmell, P. MacKenzie, M. Yung, “Proactive RSA”, Proceedings of Advances in Cryptology – Crypto 97, Lecture Notes in Computer Science 1294, pp.440-454, Springer-Verlag, 1997.
12. Y. Frankel, P. MacKenzie, M. Yung, “Adaptively-secure optimal-resilience proactive RSA”, Proceedings of Advances in Cryptology – Asiacrypt 99, Lecture Notes in Computer Science 1716, pp.180-194, Springer-Verlag, 1999.
13. A. Fiat, A. Shamir, “How to prove yourself: practical solutions to identification and signature problems”, Proceedings of Advances in Cryptology – Crypto 86, Lecture Notes in Computer Science 263, pp.186-194, Springer-Verlag, 1986.
14. R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, “Robust threshold DSS dignatures”, Proceedings of Advances in Cryptology – Eurocrypt 96, Lecture Notes in Computer Science 1070, pp.354-371, Springer-Verlag, 1996.
15. R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, “Robust and efficient sharing of RSA functions”, Proceedings of Advances in Cryptology – Crypto 96, Lecture Notes in Computer Science 1109, pp.157-172, Springer-Verlag, 1996.
16. L. Guillou, J. Quisquater, “A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory”, Proceedings of Advances in Cryptology – Eurocrypt 88, Lecture Notes in Computer Science 330, pp.123-128, Springer-Verlag, 1988.
17. R. Gennaro, M. Rabin, T. Rabin, “Simplified VSS and fast-track multiparty computations with applications to threshold cryptography”, Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998.
18. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, M. Yung, “Proactive public key and signature systems”, Proceedings of the 4th ACM Symposium on Computer and Communication Security, 1997.
19. A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, “Proactive secret sharing or: how to cope with perpetual leakage”, Proceedings of Advances in Cryptology – Crypto 95, Lecture Notes in Computer Science 963, pp.339-352, Springer-Verlag, 1995.
20. I. Ingemarsson, G. Simmons, “A protocol to set up shared secret schemes without the assistance of a mutually trusted party”, Proceedings of Advances in Cryptology – Eurocrypt 90, Lecture Notes in Computer Science 473, pp.266-282, Springer-Verlag, 1990.
21. S. Micali, “A secure and efficient digital signature algorithm,” Technical Report MIT/LCS/TM-501, Massachusetts Institute of Technology, Cambridge, MA, 1994.
22. H. Ong, C. Schnorr, “Fast signature generation with a Fiat-Shamir like scheme”, Proceedings of Advances in Cryptology – Eurocrypt 90, Lecture Notes in Computer Science 473, pp.432-440, Springer-Verlag, 1990.
23. K. Ohta, T. Okamoto, “A modification of the Fiat-Shamir scheme”, Proceedings of Advances in Cryptology – Crypto 88, Lecture Notes in Computer Science 403, pp.232-243, Springer-Verlag, 1988.
24. R. Ostrovsky, M. Yung, “How to withstand mobile virus attacks”, Proceedings of the 10th ACM Symposium on Principles of Distributed Computing (PODC), pp. 51-61, 1991.
25. T. Rabin, “A simplified approach to threshold and proactive RSA”, Proceedings of Advances in Cryptology – Crypto 98, Lecture Notes in Computer Science 1462, pp.89-104, Springer-Verlag, 1998.
26. A. Shamir, “How to share a secret”, Communications of the ACM, 22(11), pp.612-613, 1979.