Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption

DOI10.1007/978-3-030-71852-7_9zbMath1479.94275OpenAlexW3136713650MaRDI QIDQ2057139

Kelly Yun, Rui Xue

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-71852-7_9

zbMATH Keywords

inner productfunctional encryptionlearning with errorschosen ciphertext attacks securityidentity-based functional encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Verifiability-based conversion from CPA to CCA-secure predicate encryption
• When does functional encryption imply obfuscation?
• Identity-based functional encryption for quadratic functions from lattices
• FE for inner products and its application to decentralized ABE
• Functional Encryption for Turing Machines
• Functional Encryption Without Obfuscation
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Cryptanalysis of GGH Map
• Cryptanalysis of GGH15 Multilinear Maps
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Functional Encryption for Regular Languages
• Simple Functional Encryption Schemes for Inner Products
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption: Definitions and Challenges
• Functional Encryption for Inner Product Predicates from Learning with Errors
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
• Predicate Encryption for Circuits from LWE
• A Punctured Programming Approach to Adaptively Secure Functional Encryption
• Indistinguishability Obfuscation from Compact Functional Encryption
• Trapdoors for hard lattices and new cryptographic constructions
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Hierarchical Predicate Encryption for Inner-Products
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Indistinguishability Obfuscation from Functional Encryption
• Candidate Multilinear Maps from Ideal Lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Graph-Induced Multilinear Maps from Lattices
• Advances in Cryptology – CRYPTO 2004
• Fuzzy Identity-Based Encryption
• Generating Shorter Bases for Hard Random Lattices
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Attribute-based encryption for circuits
• Classical hardness of learning with errors
• CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption