CCA-secure inner-product functional encryption from projective hash functions
From MaRDI portal
(Redirected from Publication:5738751)
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
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 2043334 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A punctured programming approach to adaptively secure functional encryption
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Fully secure functional encryption for inner products, from standard assumptions
- Function-hiding inner product encryption
- Functional encryption for inner product with full function privacy
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- Generic constructions for chosen-ciphertext secure attribute based encryption
- On extractability obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Simple functional encryption schemes for inner products
- Smooth Projective Hashing for Conditionally Extractable Commitments
- Theory of Cryptography
- Theory of Cryptography
Cited in
(29)- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- Dynamic decentralized functional encryption: generic constructions with strong security
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Simulation secure multi-input quadratic functional encryption
- (Inner-product) functional encryption with updatable ciphertexts
- A new paradigm for public-key functional encryption for degree-2 polynomials
- A survey on functional encryption
- Hierarchical identity-based inner product functional encryption
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- Securing data in the cloud using pairing-free inner product functional encryption with unbounded vector size
- Unbounded predicate inner product functional encryption from pairings
- Adaptive simulation security for inner product functional encryption
- FE for inner products and its application to multi-authority ABE
- Tightly CCA-secure inner product functional encryption scheme
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Tightly secure inner-product functional encryption revisited: compact, lattice-based, and more
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
- Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts
- Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF
- Simulation secure multi-input quadratic functional encryption: applications to differential privacy
- 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
- A simple inner-product functional encryption scheme from the inverse-DDH assumption
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- 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)
