 |
|
|
|
|
|
Cover Quote: September 2013
|
|
This paper proposes an encryption scheme that possesses the following property: Whatever is efficiently computable about the cleartext given the cyphertext, is also efficiently computable without the cyphertext. The security of our encryption scheme is based on complexity theory. Thus, when we say that it is “impossible” for an adversary to compute any information about the cleartext from the cyphertext we mean that it is not computationally feasible.
|
- Silvio Micali & Shafi Goldwasser
Journal of Computer and System Sciences, 1984
|
|
|
|
|
|
