CryptoDB
Strongly Unforgeable Signatures and Hierarchical Identity-based Signatures from Lattices without Random Oracles
| Authors: | |
|---|---|
| Download: | |
| Abstract: | We propose a variant of Peikert's lattice-based existentially unforgeable signature scheme in the standard model. Our construction offers the same efficiency as Peikert's but supports the stronger notion of strong unforgeability. Strong unforgeability demands that the adversary is unable to produce a new message-signature pair (m, s), even if he or she is allowed to see a different signature sig' for m. In particular, we provide the first treeless signature scheme that supports strong unforgeability for the post-quantum era in the standard model. Moreover, we show how to directly implement identity-based, and even hierarchical identity-based, signatures (IBS) in the same strong security model without random oracles. An additional advantage of this direct approach over the usual generic conversion of hierarchical identity-based encryption to IBS is that we can exploit the efficiency of ideal lattices without significantly harming security. We equip all constructions with strong security proofs based on mild worst-case assumptions on lattices and we also propose concrete security parameters. |
BibTeX
@misc{eprint-2010-22971,
title={Strongly Unforgeable Signatures and Hierarchical Identity-based Signatures from Lattices without Random Oracles},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / Post-quantum cryptography, lattice cryptography, digital signatures, identity-based cryptography, standard model},
url={http://eprint.iacr.org/2010/070},
note={PQCrypto 2010 rueckert@cdc.informatik.tu-darmstadt.de 14669 received 10 Feb 2010, last revised 1 Mar 2010},
author={Markus Rückert},
year=2010
}