Bonsai trees, or how to delegate a lattice basis

  • Authors:
  • David Cash;Dennis Hofheinz;Eike Kiltz;Chris Peikert

  • Affiliations:
  • University of California, San Diego;Karlsruhe Institute of Technology;Cryptology & Information Security Group, CWI, Amsterdam, The Netherlands;Georgia Institute of Technology

  • Venue:
  • EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.