A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency

DOI10.1016/J.TCS.2022.02.014MaRDI QIDQ2124234zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

cryptography based on class groups of an imaginary quadratic fieldfunctional encryption for inner productsprojective hash functionspublic key cryptographysecurity proofs

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• A survey on IQ cryptography
• Achieving IND-CCA Security for Functional Encryption for Inner Products
• Adaptive simulation security for inner product functional encryption
• CCA-secure inner-product functional encryption from projective hash functions
• Decentralized multi-client functional encryption for inner product
• From single-input to multi-client inner-product functional encryption
• Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
• Fully secure functional encryption for inner products, from standard assumptions
• Functional encryption: definitions and challenges
• Fuzzy Identity-Based Encryption
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• Practical fully secure unrestricted inner product functional encryption modulo \(p\)
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Simple functional encryption schemes for inner products
• Traceable inner product functional encryption
• Trapdoors for hard lattices and new cryptographic constructions
• Two-party ECDSA from hash proof systems and efficient instantiations
• Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(7)

• Tightly CCA-secure inner product functional encryption scheme
• Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
• scientific article; zbMATH DE number 1583777 (Why is no real title available?)
• Achieving IND-CCA Security for Functional Encryption for Inner Products
• CCA-secure inner-product functional encryption from projective hash functions
• Tightly secure inner-product functional encryption revisited: compact, lattice-based, and more
• Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption

Describes a project that uses

Uses Software

• PARI/GP

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)