Bonsai trees, or how to delegate a lattice basis
type: Item
instance of: scholarly article
title: Bonsai trees, or how to delegate a lattice basis
zbMATH Open document ID: 1277.94017
author: David Cash
author: Eike Kiltz
author: Chris Peikert
author: Dennis Hofheinz
published in: Journal of Cryptology
publication date: 2013-01-04T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/16843
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6121913
zbMATH Keywords: hierarchical identity-based encryption
zbMATH Keywords: digital signatures
zbMATH Keywords: bonsai trees
zbMATH Keywords: lattice-based cryptographic structure
Wikidata QID: Q59163683
describes a project that uses: NTRU
describes a project that uses: NTRUSign
MaRDI profile type: Publication
OpenAlex ID: W1983370494
cites work: Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Q5465355
cites work: Generating Shorter Bases for Hard Random Lattices
cites work: Q4474200
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Identity-Based Encryption from the Weil Pairing
cites work: Chosen‐Ciphertext Security from Identity‐Based Encryption
cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
cites work: Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
cites work: A forward-secure public-key encryption scheme
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: An Identity Based Encryption Scheme Based on Quadratic Residues
cites work: Public Key Encryption with Searchable Keywords Based on Jacobi Symbols
cites work: Public Key Broadcast Encryption for Stateless Receivers
cites work: Practical Identity-Based Encryption Without Random Oracles
cites work: Hierarchical Identity Based Encryption with Polynomially Many Levels
cites work: Hierarchical ID-Based Cryptography
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Q4364546
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Q3840170
cites work: Q4418531
cites work: Short and Stateless Signatures from the RSA Assumption
cites work: Q4737264
cites work: How Risky Is the Random-Oracle Model?
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: Asymptotically Efficient Lattice-Based Digital Signatures
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
cites work: Q4829810
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: A linear space algorithm for computing the hermite normal form
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: An Efficient and Parallel Gaussian Sampler for Lattices
cites work: Theory of Cryptography
cites work: Q3549647
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
cites work: Identity-Based Cryptosystems and Signature Schemes
cites work: Q4783735
cites work: Efficient Public Key Encryption Based on Ideal Lattices
cites work: Efficient Identity-Based Encryption Without Random Oracles
cites work: Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
DBLP publication ID: journals/joc/CashHKP12
DOI: 10.1007/S00145-011-9105-2
description: scientific article; zbMATH DE number 6121913