An Improved Secure Two-Party Computation Protocol

Thomas H. Schneider

Junming Zhang

Secure Multiparty Computation protocol is an important area in cryptography.The research of multi-party computation was a subject of great importance in the international cryptographic circle.A key agreement scheme based on secure two-party computation is improved.Three schemes are proposed.It can be proved that even if Eve gets the same data as the receiver,the schemes are still secure.

Yan Huang, David Evans, Jonathan I. Katz +1 more

Secure two-party computation enables two parties to evaluate a function cooperatively without revealing to either party anything beyond the function's output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its inefficiency. We demonstrate several techniques for improving the running time and memory requirements of the garbled-circuit technique, resulting in an implementation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits. We validate our approach by demonstrating secure computation of circuits with over 109 gates at a rate of roughly 10 microseconds per garbled gate, and showing order-of-magnitude improvements over the best previous privacy-preserving protocols for computing Hamming distance, Levenshtein distance, Smith-Waterman genome alignment, and AES.

Thomas H. Schneider, Michael Zohner

Zhengtao Jiang, Ting Yu, Huiqiang Li +1 more

The millionaire’s problem is the origin of secure multi-party computation. This problem has always been the focus of scholars' research, and it is also the design basis and important part of other secure multi-party computation protocols. An in-depth study of the millionaires’ problem is of great significance to promote the further development of secure multi-party computation. Based on millionaires’ problem and secure vector dominance protocol, we propose an improved protocol and an extended protocol. The improved protocol solves the problem of coarse granularity when comparing elements in the original protocol, and can realize that two parties can compare the relationships of greater than, equal to or less than between their elements by executing the protocol once. The improved protocol and the extended protocol are further applied to solve the problem of finding the cardinality of the intersection of the two-party sets in two cases. In addition, based on the integer division problem, we give a method to privately evaluate the greatest common factor of two integers.

Mehmet Sabır Kiraz, Berry Schoenmakers