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

Ju-Sung Kang and Dowon Hong
Volume: 3, No: 1, Page: 21 ~ 25, Year: 2007

Keywords: SMC. Practical SMC, Privacy, Linear system of equations
Full Text:

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 collusionresistance, 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©÷§¤¥ì) of [4], in which the oblivious transfer protocol is used as an important building block.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Ju-Sung Kang and Dowon Hong , "A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations," Journal of Information Processing Systems, vol. 3, no. 1, pp. 21~25, 2007. DOI: .

ACM Style
Ju-Sung Kang and Dowon Hong , "A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations," Journal of Information Processing Systems, 3, 1, (2007), 21~25. DOI: .