Eliminating decryption errors in the Ajtai-Dwork cryptosystem
From MaRDI portal
The Ajtai-Dwork cryptosystem is described in a very compact way. This cryptosystem has as disadvantage that there is a small probability of incorrect decryption. The authors present a small modification on the original scheme such that this disadvantage is removed without damaging the security of the system. For the entire collection see [Zbl 0870.00047].
Recommendations
Cited in
(21)- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- STP-LWE: A variant of learning with error for a flexible encryption
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- A note on perfect correctness by derandomization
- Improved analysis of the reduction from BDD to uSVP
- Improved hardness results for unique shortest vector problem
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Finding shortest lattice vectors in the presence of gaps
- Enhanced NTRU cryptosystem eliminating decryption failures
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- A Complete Public-Key Cryptosystem
- scientific article; zbMATH DE number 2169072 (Why is no real title available?)
- Cryptographic functions from worst-case complexity assumptions
- Efficient methods to overcome Rabin cryptosystem decryption failure
- A note on perfect correctness by derandomization
- Advances in Cryptology - EUROCRYPT 2004
- Theory of Cryptography
- Cryptanalysis of the GGH cryptosystem
- Key-agreement with perfect completeness from random oracles
- A correction to `efficient and secure comparison for on-line auctions'
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
This page was built for publication: Eliminating decryption errors in the Ajtai-Dwork cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364545)