CCA-secure inner-product functional encryption from projective hash functions
From MaRDI portal
Publication:5738751
DOI10.1007/978-3-662-54388-7_2zbMATH Open1400.94120OpenAlexW2590903386MaRDI QIDQ5738751FDOQ5738751
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
Recommendations
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Tightly CCA-secure inner product functional encryption scheme
- Simple functional encryption schemes for inner products
CCA-securityDDHinner-product functional encryptiondegree residuosity classes (DCR)projective hash functions (PHFs)
Cites Work
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- Functional Encryption: Definitions and Challenges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fuzzy Identity-Based Encryption
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Title not available (Why is that?)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Theory of Cryptography
- Theory of Cryptography
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
- Smooth Projective Hashing for Conditionally Extractable Commitments
- Function-Hiding Inner Product Encryption
- Simple Functional Encryption Schemes for Inner Products
- On Extractability Obfuscation
- An Algebraic Framework for Diffie-Hellman Assumptions
- Title not available (Why is that?)
- Functional Encryption for Inner Product with Full Function Privacy
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Functional Encryption Without Obfuscation
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Disjunctions for Hash Proof Systems: New Constructions and Applications
Cited In (21)
- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- Adaptive Simulation Security for Inner Product Functional Encryption
- (Inner-product) functional encryption with updatable ciphertexts
- A survey on functional encryption
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Hierarchical identity-based inner product functional encryption
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Unbounded predicate inner product functional encryption from pairings
- Tightly CCA-secure inner product functional encryption scheme
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
- Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
- Multi-client functional encryption with fine-grained access control
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Inner-product functional encryption with fine-grained access control
- Inner-product functional encryption from random linear codes: trial and challenges
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
This page was built for publication: CCA-secure inner-product functional encryption from projective hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738751)
