Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations

  • Published : 2007.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equations: the linear systems of equations problem and the linear least-square problem. The protocols proposed in this paper achieve acceptable security in the sense of Du-Zhan's paradigm and t-wise collusion-resistance, and their communication complexity is O(tm), where t is a security parameter and m is the total number of participants. The complexity of our protocol is significantly better than the previous result O($m^2/{\mu}$) of [4], in which the oblivious transfer protocol is used as an important building block.

Keywords

References

  1. A. C. Yao, 'Protocols for secure computations', At the 23rd Annual Symposium on the Foundations of Computer Science, IEEE, 1982 https://doi.org/10.1109/SFCS.1982.38
  2. O. Goldreich, S. Micali, A. Wigderson, 'How to play any mental game', In the Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pp. 218-229,1987 https://doi.org/10.1145/28395.28420
  3. O. Goldreich, 'Secure Multi-party Computation', Final Draft, Version 1.4, 2002
  4. W. Du, M. J. Atallah, 'Privacy-preserving Cooperative Scientific Computations', In the 14th IEEE Computer Security Foundations Workshop, pp. 273-282,2001
  5. W. Du, M. J. Atallah, 'Protocols for secure remote database access with approximate matching', In the 7th ACM Conference on Computer and Communications Security, 2000
  6. W. Du, M. J. Atallah, 'Secure multi-party computation problems and their applications: A review and open problems', In the Proceedings of the New Security Paradigms Workshop, pp. 11-20, 2001 https://doi.org/10.1145/508171.508174
  7. W. Du, M. J. Atallah, 'Privacy-preserving statistical analysis', In the Proceedings of the 17th Annual Computer Security Applications Conference, pp. 102-110,2001
  8. M. J. Atallah, W. Du, 'Secure multi-party computational geometry', In WADS2001: 7th International Workshop on Algorithms and Data Structures, pp. 165-179,2001 https://doi.org/10.1007/3-540-44634-6_16
  9. Y. Lindell, B. Pinkas, 'Privacy preserving data mining', Advances in Cryptology - Crypt02000, LNCS 1592, pp. 402-414,1999
  10. W. Du, Z. Zhan, 'A practical approach to solving secure multi-party computation problems', In New Security Paradigms Workshop 2002, pp. 127-135, 2002 https://doi.org/10.1145/844102.844125
  11. M. Naor, B. Pinkas, 'Oblivious transfer and polynomial evaluation', In the Proceedings of the 31st ACM Symposium on the Theory of Computing, pp. 245-254, 1999 https://doi.org/10.1145/301250.301312
  12. M. Atallah, M. Bykova, J. Li, K. Frikken, M. Topkara, 'Private collaborative forecasting and benchmarking', WEPS2004, 2004 https://doi.org/10.1145/1029179.1029204

Cited by

  1. Protecting Multi-Lateral Localization Privacy in Pervasive Environments vol.23, pp.5, 2015, https://doi.org/10.1109/TNET.2015.2478881
  2. Preserving Differential Privacy for Similarity Measurement in Smart Environments vol.2014, 2014, https://doi.org/10.1155/2014/581426