Efficient public-key encryption with equality test from lattices
From MaRDI portal
Publication:2235763
DOI10.1016/j.tcs.2021.09.010OpenAlexW3206140864WikidataQ122208625 ScholiaQ122208625MaRDI QIDQ2235763
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.010
Cites Work
- On the concrete hardness of learning with errors
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Efficient public key encryption with equality test in the standard model
- Bonsai trees, or how to delegate a lattice basis
- A simple and efficient CCA-secure lattice KEM in the standard model
- Secure hybrid encryption in the standard model from hard learning problems
- A lattice-based public key encryption with equality test in standard model
- Direct CCA-secure KEM and deterministic PKE from plain LWE
- Public key encryption with equality test via hash proof system
- Public key encryption with equality test in the standard model
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Circular and KDM Security for Identity-Based Encryption
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Towards Public Key Encryption Scheme Supporting Equality Test with Fine-Grained Authorization
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Stronger Security Model for Public-Key Encryption with Equality Test
- A Toolkit for Ring-LWE Cryptography
- Probabilistic Public Key Encryption with Equality Test
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Asymptotically Efficient Lattice-Based Digital Signatures
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- Tighter security proofs for GPV-IBE in the quantum random oracle model
This page was built for publication: Efficient public-key encryption with equality test from lattices
