Encryption is a well-known technique for preserving the privacy of sensitive information. One of the basic, apparently inherent, limitations of this technique is that an information system working with encrypted data can at most store or retrieve the data for the user; any more complicated operations seem to require that the data be decrypted before being operated on. This limitation follows from the choice of encryption functions used, however, and although there are some truly inherent limitations on what can be accomplished, we shall see that it appears likely that there exist encryption functions which permit encrypted data to be operated on without preliminary decryption of the operands, for many sets of interesting operations. These special encryption functions we call 'privacy homomorphisms'; they form an interesting subset of arbitrary encryption schemes (called 'privacy transformations').
Primer artículo que define el cifrado homomórfico.
- Autor/es: Ronald L. Rivest, Len Adleman, Michael L. Dertouzos.
- Fecha: 1978-01
- Publicado en: Foundations of secure computation, Volumen 4, Numero 11, pp 169-180, Academic Press.
- Idioma: Inglés
- Formato: PDF
- Contribución: Víctor A. Villagrá González.
- Palabras clave: Ingeniería de seguridad de los productos, Matemáticas, Teoría de la información