International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Bonsai Trees, or How to Delegate a Lattice Basis

Authors:
David Cash
Dennis Hofheinz
Eike Kiltz
Chris Peikert
Download:
DOI: 10.1007/s00145-011-9105-2
Search ePrint
Search Google
Abstract: We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include an efficient, stateless ‘hash-and-sign’ signature scheme in the standard model (i.e., no random oracles), and 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.
BibTeX
@article{jofc-2012-29488,
  title={Bonsai Trees, or How to Delegate a Lattice Basis},
  journal={Journal of Cryptology},
  publisher={Springer},
  volume={25},
  pages={601-639},
  doi={10.1007/s00145-011-9105-2},
  author={David Cash and Dennis Hofheinz and Eike Kiltz and Chris Peikert},
  year=2012
}