Verifiable Inner Product Encryption Scheme

DOI10.1007/978-3-030-45374-9_3MaRDI QIDQ5041153zbMATH OpenOpenAlexFDO

Authors Najmeh Soroush, Vincenzo Iovino, Alfredo Rial, Peter B. Rønne, 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

zbMATH Keywords

verifiabilityinner-product encryptionfunctional commitments

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Theory of compilers and interpreters (68N20)

Recommendations

• Inner-product encryption under standard assumptions
• Efficient inner product encryption with simulation-based security
• Strongly full-hiding inner product encryption
• An inner product encryption scheme based on dual systems
• Simple functional encryption schemes for inner products
• A secure computation scheme of inner product based on fully homomorphic encryption
• On the practical security of inner product functional encryption
• Traceable inner product functional encryption
• Non-zero inner product encryption with short ciphertexts and private keys
• More efficient constructions for inner-product encryption

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
• Advances in Cryptology - EUROCRYPT 2004
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
• Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
• Functional encryption: definitions and challenges
• Fuzzy Identity-Based Encryption
• Identity-based cryptosystems and signature schemes
• Inner-product encryption under standard assumptions
• Non-interactive Zaps and New Techniques for NIZK
• On the achievability of simulation-based security for functional encryption
• On the power of rewinding simulators in functional encryption
• Practical functional encryption for quadratic functions with applications to predicate encryption
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Simulation-based secure functional encryption in the random oracle model
• Verifiable functional encryption

Cited in

(8)

• Hierarchical Predicate Encryption for Inner-Products
• More efficient verifiable functional encryption
• Multi-input non-interactive functional encryption: constructions and applications
• Verifiable functional encryption
• A survey on functional encryption
• Pattern matching in encrypted stream from inner product encryption
• Publicly auditable functional encryption
• Verifiable functional encryption using Intel SGX

This page was built for publication: Verifiable Inner Product Encryption Scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041153)