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

Chris Peikert

Paper 2009/359

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

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.

Note: Subsumed by merged paper (with ePrint report 2009/351) appearing in Eurocrypt 2010; full version in ePrint report 2010/591.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: lattice-based cryptography signatures identity-based encryption
Contact author(s): cpeikert @ alum mit edu
History: 2010-12-02: revised; 2009-07-22: received; See all versions
Short URL: https://ia.cr/2009/359
License: CC BY

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},
      note = {\url{https://eprint.iacr.org/2009/359}},
      url = {https://eprint.iacr.org/2009/359}
}