Practical fully secure unrestricted inner product functional encryption modulo \(p\)
From MaRDI portal
Publication:1710625
DOI10.1007/978-3-030-03329-3_25zbMath1446.94112OpenAlexW2893016992MaRDI QIDQ1710625
Ida Tucker, Guilhem Castagnos, Fabien Laguillaumie
Publication date: 23 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-03329-3_25
Related Items
A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency, Adaptive Simulation Security for Inner Product Functional Encryption, Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups, Unbounded predicate inner product functional encryption from pairings, I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups, Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\), Multi-client functional encryption with fine-grained access control, (Inner-product) functional encryption with updatable ciphertexts, A survey on functional encryption, Secure multiparty computation from threshold encryption based on class groups, Inner-product functional encryption with fine-grained access control, Practical fully secure unrestricted inner product functional encryption modulo \(p\), Tightly secure inner product functional encryption: multi-input and function-hiding constructions, Bandwidth-efficient threshold EC-DSA, Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing discrete logarithms in quadratic orders
- Encryption switching protocols revisited: switching modulo \(p\)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- Functional Encryption Without Obfuscation
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- How to Run Turing Machines on Encrypted Data
- Extended-DDH and Lossy Trapdoor Functions
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Simple Functional Encryption Schemes for Inner Products
- Verifiable Functional Encryption
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Trapdoors for hard lattices and new cryptographic constructions
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
- Fuzzy Identity-Based Encryption
- Advances in Cryptology - CRYPTO 2003
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- Public Key Cryptography - PKC 2005
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
- Advances in Cryptology - ASIACRYPT 2003
