Abstract
We construct the first efficient forward-secure digital signature scheme where the total number of time periods for which the public key is used does not have to be fixed in advance. The number of time periods for which our scheme can be used is bounded only by an exponential function of the security parameter (given this much time, any scheme can be broken by exhaustive search), and its performance depends (minimally) only on the time elapsed so far. Our scheme achieves excellent performance overall, is very competitive with previous schemes with respect to all parameters, and outperforms each of the previous schemes in at least one parameter. Moreover, the scheme can be based on any underlying digital signature scheme, and does not rely on specific assumptions. Its forward security is proven in the standard model, without using a random oracle. As an intermediate step in designing our scheme, we propose and study two general composition operations that can be used to combine any existing signature schemes (whether standard or forward-secure) into new forward-secure signature schemes.
Supported in part by NSF Career Award CCR-0093029
Supported in part by a Graduate Diversity Fellowship from the San Diego Supercomputer Center, and Mihir Bellare’s 1996 Packard Foundation Fellowship in Science and Engineering
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Anderson. Two remarks on public-key cryptology. Manuscript, Sep. 2000. Relevant material presented by the author in an invited lecture at the Fourth ACM Conference on Computer and Communications Security (Apr. 1997).
M. Abdalla and L. Reyzin. A new forward-secure digital signature scheme. In Advances in Cryptology-Asiacrypt 2000, LNCS 1976 (Dec. 2000), pp. 116–129.
M. Bellare and S. Miner. A forward-secure digital signature scheme. In Advances in Cryptology-CRYPTO’ 99, LNCS 1666 (Aug. 1999), pp. 431–448.
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal of Computing 13(4)(Nov. 1984), pp. 850–864.
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4)(Oct. 1986), pp. 281–308. Preliminary version in the Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1984, pp 464–479.
S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17(2) (Apr. 1988), pp. 281–308.
L.C. Guillou and J.J. Quisquater. A “paradoxical” identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology-CRYPTO’ 88, LNCS 403 (Aug. 1988), pp. 216–231.
G. Itkis and L. Reyzin. Forward-secure signatures with optimal signing and verifying. In Advances in Cryptology-CRYPTO’ 01, LNCS 2139 (Aug. 2001), pp. 332–354.
H. Krawczyk. Simple forward-secure signatures from any signature scheme. In Seventh ACM Conference on Computer and Communications Security (Nov. 2000), pp. 108–115.
R. C. Merkle. A certified digital signature. In Advances in Cryptology-CRYPTO’ 89, (Aug. 1989), pp. 218–238.
S. Micali. A secure and efficient digital signature algorithm. Technical Report MIT/LCS/TM-501, Massachusetts Institute of Technology, March 1994.
T. Malkin, D. Micciancio and S. Miner. Efficient generic forward-secure signatures with and unbounded number of time periods. Full version of this paper, available at http://eprint.iacr.org/2001/034/.
M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the ACM Symposium on Theory of Computing, 1989, pp. 33–43.
M. Rabin. Digital signatures and public key functions as intractable as factorization. MIT Laboratory for Computer Science Report TR-212, January 1979.
J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the ACM Symposium on Theory of Computing, 1990, pp. 387–394.
A. Yao. Theory and applications of trapdoor functions. In Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malkin, T., Micciancio, D., Miner, S. (2002). Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_27
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive