A new privacy homomorphism and applications

Information Processing Letters

Volumn 60, Issue 5, 1996, Pages 277-282

  Domingo I Ferrer, Josep ^a  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Privacy homomorphisms; Safety security in digital systems; Statistical confidentiality

Indexed keywords

CALCULATIONS; COMPUTATIONAL METHODS; DATA PROCESSING; SECURITY OF DATA; SET THEORY; STATISTICAL METHODS;

KNOWN CLEARTEXT ATTACK; PRIVACY HOMOMORPHISMS; STATISTICAL CONFIDENTIALITY;

CRYPTOGRAPHY;

EID: 0030577321     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00170-6     Document Type: Article

References (7)

1. N. Ahituv, Y. Lapid and S. Neumann, Processing encrypted data, Comm. ACM 20 (1987) 777-780.
2. E. Brickell and Y. Yacobi, On privacy homomorphisms, in: D. Chaum and W. L. Price, eds., Advances in Cryptology -Eurocrypt'87 (Springer, Berlin, 1988) 117-125.
3. E.F. Brickell and A.M. Odlyzko, Cryptanalysis: A survey of recent results, in: G.J. Simmons, ed., Contemporary Cryptology (IEEE Press, New York, 1992) 501-540.
4. A.M. Frieze, J. Hastad, R. Kannan, J.C. Lagarias and A. Shamir, Reconstructing truncated integer variables satisfying linear congruences, SIAM J. Comput. 17 (1988) 262-280.
5. R.L. Rivest, L. Adleman and M.L. Dertouzos, On data banks and privacy homomorphisms, in: R.A. DeMillo et al., eds., Foundations of Secure Computation (Academic Press, New York, 1978) 169-179.
6. D. Schackis, Manual on Disclosure Control Methods (Eurostat, Luxembourg, 1993).
7. G. Trouessin, Traitements fiables de données confidentielles par fragmentation-rédondance-dissémination, Ph.D. Thesis, Université Paul Sabatier, Toulouse, 1991.