Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

DOI10.1007/978-3-662-53015-3_12zbMath1372.94408OpenAlexW2395093458MaRDI QIDQ2829952

Damien Stehlé, Shweta Agrawal, Benoît Libert

Publication date: 9 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_12

zbMATH Keywords

adaptive securityfunctional encryptionstandard assumptionscomposite residuosity\(\mathsf {DDH}\)\(\mathsf {LWE}\)extended \(\mathsf{LWE}\)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (68)

A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ Adaptively secure distributed PRFs from LWE ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience ⋮ Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Verifiable inner product computation on outsourced database for authenticated multi-user data sharing ⋮ On the smoothing parameter and last minimum of random orthogonal lattices ⋮ Bounded-collusion decentralized ABE with sublinear parameters ⋮ (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ Hierarchical identity-based inner product functional encryption ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Multi-authority ABE for non-monotonic access structures ⋮ Fine-grained verifier NIZK and its applications ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ On the security of functional encryption in the generic group model ⋮ DFE-IP: delegatable functional encryption for inner product ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ ABE for circuits with constant-size secret keys and adaptive security ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting ⋮ Privacy-enhanced and non-interactive linear regression with dropout-resilience ⋮ Multi-client functional encryption with fine-grained access control ⋮ Compact FE for unbounded attribute-weighted sums for logspace from SXDH ⋮ Witness encryption and null-iO from evasive LWE ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ A survey on functional encryption ⋮ Efficient lattice-based inner-product functional encryption ⋮ More efficient verifiable functional encryption ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Streaming functional encryption ⋮ Adaptively secure inner product encryption from LWE ⋮ Succinct and adaptively secure ABE for ABP from \(k\)-Lin ⋮ Inner-product functional encryption with fine-grained access control ⋮ Decentralized multi-client functional encryption for set intersection with improved efficiency ⋮ Decentralized multi-client functional encryption for inner product ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Achieving IND-CCA Security for Functional Encryption for Inner Products ⋮ Public key encryption with equality test from generic assumptions in the random oracle model ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Efficient Inner Product Encryption with Simulation-Based Security ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Functional encryption for cubic polynomials and implementation ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Simple and efficient FE for quadratic functions ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ 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 ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Functional encryption for set intersection in the multi-client setting ⋮ A new approach to practical function-private inner product encryption ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ Dynamic decentralized functional encryption

Uses Software

• BLISS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient selective identity-based encryption without random oracles
• Kangaroos, monopoly and discrete logarithms
• Computationally private randomizing polynomials and their applications
• Function-Hiding Inner Product Encryption
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Cryptanalysis of GGH Map
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Lattice Signatures and Bimodal Gaussians
• Practical Multilinear Maps over the Integers
• An Algebraic Framework for Diffie-Hellman Assumptions
• Attribute-Based Encryption for Circuits from Multilinear Maps
• Functional Encryption: New Perspectives and Lower Bounds
• On the Achievability of Simulation-Based Security for Functional Encryption
• How to Run Turing Machines on Encrypted Data
• Hardness of k-LWE and Applications in Traitor Tracing
• Computing Small Discrete Logarithms Faster
• Bounded-Collusion IBE from Key Homomorphism
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Circular and KDM Security for Identity-Based Encryption
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Functional Encryption for Regular Languages
• Simple Functional Encryption Schemes for Inner Products
• Cryptanalysis of the Multilinear Map over the Integers
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption: Definitions and Challenges
• Functional Encryption for Inner Product Predicates from Learning with Errors
• Predicate Encryption for Circuits from LWE
• From Selective to Adaptive Security in Functional Encryption
• Trapdoors for hard lattices and new cryptographic constructions
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
• Identity-Based Encryption from the Weil Pairing
• Candidate Multilinear Maps from Ideal Lattices
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Bi-Deniable Public-Key Encryption
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Fuzzy Identity-Based Encryption
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Advances in Cryptology - CRYPTO 2003
• Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Attribute-based encryption for circuits
• Reusable garbled circuits and succinct functional encryption
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Fully Secure Functional Encryption for Inner Products, from Standard Assumptions