A provably secure additive and multiplicative privacy homomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2433, Issue , 2002, Pages 471-483

  Domingo Ferrer, Josep ^a  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Cryptography; Delegation of computing and data; Egambling; Encrypted data processing; Multilevel security; Privacy homomorphisms

Indexed keywords

ALGEBRA; SECURITY OF DATA;

DELEGATION OF COMPUTING AND DATA; E-GAMBLING; ENCRYPTED DATA PROCESSING; MULTI-LEVEL SECURITY; PRIVACY HOMOMORPHISM;

CRYPTOGRAPHY;

EID: 84945300542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45811-5_37     Document Type: Conference Paper

References (15)

1. N. Ahituv, Y. Lapid and S. Neumann, “Processing encrypted data”, Communications of the ACM, vol. 20, no. 9, pp. 777–780, Sept. 1987.
2. G. R. Blakley and C. Meadows, “A database encryption scheme which allows the computation of statistics using encrypted data”, in Proceedings of the IEEE Symposium on Research in Security and Privacy. New York: IEEE CS Press, 1985, pp. 116–122.
3. E. F. Brickell and Y. Yacobi, “On privacy homomorphisms”, in Advances in Cryptology-Eurocrypt’87, D. Chaum and W. L. Price, Eds. Berlin: Springer-Verlag, 1988, pp. 117–125.
4. J. Domingo-Ferrer, “A new privacy homomorphism and applications”, Information Processing Letters, vol. 60, no. 5, pp. 277–282, Dec. 1996.
5. J. Domingo-Ferrer, “Multi-application smart cards and encrypted data processing”, Future Generation Computer Systems, vol. 13, pp. 65–74, Jun. 1997.
6. J. Domingo-Ferrer and R. X. Sánchez del Castillo, “An implementable scheme for secure delegation of statistical data”, in Information Security-ICICS’97, Lecture Notes in Computer Science 1334, Y. Han, T. Okamoto and S. Qing, Eds. Berlin: Springer-Verlag, 1997, pp. 445–451.
7. J. Domingo-Ferrer and Ricardo X. Sánchez del Castillo, “Method for secure delegation of statistical data”, Spanish patent no. P9800608, granted Dec. 2000.
8. J. Feigenbaum and M. Merritt, “Open questions, talk abstracts, and summary of discussions”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, pp. 1–45, 1991.
9. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed. Oxford: Clarendon, 1993.
10. R. L. Rivest, L. Adleman and M. L. Dertouzos, “On data banks and privacy homomorphisms”, in Foundations of Secure Computation, R. A. DeMillo et al., Eds. New-York: Academic Press, 1978, pp. 169-179.
11. J. B. Rosser and L. Schoenfeld, “Approximate formulas for some functions of prime numbers”, Illinois Journal of Mathematics, vol. 6, no. 1, pp. 64–94, Jan. 1962.
12. T. Sand er and C. F. Tschudin, “Protecting mobile agents against malicious hosts”, in Mobile Agent Security, Lecture Notes in Computer Science 1419. Berlin: Springer-Verlag, 1998, pp. 44–60.
13. M. R. Schroeder, Number Theory in Science and Communication, 2nd ed. Berlin: Springer-Verlag, 1986.
14. SCYTL Online World Security. http://www.scytl.com
15. G. Trouessin, Traitements Fiables des Données Confidentielles par Fragmentation-Rédondance-Dissémination. Ph. D. Thesis, Univ. Paul Sabatier, Toulouse, France, 1991.