DMCA
A provably secure nyberg-rueppel signature variant with applications. Cryptology ePrint Archive, Report 2004/93 (2004)
Cached
Download Links
| Citations: | 5 - 0 self |
BibTeX
@MISC{Medeiros04aprovably,
author = {Breno De Medeiros},
title = {A provably secure nyberg-rueppel signature variant with applications. Cryptology ePrint Archive, Report 2004/93},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
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 [32], 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 PKIbased 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.
Keyphrases
provably secure nyberg-rueppel signature variant cryptology eprint archive generic group model standard model bandwidth improvement secure signature scheme discrete logarithm new scid scheme id-based one identifier string public key identity-based scheme practical relevance standard security assumption twin signature bandwidth requirement efficient one modified nyberg-rueppel signature scheme mnr signature provably secure
