Definition
Probabilistic public-key encryption is a public-key encryption scheme (Public Key Cryptography) where the ciphertext of the same message under the same public key differs on every run of a probabilistic Turing machine. That is, a random coin toss of the Turing machine is used in the encryption algorithm.
Background
The notion was proposed in contrast to the RSA Public-Key Encryption scheme, which is deterministic in the sense that the ciphertext is always fixed given a public key and a plaintext.
Theory
The early date examples of probabilistic public key encryption schemes are the Goldwasser–Micali Encryption_scheme and the ElGamal Public-Key Encryption scheme, and many others followed. It is known that an encryption scheme that satisfies provable security such as Semantic Securitymust be probabilistic. Since the original RSA encryption scheme was not probabilistic,...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Goldwasser S, Micali S (1984) Probabilistic encryption. J Comp Syst Sci 28:270–299
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Sako, K. (2011). Probabilistic Public-Key Encryption. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_21
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering