Eliminating decryption errors in the Ajtai-Dwork Cryptosystem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1294)


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.


Public-key Encryption Schemes Computational Problems in Lattices 


  1. 1.
    Miklos Ajtai. Generating Hard Instances of Lattice Problems. In 28th ACM Symposium on Theory of Computing, pages 99–108, Philadelphia, 1996.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Shafi Goldwasser and Silvio Micali. Probabilistic Encryption, JCSS, Vol. 28, No. 2, pages 270–299, 1984.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  1. 1.Department of Computer Science and Applied MathematicsWeizmann Institute of ScienceRehovotIsrael
  2. 2.Laboratory for Computer ScienceMITCambridge

Personalised recommendations