Abstract
We construct forward-secure threshold signature schemes. These schemes have the following property: even if more than the threshold number of players are compromised, it is not possible to forge signatures relating to the past. This property is achieved while keeping the public key fixed and updating the secret keys at regular intervals. The schemes are reasonably efficient in that the amount of secure storage, the signature size and the key lengths do not vary proportionally to the number of time periods during the lifetime of the public key. Both proposed schemes are based on the Bellare-Miner forward-secure signature scheme. One scheme uses multiplicative secret sharing and tolerates mobile eavesdropping adversaries. The other scheme is based on polynomial secret sharing and tolerates mobile halting adversaries. We prove both schemes secure via reduction to the Bellare-Miner scheme, which is known to be secure in the random oracle model assuming that factoring is hard.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Abdalla, S. Miner, and C. Namprempre. Forward secure threshold signature schemes. Full version of this paper, available from the authors.
R. Anderson. Two remarks on public-key cryptology. Manuscript, Sep. 2000. Relevant material first presented by the author in an Invited Lecture at the Fourth Annual Conference on Computer and Communications Security, Zurich, Switzerland, Apr. 1997.
M. Bellare and S. Miner. A forward-secure digital signature scheme. In M. Wiener, editor, Proc. of CRYPTO’ 99, volume 1666 of LNCS, pages 431–448. Springer-Verlag, Aug. 1999.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In Proc. of STOC’98, pages 1–10, New York, 1988. ACM Press.
M. Burmester, Y. Desmedt, and J. Seberry. Equitable key escrow with limited time span (or how to enforce time expiration cryptographically). In K. Ohta, editor, Proc. of ASIACRYPT’ 98, volume 1514 of LNCS. Springer-Verlag, 1998.
Y. Desmedt. Threshold cryptosystems. In J. Seberry and Y. Zheng, editors, Proc. ofAUSCRYPT’ 92, volume 718 of LNCS. Springer-Verlag, 1993.
Y. Desmedt, G. Di Crescenzo, and M. Burmester. Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In J. Pieprzyk and R. Safavi-Naini, editors, Proc. of ASIACRYPT’ 94, volume 917 of LNCS. Springer-Verlag, 1995.
Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Proc. of CRYPTO’ 91, volume 576 of LNCS, pages 457–469. Springer-Verlag, Aug. 1991.
A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Proc. of CRYPTO’ 86, volume 263 of LNCS, pages 186–194. Springer-Verlag, Aug. 1986.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In U. Maurer, editor, Proc. of EUROCRYPT’ 96, volume 1070 of LNCS, pages 354–371. Springer-Verlag, May 1996.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In J. Stern, editor, Proc. of EUROCRYPT’99, volume 1592 of LNCS, pages 295–310. Springer-Verlag, May 1999.
R. Gennaro, M. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. of PODC’98, 1998.
A. Herzberg, M. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing or: How to cope with perpetual leakage. In D. Coppersmith, editor, Proc. of CRYPTO’ 95, volume 963 of LNCS, pages 339–352. Springer-Verlag, Aug. 1995.
I. Ingemarsson and G. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. In I. Damgård, editor, Proc. of EUROCRYPT’ 90, volume 473 of LNCS, pages 266–282. Springer-Verlag, May 1990.
H. Ong and C. Schnorr. Fast signature generation with a Fiat Shamir-like scheme. In I. Damgår, editor, Proc. of EUROCRYPT’ 90, volume 473 of LNCS, pages 432–440. Springer-Verlag, May 1990.
A. Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11):612–613, Nov. 1979.
V. Shoup. Practical threshold signatures. In B. Preneel, editor, Proc. of EUROCRYPT’ 96, volume 1807 of LNCS. Springer-Verlag, May 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdalla, M., Miner, S., Namprempre, C. (2001). Forward-Secure Threshold Signature Schemes. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_32
Download citation
DOI: https://doi.org/10.1007/3-540-45353-9_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41898-6
Online ISBN: 978-3-540-45353-6
eBook Packages: Springer Book Archive