A new privacy homomorphism and applications
暂无分享,去创建一个
An additive and multiplicative privacy homomorphism is an encryption function mapping addition and multiplication of cleartext data into two operations on encrypted data. One such privacy homomorphism is introduced which has the novel property of seeming secure against a known-cleartext attack. An application to multilevel statistical computation is presented, namely classified retrieval of exact statistics from unclassified computation on disclosure-protected (perturbed) data.
[1] E. Brickell,et al. Cryptanalysis: a survey of recent results , 1988, Proc. IEEE.
[2] Ronald L. Rivest,et al. ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .
[3] Gilles Trouessin. Traitements fiables de données confidentielles par fragmentation-redondance-dissémination , 1991 .
[4] E. Brickell,et al. On privacy homomorphisms , 1987 .
[5] Niv Ahituv,et al. Processing encrypted data , 1987, CACM.