Journal of the Korea Institute of Information Security & Cryptology (정보보호학회논문지)

Korea Institute of Information Security and Cryptology (한국정보보호학회)
권호 표지
DOI QR코드

DOI QR Code

A Practical Privacy-Preserving Multi-Party Computation Protocol for Solving Linear Systems

선형계를 위한 실용적인 프라이버시 보존형 다자간 계산 프로토콜

  • Yi Ok-Yeon (Department of Mathematics, Kookmin University) ;
  • Hong Do-Won (Information Security Research Division. ETRI) ;
  • Kang Ju-Sung (Department of Mathematics, Kookmin University)
  • Published : 2006.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

We consider a privacy-preserving cooperative computation protocol evaluating a beneficial function of all participants' secret inputs, such that each party finally holds a share of the function output. We propose a practical privacy-preserving cooperative computation protocol for solving the linear system of equations problem md the linear least-squares problem. Solutions to these problems are widely used in many areas such as banking, manufacturing, and telecommunications. Our multi-party protocol is an efficiently extended version of the previous two-party model.

여러 개체가 각자의 정보를 제공하여 이를 바탕으로 정보 제공자의 프라이버시를 보존하면서 공통의 유익한 정보를 얻고자 하는 다자간 협력 계산 프로토콜에 대해서 논한다. 금융, 제조업, 통신 분야 등에서 널리 응용되는 선형계(linear system)의 일반해(general solution)와 최소제곱해(least-square solution)를 구하는 문제에서 프라이버시를 보존하는 실용적인 다자간(multi-party) 협력 계산 프로토콜을 제안한다. 본 논문에 제안된 프로토콜은 기존의 양자간(two-party) 협력 계산 방식을 확장한 새로운 것으로 효율성 측면에서 우수한 실용적인 다자간 계산 프로토콜이다.

Keywords

References

  1. A.C. Yao, 'Protocols for secure computations', Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, 1982
  2. O. Goldreich, S. Micali, A. Wigderson, 'How to play any mental game', Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218- 229, 1987
  3. O. Goldreich, 'Secure Multi-Party Computation (Final Draft, Version 1.4)', http://www.wisdom.weizmann.ac.il/home/oded/public_html/foc.html, 2002
  4. W. Du, M.Atallah, 'Privacy-preserving cooperative scientific computations', 14th IEEE Computer Security Foundations Workshop, pp. 273-282, 2001
  5. W. Du, M. Atallah, 'Protocols for secure remote database access with approximate matching', ACMCCS2000, 2000
  6. Y. Lindell, B. Pinkas, 'Privacy preserving data mining', CRYPTO 2000, LNCS 1880, 2000
  7. M. Atallah, M. Bykova, J. Li, K. Frikken, M. Topkara, 'Private collaborative forecasting and benchmarking', WEPS2004, 2004
  8. R. Cramer, I. Damgard, 'Secure distributed linear algebra in a constant number of rounds', CRYPTO 2001, LNCS 2139, pp. 119-136, 2001
  9. W. Du, M. Atallah, 'Secure multiparty computation problems and their applications: A review and open problems', Proceedings of New Security Paradigms Workshop, pp. 11-20, 2001
  10. L. Kissner, D. Song, 'Privacy-Preserving Set Operation', Advances in Cryptology - CRYPTO 2005, LNCS 3621, Springer-Verlag, pp. 241-257, 2005
  11. M. Freedman, K. Nissim, B. Pinkas, 'Efficient private matching and set intersection', Advances in Cryptology-Eurocrypt 2004, LNCS 3027, Springer- Verlag, pp. 1-19, 2004
  12. H. Anton, R. C. Busby, Contemporary Linear Algebra, John Wiley & Sons, 2003
  13. M. Naor, B. Pinkas, 'Oblivious transfer and polynomial evaluation', Proceedings of the 31th ACMSTC, pp. 245-254, 1999