Location of Repository

Bonsai Trees, or How to Delegate a Lattice Basis

By David Cash, Dennis Hofheinz, Eike Kiltz and Chris Peikert


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.

Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://iaks-www.ira.uka.de/fil... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.