Predicate Encryption for Circuits from LWE

DOI10.1007/978-3-662-48000-7_25zbMath1369.94538OpenAlexW2296067100MaRDI QIDQ3457082

Hoeteck Wee, Sergey Gorbunov, Vinod Vaikuntanathan

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/112960

zbMATH Keywords

circuitshardnessleveled predicate encryption schemesubexponential learning with errors (LWE)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (65)

Adaptive Simulation Security for Inner Product Functional Encryption ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Memory lower bounds of reductions revisited ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Attribute-based proxy re-encryption from standard lattices ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Predicate encryption from bilinear maps and one-sided probabilistic rank ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Verifiable Functional Encryption ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Multi-input attribute based encryption and predicate encryption ⋮ How to build a trapdoor function from an encryption scheme ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ A survey on functional encryption ⋮ More efficient verifiable functional encryption ⋮ Streaming functional encryption ⋮ Attribute-based multi-input FE (and more) for attribute-weighted sums ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Access control encryption with efficient verifiable sanitized decryption ⋮ Inner-product functional encryption with fine-grained access control ⋮ Multi-party functional encryption ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Improved inner-product encryption with adaptive security and full attribute-hiding ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Minimizing locality of one-way functions via semi-private randomized encodings ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Cryptography with Updates ⋮ Unnamed Item ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Constrained pseudorandom functions from functional encryption ⋮ Match me if you can: matchmaking encryption and its applications ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Revocable attribute-based proxy re-encryption ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Non-interactive anonymous router ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Covert authentication from lattices ⋮ Homomorphic Encryption

Cites Work

• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Practical Multilinear Maps over the Integers
• Functional Encryption: New Perspectives and Lower Bounds
• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Functional Encryption: Definitions and Challenges
• Functional Encryption for Inner Product Predicates from Learning with Errors
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Efficient Lattice (H)IBE in the Standard Model
• Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Candidate Multilinear Maps from Ideal Lattices
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Fuzzy Identity-Based Encryption
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Predicate Encryption for Circuits from LWE