[Resource Topic] 2010/591: Bonsai Trees, or How to Delegate a Lattice Basis

Welcome to the resource topic for 2010/591

Bonsai Trees, or How to Delegate a Lattice Basis

Authors: David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert


We introduce a new \emph{lattice-based} cryptographic structure called a \emph{bonsai tree}, and use it to resolve some important open problems in the area. Applications of bonsai trees include: \begin{itemize} \item An efficient, stateless `hash-and-sign’ signature scheme in the \emph{standard model} (i.e., no random oracles), and \item The first \emph{hierarchical} identity-based encryption (HIBE) scheme (also in the standard model) that does not rely on bilinear pairings. \end{itemize} Interestingly, the abstract properties of bonsai trees seem to have no known realization in conventional number-theoretic cryptography.

ePrint: https://eprint.iacr.org/2010/591

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 .