Bonsai trees, or how to delegate a lattice basis
From MaRDI portal
Publication:1928766
DOI10.1007/s00145-011-9105-2zbMath1277.94017OpenAlexW1983370494WikidataQ59163683 ScholiaQ59163683MaRDI QIDQ1928766
Chris Peikert, Eike Kiltz, David Cash, Dennis Hofheinz
Publication date: 4 January 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/16843
digital signatureshierarchical identity-based encryptionbonsai treeslattice-based cryptographic structure
Related Items (39)
Generic Constructions of Revocable Identity-Based Encryption ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Black-box accumulation based on lattices ⋮ On the higher-bit version of approximate inhomogeneous short integer solution problem ⋮ Survey of information security ⋮ Lattice-based IBE with equality test supporting flexible authorization in the standard model ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Dynamic collusion bounded functional encryption from identity-based encryption ⋮ Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ More efficient adaptively secure lattice-based IBE with equality test in the standard model ⋮ Forward-secure encryption with fast forwarding ⋮ Candidate witness encryption from lattice techniques ⋮ Post-quantum asynchronous deniable key exchange and the signal handshake ⋮ Public key authenticated encryption with keyword search from LWE ⋮ A lattice-based forward secure IBE scheme for Internet of things ⋮ Adaptively secure inner product encryption from LWE ⋮ Updatable public key encryption in the standard model ⋮ Vector and functional commitments from lattices ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Efficient identity-based encryption with hierarchical key-insulation from HIBE ⋮ Efficient public-key encryption with equality test from lattices ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Simple and generic constructions of succinct functional encryption ⋮ Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption ⋮ Algebraic Attacks Against Several Weak Variants of GVW’13 ABE ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Unbounded multi-party computation from learning with errors ⋮ Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security ⋮ Algorithms for the Generalized NTRU Equations and their Storage Analysis ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Strongly unforgeable ring signature scheme from lattices in the standard model ⋮ Revocable hierarchical attribute-based signatures from lattices ⋮ Unnamed Item ⋮ Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance ⋮ The Complexity of Public-Key Cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- A forward-secure public-key encryption scheme
- A linear space algorithm for computing the hermite normal form
- Identity-Based Cryptosystems and Signature Schemes
- Public Key Broadcast Encryption for Stateless Receivers
- How Risky Is the Random-Oracle Model?
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Short and Stateless Signatures from the RSA Assumption
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- On Ideal Lattices and Learning with Errors over Rings
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
- An Efficient and Parallel Gaussian Sampler for Lattices
- Generalized Compact Knapsacks Are Collision Resistant
- Practical Identity-Based Encryption Without Random Oracles
- A Framework for Efficient and Composable Oblivious Transfer
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Efficient Public Key Encryption Based on Ideal Lattices
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Hierarchical ID-Based Cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Identity-Based Encryption from the Weil Pairing
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Generating Shorter Bases for Hard Random Lattices
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Asymptotically Efficient Lattice-Based Digital Signatures
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Public Key Encryption with Searchable Keywords Based on Jacobi Symbols
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Bonsai trees, or how to delegate a lattice basis
