Verifiable Inner Product Encryption Scheme
From MaRDI portal
Publication:5041153
DOI10.1007/978-3-030-45374-9_3zbMath1500.94048OpenAlexW3021498304MaRDI QIDQ5041153
Peter B. Rønne, Najmeh Soroush, Vincenzo Iovino, Alfredo Rial, Peter Y. A. Ryan
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_3
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Related Items (4)
Multi-input non-interactive functional encryption: constructions and applications ⋮ A survey on functional encryption ⋮ More efficient verifiable functional encryption ⋮ Verifiable functional encryption using Intel SGX
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Practical functional encryption for quadratic functions with applications to predicate encryption
- On the power of rewinding simulators in functional encryption
- Inner-product encryption under standard assumptions
- On the Achievability of Simulation-Based Security for Functional Encryption
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Simulation-Based Secure Functional Encryption in the Random Oracle Model
- Verifiable Functional Encryption
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Constant-Size Commitments to Polynomials and Their Applications
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Conjunctive, Subset, and Range Queries on Encrypted Data
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Non-interactive Zaps and New Techniques for NIZK
This page was built for publication: Verifiable Inner Product Encryption Scheme