Paper 2014/581 Original: eprint.iacr.org/2014/581 ↗
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
Abstract
We provide a generic transformation from any \emph{affine} message authentication code (MAC) to an identity-based encryption (IBE) scheme over pairing groups of prime order. If the MAC satisfies a security notion related to unforgeability against chosen-message attacks and, for example, the $k$-Linear assumption holds, then the resulting IBE scheme is adaptively secure. Our security reduction is tightness preserving, i.e., if the MAC has a tight security reduction so has the IBE scheme. Furthermore, the transformation also extends to hierarchical identity-based encryption (HIBE). We also show how to construct affine MACs with a tight security reduction to standard assumptions. This, among other things, provides a tightly secure IBE in the standard model.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2016-06-28: last updated
- 2014-07-30: published
- Short URL
- https://ia.cr/2014/581
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/581,
author = {Olivier Blazy and Eike Kiltz and Jiaxin Pan},
title = {(Hierarchical) Identity-Based Encryption from Affine Message Authentication},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/581},
year = {2014},
url = {https://eprint.iacr.org/2014/581}
}