On the security of functional encryption in the generic group model
From MaRDI portal
Publication:6095189
DOI10.1007/s10623-023-01237-1zbMath1520.94061MaRDI QIDQ6095189
Publication date: 7 September 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- An algebraic framework for Diffie-Hellman assumptions
- Cryptanalyses of branching program obfuscations over GGH13 multilinear map from the NTRU problem
- Practical functional encryption for quadratic functions with applications to predicate encryption
- A subversion-resistant SNARK
- Preventing CLT attacks on obfuscation with linear overhead
- Function-hiding inner product encryption is practical
- Complexity of a determinate algorithm for the discrete logarithm
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- A forward-secure public-key encryption scheme
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH15 Multilinear Maps
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Automated Analysis of Cryptographic Assumptions in Generic Group Models
- Simple Functional Encryption Schemes for Inner Products
- Cryptanalysis of the Multilinear Map over the Integers
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
- Unbounded HIBE and Attribute-Based Encryption
- Diffie-Hellman Oracles
- Algorithms for Black-Box Fields and their Application to Cryptography
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Structure-Preserving Signatures and Commitments to Group Elements
- The Uber-Assumption Family
- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Identity-Based Encryption from the Weil Pairing
- Candidate Multilinear Maps from Ideal Lattices
- Injective Encodings to Elliptic Curves
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- On the Equivalence of Generic Group Models
- Theory of Cryptography
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model
- On Extractability Obfuscation
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Cryptography and Coding
This page was built for publication: On the security of functional encryption in the generic group model