ON DATA BANKS AND PRIVACY HOMOMORPHISMS
ON DATA BANKS AND PRIVACY HOMOMORPHISMS
复制标题
DOI：
--
复制
发表时间：
1978
期刊：
影响因子：
--
通讯作者：
Ronald L. Rivest;M. Dertouzos
中科院分区：
文献类型：
--
作者：
Ronald L. Rivest;M. Dertouzos
加密是一种井井有条的技术，用于保留敏感信息的隐私复杂的操作似乎要求在操作之前将数据解密。在可以完成的事情上，我们将看到存在许多有趣的操作的加密功能，这些函数允许在没有初步解密的情况下操作加密数据。它们构成了任意加密方案的有趣子集（称为“隐私转换”）。
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”).