Public key authenticated encryption with keyword search from LWE
From MaRDI portal
Publication:6173292
DOI10.1007/978-3-031-17140-6_15zbMath1526.94048MaRDI QIDQ6173292
Publication date: 21 July 2023
Published in: Computer Security – ESORICS 2022 (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Hash proof systems over lattices revisited
- Bonsai trees, or how to delegate a lattice basis
- 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
- Public-key authenticated encryption with keyword search revisited: security model and constructions
- Improved security model for public-key authenticated encryption with keyword search
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- On the Amortized Complexity of Zero-Knowledge Protocols
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Privacy Preserving Keyword Searches on Remote Encrypted Data
- Advances in Cryptology - EUROCRYPT 2004
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Public key authenticated encryption with keyword search from LWE