Related Concepts
Definition
Goldwasser–Micali Encryption scheme is an encryption scheme that was proposed in the paper “probabilistic encryption” in 1984.
Background
The Goldwasser–Micali encryption scheme (Public Key Cryptography) is the first encryption scheme that achieved Semantic Security against a passive adversary under the assumption that solving the quadratic residuosity problem is hard. The scheme encrypts 1 bit of information, and the length of the resulting ciphertext equals the length of the composite number n used in scheme, which is typically thousands of bits long.
Theory
In the Goldwasser–Micali encryption scheme, a public key is a number n, that is a product of two prime numbers, say p and q. Let Y be a quadratic nonresidue modulo n (Quadratic Residue and Modular Arithmetic), whose Jacobi Symbol is 1. The decryption key is formed by the prime factors of n.
The...
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). Goldwasser–Micali Encryption Scheme. 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_19
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_19
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