Towards Tightly Secure Deterministic Public Key Encryption
From MaRDI portal
Publication:3297488
DOI10.1007/978-3-319-89500-0_13zbMath1452.94096OpenAlexW2796562509MaRDI QIDQ3297488
Bao Li, Haiyang Xue, Dingding Jia, Yamin Liu, Xianhui Lu, Daode Zhang
Publication date: 20 July 2020
Published in: Information and Communications Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89500-0_13
Cites Work
- Unnamed Item
- Tightly CCA-Secure Encryption Without Pairings
- Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
- Incremental Deterministic Public-Key Encryption
- Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Lossy trapdoor functions and their applications
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Deterministic and Efficiently Searchable Encryption
- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
- Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
This page was built for publication: Towards Tightly Secure Deterministic Public Key Encryption