A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
DOI10.1016/J.TCS.2022.02.014zbMATH Open1490.94052OpenAlexW4212799435WikidataQ113863164 ScholiaQ113863164MaRDI QIDQ2124234FDOQ2124234
Authors: Guilhem Castagnos, Fabien Laguillaumie, Ida Tucker 
Publication date: 19 April 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.014
Recommendations
- CCA-secure inner-product functional encryption from projective hash functions
- Tightly CCA-secure inner product functional encryption scheme
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Fully secure functional encryption for inner products, from standard assumptions
public key cryptographysecurity proofscryptography based on class groups of an imaginary quadratic fieldfunctional encryption for inner productsprojective hash functions
Cites Work
- Functional encryption: definitions and challenges
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Fuzzy Identity-Based Encryption
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Simple functional encryption schemes for inner products
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- Traceable inner product functional encryption
- Fully secure functional encryption for inner products, from standard assumptions
- CCA-secure inner-product functional encryption from projective hash functions
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- From single-input to multi-client inner-product functional encryption
- Adaptive simulation security for inner product functional encryption
- Two-party ECDSA from hash proof systems and efficient instantiations
- A survey on IQ cryptography
- Achieving IND-CCA Security for Functional Encryption for Inner Products
Cited In (5)
- CCA-secure inner-product functional encryption from projective hash functions
- Title not available (Why is that?)
- Tightly CCA-secure inner product functional encryption scheme
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Achieving IND-CCA Security for Functional Encryption for Inner Products
Uses Software
This page was built for publication: A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124234)
