Attribute-Based Keyword Search from Lattices
From MaRDI portal
Publication:5040376
DOI10.1007/978-3-030-42921-8_4zbMath1500.94038OpenAlexW3014636614MaRDI QIDQ5040376
Jie Li, Jiang Zhang, Shuaigang Li, Mi-Mi Ma, Shuqin Fan
Publication date: 14 October 2022
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42921-8_4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage
- An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks
- Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Attribute-Based Encryption for Circuits
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Applied Cryptography and Network Security
- Attribute-Based Functional Encryption on Lattices
- Public-Key Encryption with Fuzzy Keyword Search: A Provably Secure Scheme under Keyword Guessing Attack
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Attribute-Based Keyword Search from Lattices
