A privacy-preserving protocol for neural-network-based computation

Proceedings of the Multimedia and Security Workshop 2006, MM and Sec'06

Volumn 2006, Issue , 2006, Pages 146-151

  Barni, M ^a   Orlandi, G ^b   Piva, A ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Neural networks; Privacy preserving computation

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; DATA PROCESSING; EMBEDDED SYSTEMS; NETWORK PROTOCOLS; NEURAL NETWORKS;

MULTIPARTY COMPUTATION TECHNIQUES; NODE ACTIVATION FUNCTIONS; PRIVACY PRESERVING COMPUTATION;

SECURITY OF DATA;

EID: 33750908650     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1161366.1161393     Document Type: Conference Paper

References (15)

1. H. L. B. Goethals, S. Laur and T. Mielikainen. On secure scalar product computation for privacy-preserving data mining. In 7th ICISC, 2004.
2. R. Brinkman, J. M. Doumen, and W. Jonker. Using secret sharing for searching in encrypted data. In Proc. of Workshop on Secure Data Management in a Connected World (SDM 2004), Springer-Verlag LNCS 3178, pages 18-27, 2004.
3. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 11-19, New York, NY, USA, 1988. ACM Press.
4. I. Damgård and M. Jurik. A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In Public Key Cryptography, pages 119-136, 2001.
5. W. Du and M. J. Atallah. Privacy-preserving statistical analysis. In Proceedings of the 17th Annual Computer Security Applications Conference, pages 102-110, New Orleans, Louisiana, USA, December 10-14 2001.
6. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC, pages 218-229. ACM, 1987.
7. G. Jagannathan, K. Pillaipakkamnatt, and R. Wright. A new privacy-preserving distributed k-clustering algorithm. In 2006 SIAM International Conference on Data Mining (SDM, Bethesda, Maryland, April 20-22 2006.
8. M. Johnson, P. Ishwar, V. Prabhakaran, D. Schonberg, and K. Ramchandran. On compressing encrypted data. IEEE Trans. on Signal Processing, 52(10):2992-3006, October 2004.
9. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In 31th Annual Symposium on Theory of Computer Science (STOC), pages 245-254, Atlanta, GA, May 1-4 1999.
10. P. Pailler. Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of Eurocrypt'99, Lecture Notes is Computer Science vol. 1592, pages 223-238. Springer-Verlag, 1999.
11. P. Ravikumar, W. Cohen, and S. Fienberg. A secure protocol for computing string distance metrics. In Workshop on Privacy and Security Aspects of Data Mining, Brighton, UK, November 1 2004.
12. D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In Proceedings of the 2000 IEEE symposium on Security and Privacy (S&P 2000), 2000.
13. W.Du and M. J. Atallah. Privacy-preserving cooperative scientific computations. In 14th IEEE Computer Security Foundations Workshop, pages 273-282, Nova Scotia, Canada, June 11-13 2001.
14. R. Wright and Z. Yang. Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 713-718, New York, NY, USA, 2004. ACM Press.
15. A. C. Yao. Protocols for secure computations. In Proceedings of Twenty-third IEEE Symposium on Foundations of Computer Science, pages 160-164, Chicago, Illinois, November 1982.