Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem

@inproceedings{Goldreich1997EliminatingDE,
  title={Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem},
  author={Oded Goldreich and Shafi Goldwasser and Shai Halevi},
  booktitle={CRYPTO},
  year={1997}
}
Following Ajtai’s lcad, 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 m a y 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… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 42 CITATIONS

Abuses of Ajtai-dwork Cryptosystem

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Multi-bit Cryptosystems Based on Lattice Problems

  • Public Key Cryptography
  • 2007
VIEW 7 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

New Results for Learning Noisy Parities and Halfspaces

  • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Challenges of Symbolic Computation: My Favorite Open Problems

  • J. Symb. Comput.
  • 2000
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Intractability results for some computational problems

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Immunizing Encryption Schemes from Decryption Errors

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Some Recent Progress on the Complexity of Lattice Problems

  • Electronic Colloquium on Computational Complexity
  • 1999
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Cryptanalysis of the Ajtai-Dwork Cryptosystem

VIEW 3 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Generating Hard Instances of Lattice Problems

  • Electronic Colloquium on Computational Complexity
  • 1996
VIEW 1 EXCERPT

Probabilistic Encryption

  • J. Comput. Syst. Sci.
  • 1984
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…