Bonsai Trees, or How to Delegate a Lattice Basis

DOI10.1007/978-3-642-13190-5_27zbMath1280.94043WikidataQ26215797 ScholiaQ26215797MaRDI QIDQ3563854

Chris Peikert, Dennis Hofheinz, David Cash, Eike Kiltz

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_27

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications, Improved (Hierarchical) Inner-Product Encryption from Lattices, Lattice-based linearly homomorphic signature scheme over binary field, A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model, An efficient IBE scheme with tight security reduction in the random oracle model, Efficient multi-party concurrent signature from lattices, Lattice-based linearly homomorphic signatures in the standard model, Policy-based signature scheme from lattices, Tightly secure signatures from lossy identification schemes, Shorter identity-based encryption via asymmetric pairings, Programmable hash functions and their applications, Strongly secure authenticated key exchange from factoring, codes, and lattices, Algebraic (trapdoor) one-way functions: constructions and applications, Generating shorter bases for hard random lattices, Efficient selective identity-based encryption without random oracles, Verifiable random functions: relations to identity-based key encapsulation and new constructions, Gaussian sampling of lattices for cryptographic applications, Lattice-based key exchange on small integer solution problem, Lattice-based certificateless encryption scheme, Hardness of \(k\)-LWE and applications in traitor tracing, Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption, A lattice-based identity-based proxy blind signature scheme in the standard model, An efficient homomorphic aggregate signature scheme based on lattice, A lattice-based group signature scheme with verifier-local revocation, Bonsai trees, or how to delegate a lattice basis, Relations between semantic security and anonymity in identity-based encryption, Deterministic public-key encryption for adaptively-chosen plaintext distributions, Confined guessing: new signatures from standard assumptions, Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key, Revocable attribute-based proxy re-encryption, Optimal broadcast encryption from pairings and LWE, Impossibility results for lattice-based functional encryption schemes, Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}, New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts, Multiparty reusable non-interactive secure computation from LWE, Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption, A lattice-based fully dynamic group signature scheme without NIZK, Exact lattice sampling from non-Gaussian distributions, Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance, Identity-based encryption with security against the KGC: a formal model and its instantiations, Wildcarded identity-based encryption from lattices, LWE from non-commutative group rings, Chosen-ciphertext lattice-based public key encryption with equality test in standard model, Adaptively secure constrained pseudorandom functions in the standard model, Progressive and efficient verification for digital signatures, Password protected secret sharing from lattices, Implementation of lattice trapdoors on modules and applications, Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\), Short identity-based signatures with tight security from lattices, Key-homomorphic pseudorandom functions from LWE with small modulus, Integral matrix Gram root and lattice Gaussian sampling without floats, Functional encryption for Turing machines with dynamic bounded collusion from LWE, Does Fiat-Shamir require a cryptographic hash function?, Attribute-based access control for inner product functional encryption from LWE, Attribute-based conditional proxy re-encryption in the standard model under LWE, Lattice-based HRA-secure attribute-based proxy re-encryption in standard model, Puncturable identity-based and attribute-based encryption from lattices, Lattice-based public-key encryption with equality test supporting flexible authorization in standard model, A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme, Lattice trapdoors and IBE from middle-product LWE, Identity-based key-exposure resilient cloud storage public auditing scheme from lattices, Group signature from lattices preserving forward security in dynamic setting, Trapdoor delegation and HIBE from middle-product LWE in standard model, Doubly spatial encryption from DBDH, Anonymous HIBE with short ciphertexts: full security in prime order groups, Lattice-based group signatures: achieving full dynamicity (and deniability) with ease, Fully leakage-resilient signatures, Anonymous and leakage resilient IBE and IPE, Lattice-based completely non-malleable public-key encryption in the standard model, A lattice-based signcryption scheme without random oracles, Attribute-based proxy re-encryption from standard lattices, CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors, Non-committing encryption with constant ciphertext expansion from standard assumptions, Ring-based identity based encryption -- asymptotically shorter MPK and tighter security, Direct computation of branching programs and its applications to more efficient lattice-based cryptography, Generic Construction of UC-Secure Oblivious Transfer, Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography, Verifiable Random Functions from Standard Assumptions, A Lattice-Based Group Signature Scheme with Message-Dependent Opening, Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions, Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes, Cryptography from Learning Parity with Noise, Augmented Learning with Errors: The Untapped Potential of the Error Term, Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps, Identity-Based Blind Signature from Lattices in Standard Model, Secure multi-source network coding scheme with lattice signature, Better Key Sizes (and Attacks) for LWE-Based Encryption, One-Time Signatures and Chameleon Hash Functions, The Geometry of Lattice Cryptography, Anonymous Encryption with Partial-Order Subset Delegation Functionality, Efficient Threshold Encryption from Lossy Trapdoor Functions, Deniable Attribute Based Encryption for Branching Programs from LWE, Compact (Targeted Homomorphic) Inner Product Encryption from LWE, Compact Inner Product Encryption from LWE, Compact Hierarchical IBE from Lattices in the Standard Model, Simplified Revocable Hierarchical Identity-Based Encryption from Lattices, Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease, Zero-Knowledge Interactive Proof Systems for New Lattice Problems, Attribute-Based Keyword Search from Lattices, Isochronous Gaussian Sampling: From Inception to Implementation, Towards a Simpler Lattice Gadget Toolkit, Collusion Resistant Traitor Tracing from Learning with Errors, Multi-theorem preprocessing NIZKs from lattices, Generic constructions of integrated PKE and PEKS, Tighter security proofs for GPV-IBE in the quantum random oracle model, Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices, Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices, Adaptive oblivious transfer with access control from lattice assumptions, Survey of Lattice-Based Group Signature, Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy, Succinct vector, polynomial, and functional commitments from lattices, Efficient laconic cryptography from learning with errors, Unique-path identity based encryption with applications to strongly secure messaging, A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling, On Constructing Pairing-Free Identity-Based Encryptions, Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors, A note on the post-quantum security of (ring) signatures, Multi-authority ABE from lattices without random oracles, Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities, Preimage sampling in the higher-bit approximate setting with a non-spherical Gaussian sampler, Identity-based matchmaking encryption from standard assumptions, Generic constructions of master-key KDM secure attribute-based encryption, Adaptive-Secure VRFs with Shorter Keys from Static Assumptions, Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding, A survey on functional encryption, Forward-secure revocable secret handshakes from lattices, Simplified server-aided revocable identity-based encryption from lattices, Spatial encryption revisited: from delegatable multiple inner product encryption and more, Lattice-based programmable hash functions and applications, Quantum search-to-decision reduction for the LWE problem, Learning with physical rounding for linear and quadratic leakage functions, Traceable policy-based signatures and instantiation from lattices, Hardness of (M)LWE with semi-uniform seeds