[Resource Topic] 2009/359: Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography)

Welcome to the resource topic for 2009/359

Title:
Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography)

Authors: Chris Peikert

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.

ePrint: https://eprint.iacr.org/2009/359

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .