We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Quisquater): each requiring just two modular exponentiations with a short exponent. All previously proposed forward-secure signature schemes took significantly longer to sign and verify than ordinary signature schemes.
Our scheme requires only fractional increases to the sizes of keys and signatures, and no additional public storage. Like the underlying Guillou-Quisquater scheme, our scheme is provably secure in the random oracle model.
Category / Keywords: public-key cryptography / Publication Info: to appear in Crypto-2001 Date: received 18 Jun 2001 Contact author: itkis at bu edu Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20010618:174719 (All versions of this report) Short URL: ia.cr/2001/048 Discussion forum: Show discussion | Start new discussion