IACR Cryptology ePrint Archive · 2009 · 45 citations · 18 references
ComputingComputer ScienceMathematicsAlgorithmsCryptographyNumber TheoryCryptographic AlgorithmsCryptographic ComplexityIdentity-based CryptographyLattice-based CryptographyNumber-theoretic AlgorithmsHierarchical Identity-based EncryptionIdentity-based EncryptionIdentity-based Encryption From LatticesSignature Schemes
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: • 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.
18
Identity-Based Encryption from the Weil Pairing
Dan Boneh, Matthew Franklin · SIAM Journal on Computing · 2003 · 3.6K citations
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005 · 2.2K citations
Universal one-way hash functions and their cryptographic applications