Efficient and fully secure lattice-based IBE with equality test
From MaRDI portal
Publication:2673061
DOI10.1007/978-3-030-88052-1_18zbMath1500.94056OpenAlexW3201550941MaRDI QIDQ2673061
Zike Jiang, Zhenghao Wu, Anjia Yang, Jian Weng, Jinghang Wen, Lisha Yao, Xiaojian Liang
Publication date: 8 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88052-1_18
Related Items (1)
Cites Work
- Identity-based encryption with outsourced equality test in cloud computing
- Identity-based encryption with equality test and datestamp-based authorization mechanism
- Mobile access and flexible search over encrypted cloud data in heterogeneous systems
- Adaptively secure constrained pseudorandom functions in the standard model
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Lattice-based IBE with equality test supporting flexible authorization in the standard model
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- A lattice-based public key encryption with equality test in standard model
- Lattice-based IBE with equality test in standard model
- Semi-generic construction of public key encryption and identity-based encryption with equality test
- ID-based encryption with equality test against insider attack
- Public key encryption with equality test in the standard model
- Adaptively secure inner product encryption from LWE
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Practical Identity-Based Encryption Without Random Oracles
- Public-key cryptosystems from the worst-case shortest vector problem
- Probabilistic Public Key Encryption with Equality Test
- Advances in Cryptology - EUROCRYPT 2004
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Efficient and fully secure lattice-based IBE with equality test
