Journal of Qiqihar University

Some secure two-party computation protocols for the operations of matrix

Guodong Zhang

Published Jan 1, 2009• 0 citations

Abstract

The secure protocol for the sum of two matrices had been proposed by using Oblivious Transfer 1 out of p protocol in this paper.Then based this protocol,the secure two-party protocols for computing the rank of sum of two matrices,the full rank factorization of matrix and the generalized inverse of matrix had been constructed.Finally,the security and correctness of the protocols had been described.

Related papers

Secure two-party protocol of inverse of matrices

Huanping Liu

Secure Multi-party Computation(SMC) about which people have got some research findings at home and abroad has been a research focus in international cryptographic community recently,and this paper proposes a new protocol for the inverse of n×n matrices by using Oblivious Transfer 1 out of p protocol in the secure two-party computation environment.The protocol can be used to solve the problem securely and more efficiently.Then gives a new protocol for secure two-party linear system of equations based on it.

Computer Engineering and Applications JournalJan 1, 20080 citations

Research on Secure Multi-party Ranking Problem and Secure Selection Problem

Cheng Chao, Yonglong Luo, Caixia Chen +1 more

In this paper, the problems of secure multi-party ranking and secure selection were studied. Two protocols were proposed. They were both based on Secure Sum protocol. Secure multi-party ranking problem is an extended problem from millionaires' problem. It can be applied to many fields, such as auctions, commercial enterprises and so on. Secure Sum protocol was used to calculate the sum of vectors. The security and complexity were analyzed in the semi-honest model. In some cases this protocol is better. This paper also studied the problem of secure selection and proposed a protocol using the protocols of Secure Sum and 1-n oblivious transfer. We analyzed the worst case and the average case.

International Conference on Web Information Systems and Mining (WISM)Oct 1, 20105 citations

Secure Two-Party Computation via Leaky Generalized Oblivious Transfer.

Samuel Ranellucci, Alain Tapp

We construct a very efficient protocol for constant round Two-Party Secure Function Evaluation based on general assumptions. We define and instantiate a leaky variant of Generalized Oblivious Transfer based on Oblivious Transfer and Commitment Schemes. The concepts of Garbling Schemes, Leaky Generalized Oblivious Transfer and Privacy Amplification are combined using the Cut-and-Choose paradigm to obtain the final protocol. Our solution is proven secure in the Universal Composability Paradigm.

Jan 1, 20130 citations

Study on Commitment Schemes of Secure Multi-party Computation

Xiaoqiang Guo, Yan Yan, Lihong Li +1 more

The problem of secure multi-party computation(SMPC) is one of the most fundamental problems in information security. First, we introduce the basic concept of SMPC and four SMPC basic agreement: key distribution,oblivious transfer, bit commitment and zero knowledge proof. Secondly, we separately illustrate commitment schemes commitment transfer protocol, commitment sharing protocol and commitment multiplication protocol. Finally, we present unconditionally secure multi-party computation with a passive adversary, an active adversary, general adversary structures.

Indonesian Journal of Electrical Engineering and Computer ScienceOct 1, 20140 citations

The Secure Multi-Party Protocol of Matrix Product and Its Application

Luo Wen

Wenliang Du has been studied some secure two-party scientific computation problems [4] : Linear systems of equations problems, Linear least squares problems and Linear programming problems. And he point to: (1)There are some other interesting scientific computation problems that need to be studied, such as how secure compute eigenvalues of matrix. (2)Extension to the secure multi-party computation problem, and thought extension secure two-party computation protocols to the secure multi-party computation protocols is not trivial. In this paper, authors disscuss two scientific computation problems: eigenvalues of matrix in secure multi-party computation situation, and give some secure multi-party scientific computation protocols.

Chinese Journal of ComputersJan 1, 20058 citations

Secure and fair two-party computation

Mehmet Sabır Kiraz

Consider several parties that do not trust each other, yet they wish to correctly compute some common function of their local inputs while keeping these inputs private. This problem is known as "Secure Multi-Party Computation", and was introduced by Andrew Yao in 1982. Secure multi-party computations have some real world examples like electronic auctions, electronic voting or fingerprinting. In this thesis we consider the case where there are only two parties involved. This is known as "Secure Two-Party Computation". If there is a trusted third party called Carol, then the problem is pretty straightforward. The participating parties could hand their inputs in Carol who can compute the common function correctly and could return the outputs to the corresponding parties. The goal is to achieve (almost) the same result when there is no trusted third party. Cryptographic protocols are designed in order to solve these kinds of problems. These protocols are analyzed within an appropriate model in which the behavior of parties is structured. The basic level is called the Semi-Honest Model where parties are assumed to follow the protocol specification, but later can derive additional information based on the messages which have been received so far. A more realistic model is the so-called Malicious Model. The common approach is to first analyze a protocol in the semi-honest model and then later extend it into the malicious model. Any cryptographic protocol for secure two-party computation must satisfy the following security requirements: correctness, privacy and fairness. It must guarantee the correctness of the result while preserving the privacy of the parties’ inputs, even if one of the parties is malicious and behaves arbitrarily throughout the protocol. It must also guarantee fairness. This roughly means that whenever a party aborts the protocol prematurely, he or she should not have any advantage over the other party in discovering the output. The main question for researchers is to construct new protocols that achieve the above mentioned goals for secure multi-party computation. Of course, such protocols must be secure in a given model, as well as be as efficient as possible. In 1986, Yao presented the first general protocol for secure two-party computation which was applicable only to the semi-honest model. He uses a tool called "Garbled Circuit". Yao’s protocol uses the underlying primitives ("Pseudorandom Generator" and "Oblivious Transfer") as blackboxes which lead to efficient results. After Yao’s work many variants and improvements have been proposed for the malicious model. In this thesis, we design several new protocols for secure two-party computation based on Yao’s garbled circuit. Before we present the details of our new designs, we first show several weaknesses, security flaws or problems with the existing protocols in the literature. We first work in the semi-honest model and then extend it into the malicious model by presenting new protocols. Finally we add fairness to our protocol. Oblivious transfer (OT) is a fundamental primitive in modern cryptography which is useful for implementing protocols for secure multi-party computation. We study several variants of oblivious transfer in this thesis. We present a new protocol for the so-called "Committed OT". This protocol is very efficient in the sense that it is quite good in comparison to the most efficient committed OT protocols in the literature. The abovementioned flaw with the use of OT can be fixed with our committed oblivious transfer protocol. Furthermore, it is more general than all previous protocols, and, therefore, it is of independent interest. We also deal with fairness in this thesis. For protocols based on garbled circuit, so far only Benny Pinkas has presented a protocol in the literature for achieving fairness. We show a subtle problem with this protocol where the privacy of the inputs of one party can be compromised. We also describe this problem in detail which is in fact related to the fairness, and finally propose a more efficient scheme that does achieve fairness.

Jan 1, 200719 citations