Compact Lossy and All-but-One Trapdoor Functions from Lattice
From MaRDI portal
Publication:5056023
DOI10.1007/978-3-319-72359-4_16zbMath1506.94032OpenAlexW2775711064MaRDI QIDQ5056023
Leixiao Cheng, Yunlei Zhao, Quan Shui Wu
Publication date: 9 December 2022
Published in: Information Security Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-72359-4_16
latticelossy trapdoor functionslearning with errorsall-but-one trapdoor functionshomomorphic symmetric encryption
Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Cites Work
- Unnamed Item
- Possibility and impossibility results for selective decommitments
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Lossy Trapdoor Functions and Their Applications
- Lossy trapdoor functions and their applications
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- Efficient Lattice (H)IBE in the Standard Model
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Nonmalleable Cryptography
- Foundations of Cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
- On the Lossiness of the Rabin Trapdoor Function
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Compact Lossy and All-but-One Trapdoor Functions from Lattice