Abstract
Following Ajtai's lead, Ajtai and Dwork have recently introduced a public-key encryption scheme which is secure under the assumption that a certain computational problem on lattices is hard on the worst-case. Their encryption method may cause decryption errors, though with small probability (i.e., inversely proportional to the security parameter). In this paper we modify the encryption method of Ajtai and Dwork so that the legitimate receiver always recovers the message sent. That is, we make the Ajtai-Dwork Cryptosystem error-free.
Chapter PDF
References
Miklos Ajtai. Generating Hard Instances of Lattice Problems. In 28th ACM Symposium on Theory of Computing, pages 99–108, Philadelphia, 1996.
Miklos Ajtai and Cynthia Dwork. A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence, In 29th ACM Symposium on Theory of Computing, pages 284–293, 1997.
Shafi Goldwasser and Silvio Micali. Probabilistic Encryption, JCSS, Vol. 28, No. 2, pages 270–299, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Goldreich, O., Goldwasser, S., Halevi, S. (1997). Eliminating decryption errors in the Ajtai-Dwork Cryptosystem. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052230
Download citation
DOI: https://doi.org/10.1007/BFb0052230
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive