A study on the security of privacy homomorphism

Proceedings - Third International Conference onInformation Technology: New Generations, ITNG 2006

Volumn 2006, Issue , 2006, Pages 470-475

  Yu, Yu, ^a   Leiwo, Jussipekka ^a   Premkumar, Benjamin ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Chosen ciphertext attacks; Information security; Privacy homomorphism; Private computation; Semantic security

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTATION THEORY; COMPUTER HARDWARE; CRYPTOGRAPHY; DATA STRUCTURES;

CHOSEN CIPHERTEXT ATTACKS; PRIVACY HOMOMORPHISM; PRIVATE COMPUTATION; SEMANTIC SECURITY;

SECURITY OF DATA;

EID: 33750843423     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2006.19     Document Type: Conference Paper

References (22)

1. N. Ahituv, Y. Lapid, and S. Neumann. Processing encrypted data. Communications of the ACM (CACM), 30(9):777-780, 1987.
2. F. Bao. Cryptanalysis of a provable secure additive and multiplicative privacy homomorphism. In Proceedings of the International Workshop on Coding and Cryptography (WCC 2003), pages 43-50, 2003.
3. J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret sharing. In Advances in Cryptology - CRYPTO '1986, pages 251-260. Springer-Verlag, 1986.
4. M. Blum and S. Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. In Advances in Cryptology - CRYPTO '1984, pages 289-302. Springer-Verlag, 1984.
5. D. Boneh and R. J. Lipton. Algorithms for black-box fields and their application to cryptography (extended abstract). In Advances in Cryptology - CRYPTO 1996, pages 283-297. Springer-Verlag, 1996.
6. E. F. Brickell and Y. Yacobi. On privacy homomorphisms (extended abstract). In Advances in Cryptology - EUROCRYPT '1987, pages 117-125. Springer-Verlag, 1987.
7. J. H. Cheon and H. S. Nam. A cryptanalysis of the original domingo-ferrer's algebraic privacy homomophism. Cryptology ePrint Archive, Report 2003/221, 2003. http: //eprint.iacr.org/.
8. R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology - EUROCRYPT '2001, pages 280-299. Springer-Verlag, 2001.
9. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology - EUROCRYPT '1997, pages 103-118. Springer-Verlag, 1997.
10. J. Domingo-Ferrer. A new privacy homomorphism and applications. Information Processing Letters, 60(5):277-282, 1996.
11. J. Domingo-Ferrer. A provably secure additive and multiplicative privacy homomorphism. In Proceedings of the 5th International Conference on Information Security (ISC 2002), pages 471-483. Springer-Verlag, 2002.
12. J. Feigenbaum and M. Merritt. Open questions, talk abstracts, and summary of discussions. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 2, pages 1-45, 1991.
13. O. Goldreich. Foundations of Cryptography: Basic Applications, volume 2. Cambridge University Press, 2004.
14. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, 1984.
15. A. Kiayias and M. Yung. The vector-ballot e-voting approach. In Financial Cryptography (FC2004), pages 72-89. Springer-Verlag, 2004.
16. W. Mao. Modern Cryptography: Theory and Practice. Prentice Hall PTR, 2004.
17. T. Okamoto and S. Uchiyama. A new public-key cryptosystem as secure as factoring. In Advances in Cryptology - EUROCRYPT '1998, pages 308-318. Springer-Verlag, 1998.
18. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - EUROCRYPT 1999, pages 223-238. Springer-Verlag, 1999.
19. R. L. Rivest, L. M. Adleman, and M. L. Dertouzos. On data banks and privacy homomorphisms. Foundations of Secure Computation, pages 169-180, 1978.
20. T. Sander and C. F. Tschudin. Towards mobile cryptography. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE CS Press, 1998.
21. D. Wagner. Cryptanalysis of an algebraic privacy homomorphism. In Proceedings of the 5th International Conference on Information Security (ISC 2003), pages 234-239. Springer-Verlag, 2003.
22. A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pages 80-91. IEEE CS Press, 1982.