CryptoDB
A Provably Secure Nyberg-Rueppel Signature Variant with Applications
Authors: | |
---|---|
Download: | |
Abstract: | This paper analyzes the modified Nyberg-Rueppel signature scheme (mNR), proving it secure in the Generic Group Model (GM). We also show that the security of the mNR signature is equivalent (in the standard model) to that of a twin signature, while achieving computational and bandwidth improvements. As a provably secure signature scheme, mNR is very efficient. We demonstrate its practical relevance by providing an application to the construction of a provably secure, self-certified, identity-based scheme (SCID). SCID schemes combine some of the best features of both PKI-based schemes (functionally trusted authorities, public keys revocable without the need to change identifier strings) and ID-based ones (lower bandwidth requirements). The new SCID scheme matches the performance achieved by the most efficient ones based on the discrete logarithm, while requiring only standard security assumptions in the Generic Group Model. |
BibTeX
@misc{eprint-2004-12066, title={A Provably Secure Nyberg-Rueppel Signature Variant with Applications}, booktitle={IACR Eprint archive}, keywords={Generic Group Model, signature schemes, Nyberg-Rueppel variants, self-certified identity-based cryptography}, url={http://eprint.iacr.org/2004/093}, note={manuscript breno@cs.jhu.edu 12545 received 16 Apr 2004, last revised 7 May 2004}, author={Giuseppe Ateniese and Breno de Medeiros}, year=2004 }