skip to main content
10.1145/1161366.1161393acmconferencesArticle/Chapter ViewAbstractPublication Pagesih-n-mmsecConference Proceedingsconference-collections
Article

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

Published:26 September 2006Publication History

ABSTRACT

The problem of secure data processing by means of a neural network (NN) is addressed. Secure processing refers to the possibility that the NN owner does not get any knowledge about the processed data since they are provided to him in encrypted format. At the same time, the NN itself is protected, given that its owner may not be willing to disclose the knowledge embedded within it. Two different levels of protection are considered: according to the first one only the NN weights are protected, whereas the second level also permits to protect the node activation functions. An efficient way of implementing the proposed protocol by means of some recently proposed multi-party computation techniques is described.

References

  1. H. L. B. Goethals, S. Laur and T. Mielikainen. On secure scalar product computation for privacy-preserving data mining. In 7th ICISC, 2004.]]Google ScholarGoogle Scholar
  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.]]Google ScholarGoogle ScholarCross RefCross Ref
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]]Google ScholarGoogle ScholarCross RefCross Ref
  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.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]]Google ScholarGoogle Scholar
  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.]]Google ScholarGoogle Scholar
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.]]Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

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

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          MM&Sec '06: Proceedings of the 8th workshop on Multimedia and security
          September 2006
          244 pages
          ISBN:1595934936
          DOI:10.1145/1161366

          Copyright © 2006 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 26 September 2006

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate128of318submissions,40%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader