Probabilistic encryption

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term "probabilistic encryption" is typically used in reference to public key encryption algorithms; however various symmetric key encryption algorithms achieve a similar property (e.g., block ciphers when used in a chaining mode such as CBC), and stream ciphers such as Freestyle which are inherently random. To be semantically secure, that is, to hide even partial information about the plaintext, an encryption algorithm must be probabilistic.

Probabilistic encryption is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term "probabilistic encryption" is typically used in reference to public key encryption algorithms; however various symmetric key encryption algorithms achieve a similar property (e.g., block ciphers when used in a chaining mode such as CBC), and stream ciphers such as Freestyle which are inherently random. To be semantically secure, that is, to hide even partial information about the plaintext, an encryption algorithm must be probabilistic. {\rm Enc}(x) = (f(r), x \oplus b(r)) {\rm Dec}(y, z) = b(f^{-1}(y)) \oplus z This is inefficient because only a single bit is encrypted. In other words, the message expansion factor is equal to the public key size. Example of probabilistic encryption in the random oracle model: x - plaintext f - trapdoor permutation (deterministic encryption algorithm) h - random oracle (typically implemented using a publicly specified hash function) r - random string {\rm Enc}(x) = (f(r), x \oplus h(r)) {\rm Dec}(y, z) = h(f^{-1}(y)) \oplus z

See also

Deterministic encryption Efficient Probabilistic Public-Key Encryption Scheme Strong secrecy

References

External links

Shafi Goldwasser and Silvio Micali, Probabilistic Encryption, Special issue of Journal of Computer and Systems Sciences, Vol. 28, No. 2, pages 270-299, April 1984 Freestyle, a randomized version of ChaCha for resisting offline brute-force and dictionary attacks .

Text derived from https://en.wikipedia.org/w/index.php?oldid=1315088527 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001315088527 · captured 1759601910.0 · version history

Cite this page as: encyclopegia.org, “Probabilistic encryption”, snapshot enwiki-001315088527. https://encyclopegia.org/a/probabilistic-encryption

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.