[GM84] Probabilistic Encryption

Authors: Shafi Goldwasser, Silvio Micali | Venue: Journal of Computer and System Sciences | Source

Abstract

A new probabilistic model of data encryption is introduced. For this model, under suitable complexity assumptions, it is proved that extracting any information about the cleartext from the ciphertext is hard on the average for any polynomial time adversary. The proof holds for any message space. A concrete encryption scheme based on the quadratic residuosity problem is given.

BibTeX

Copy

@Article{GolMic84,
  author = {Shafi Goldwasser and Silvio Micali},
  title = {Probabilistic Encryption},
  pages = {270--299},
  journal = {Journal of Computer and System Sciences},
  volume = {28},
  number = {2},
  year = {1984},
}