Paper 2009/359 Original: eprint.iacr.org/2009/359 ↗
Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography)
Abstract
We introduce *bonsai trees*, a lattice-based cryptographic primitive that we apply to resolve some important open problems in the area. Applications of bonsai trees include: 1. An efficient, stateless `hash-and-sign' signature scheme in the *standard model* (i.e., no random oracles), and 2. The first *hierarchical* identity-based encryption (HIBE) scheme (also in the standard model) that does not rely on bilinear pairings. Interestingly, the abstract properties of bonsai trees seem to have no known realization in conventional number-theoretic cryptography.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2010-12-02: last updated
- 2009-07-22: published
- Short URL
- https://ia.cr/2009/359
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/359,
author = {Chris Peikert},
title = {Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography)},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/359},
year = {2009},
url = {https://eprint.iacr.org/2009/359}
}