Scalar-product based Secure Two-party Computation

—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith party, and returns to that party. The sub-problem of secure multiparty computation that has received special attention by researchers because of its close relation to many cryptographic tasks is secure two-party computation. This area of research is concerned with the question: ’Can two party computation be achieved more efficiently and under weaker security assumptions than general multiparty compuation? Yao’s protocol [17] provided security security against passive adversaries. Lindell and Pinkas [14] proposed secure two party protocols that are secure against active adversaries. In this paper, we would like to propose a set of information theoretically secure protocols based on scalar product protocol. The detailed complexity analysis has been provided.

• Type: Conference
• Year: 2008
• Where: GRC
• Authors: Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang
• Keywords: Applied Computing, GRC 2008, Multiparty Computation, Secure Multi-party Computation, Secure Multiparty Computation