Fully secure functional encryption for inner products, from standard assumptions
From MaRDI portal
Publication:2829952
DOI10.1007/978-3-662-53015-3_12zbMATH Open1372.94408OpenAlexW2395093458MaRDI QIDQ2829952FDOQ2829952
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
Recommendations
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Simple functional encryption schemes for inner products
- Functional encryption for inner product with full function privacy
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Function-hiding inner product encryption
adaptive securityfunctional encryptionstandard assumptionscomposite residuosity\(\mathsf {DDH}\)\(\mathsf {LWE}\)extended \(\mathsf{LWE}\)
Cites Work
- On lattices, learning with errors, random linear codes, and cryptography
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Identity-Based Encryption from the Weil Pairing
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Efficient selective identity-based encryption without random oracles
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Advances in Cryptology – CRYPTO 2004
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Functional Encryption for Regular Languages
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Attribute-based encryption for circuits
- Lattice Signatures and Bimodal Gaussians
- Practical Multilinear Maps over the Integers
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Kangaroos, monopoly and discrete logarithms
- Computationally private randomizing polynomials and their applications
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
- A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
- Candidate Multilinear Maps from Ideal Lattices
- Function-Hiding Inner Product Encryption
- 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
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Simple Functional Encryption Schemes for Inner Products
- Reusable garbled circuits and succinct functional encryption
- Cryptanalysis of GGH Map
- An Algebraic Framework for Diffie-Hellman Assumptions
- Cryptanalysis of the Multilinear Map over the Integers
- Title not available (Why is that?)
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Computing Small Discrete Logarithms Faster
- From Selective to Adaptive Security in Functional Encryption
- Hardness of k-LWE and Applications in Traitor Tracing
- Circular and KDM Security for Identity-Based Encryption
- Predicate Encryption for Circuits from LWE
- Bi-Deniable Public-Key Encryption
- Bounded-Collusion IBE from Key Homomorphism
Cited In (88)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- Adaptive Simulation Security for Inner Product Functional Encryption
- Public key encryption with equality test from generic assumptions in the random oracle model
- Adaptively secure distributed PRFs from LWE
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- A new approach to practical function-private inner product encryption
- Hierarchical identity-based inner product functional encryption
- Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys
- Multi-authority ABE for non-monotonic access structures
- ABE for circuits with constant-size secret keys and adaptive security
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner product functional encryption from bilinear maps
- Efficient lattice-based inner-product functional encryption
- Fine-grained verifier NIZK and its applications
- Unbounded predicate inner product functional encryption from pairings
- Attribute-based access control for inner product functional encryption from LWE
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Unbounded inner-product functional encryption with succinct keys
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Simple and efficient FE for quadratic functions
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
- Fully secure functional encryption with general relations from the decisional linear assumption
- Impossibility results for lattice-based functional encryption schemes
- 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
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- An Anonymous Trace-and-Revoke Broadcast Encryption Scheme
- Adaptively secure inner product encryption from LWE
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
- (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
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- On the smoothing parameter and last minimum of random orthogonal lattices
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Functional encryption for set intersection in the multi-client setting
- Hardness of \(k\)-LWE and applications in traitor tracing
- DFE-IP: delegatable functional encryption for inner product
- Inner-product functional encryption with fine-grained access control
- Witness encryption and null-iO from evasive LWE
- Optimal security notion for decentralized multi-client functional encryption
- Decentralized multi-client functional encryption for set intersection with improved efficiency
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- 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
- Dynamic decentralized functional encryption
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- More efficient verifiable functional encryption
- (Inner-product) functional encryption with updatable ciphertexts
- Efficient Inner Product Encryption with Simulation-Based Security
- On the multi-user security of LWE-based NIKE
- Fine-grained polynomial functional encryption
- Collusion Resistant Traitor Tracing from Learning with Errors
- A survey on functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Verifiable decentralized multi-client functional encryption for inner product
- Improved unbounded inner-product functional encryption
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Streaming functional encryption
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- A public key identity-based revocation scheme: fully attribute-hiding and function private
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- Lower bounds for lattice-based compact functional encryption
- Registered functional encryptions from pairings
- Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded
- How to Solve Multiple Short-Exponent Discrete Logarithm Problem
- Multi-client functional encryption with fine-grained access control
- Bounded-collusion decentralized ABE with sublinear parameters
- Publicly auditable functional encryption
- 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
- Beyond volume pattern: storage-efficient Boolean searchable symmetric encryption with suppressed leakage
- Generic construction of trace-and-revoke inner product functional encryption
- On the security of functional encryption in the generic group model
- Privacy-enhanced and non-interactive linear regression with dropout-resilience
Uses Software
This page was built for publication: Fully secure functional encryption for inner products, from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829952)
