CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions

DOI10.1007/978-3-662-54388-7_2zbMath1400.94120OpenAlexW2590903386MaRDI QIDQ5738751

Helger Lipmaa, Florian Bourse, Fabrice Benhamouda

Publication date: 13 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_2

zbMATH Keywords

CCA-securityDDHinner-product functional encryptiondegree residuosity classes (DCR)projective hash functions (PHFs)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

Post-quantum secure inner product functional encryption using multivariate public key cryptography ⋮ 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 ⋮ Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Hierarchical identity-based inner product functional encryption ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Multi-client functional encryption with fine-grained access control ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ A survey on functional encryption ⋮ Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts ⋮ Inner-product functional encryption with fine-grained access control ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional Encryption for Inner Product with Full Function Privacy
• Functional Encryption Without Obfuscation
• Function-Hiding Inner Product Encryption
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• An Algebraic Framework for Diffie-Hellman Assumptions
• Simple Functional Encryption Schemes for Inner Products
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Functional Encryption: Definitions and Challenges
• Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
• Smooth Projective Hashing for Conditionally Extractable Commitments
• A Punctured Programming Approach to Adaptively Secure Functional Encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Advances in Cryptology – CRYPTO 2004
• Fuzzy Identity-Based Encryption
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
• On Extractability Obfuscation
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

This page was built for publication: CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions