網際網路技術學刊

Confidentially Compare Rational Numbers under the Malicious Model

Xin Liu Xin Liu, Xiaomeng Liu Xin Liu, Dan Luo Xiaomeng Liu, Gang Xu Dan Luo, Xiu-Bo Chen Gang Xu

Published May 1, 2024• 0 citations

Abstract

Secure multi-party computation is a hotspot in the cryptography field, and it is also a significant means to realize privacy computation. The Millionaires’ problem is the most fundamental problem among them, which is the basic module of secure multi-party computation protocols. Although there are many solutions to this problem, there are few anti-malicious adversarial protocols besides protocols based on Yao’s garbled circuit. Only a few solutions have low efficiency, and there is no protocol for rational numbers comparison under the malicious model, which restricts the solution of many secure multi-party computation problems. In this paper, the possible malicious behaviors are analyzed in the existing Millionaires’ problem protocols. These behaviors are discovered and taken precautions against through the triangle area formula, zero-knowledge proof, and cut-and-choose method, so the protocol of comparing confidentially rational numbers is proposed under the malicious model. And this paper adopts the real/ideal model paradigm to prove the security of the malicious model protocol. Efficiency analysis indicates that the proposed protocol is more effective than existing protocols. The protocol of rational numbers comparison under the malicious model is more suitable for the practical applications of secure multi-party computation, which has important theoretical and practical significance.

DOI: 10.53106/160792642024052503002

Related papers

Protocol for millionaires' problem in malicious models

顺东 LI, 文丽 WANG, 润萌 DU

Secure multiparty computation is a focus of the international cryptographic community. The millionaires problem is the most important problem in secure multiparty computation and is a building block for constructing other secure multiparty computation protocols. Several solutions are available to solve this problem, but except for protocols based on garbled circuits, the existing solutions based on public key cryptosystems are only secure in semihonest models. No solution based on a public key cryptosystem is secure against malicious adversaries. This state restricts the resolution of many secure multiparty computation problems in malicious scenarios. A solution that is secure in malicious models is highly applicable in practical application scenarios and is generally appealing. Therefore, the study of the solution to the millionaires problem in a malicious model is of great theoretical and practical significance. In this work, we propose a multiparty computation protocol for the millionaires problem that is secure in a semihonest model. The proposed protocol is simple and easily understandable. We analyze the possible malicious behaviors in this protocol and use zero-knowledge proof and cut-and-choose techniques to resist possible malicious behaviors and thereby convert the protocol into one that is secure in the malicious model. We prove that the proposed protocol is secure in the malicious model by using the well-accepted ideal-real paradigm. Theoretical efficiency analysis shows that the efficiency of our protocol is at least six times that of existing protocols.

Scientia Sinica InformationisDec 22, 202021 citations

Improvement of the protocol for millionaires’ problem

Zhengtao Jiang, Ye Chen, Huiqiang Li +1 more

As the basic problem that introduces the idea of secure multi-party computation (SMC), millionaires’ problem (MP) is one of the research highlights in the field of SMC. However, most of current protocols for MP are only secure in semi-honest model, which using public key cryptography schemes, and there are few secure schemes in malicious model exist security defects. Therefore, this paper analyzes the Li et al.’s protocol for MP that secure in malicious model. Firstly, we point out several behaviours that can be successfully implemented in Li et al.’s protocol. Secondly, by using the zero-knowledge proof (ZKP) for the equality of discrete logarithm (DL), cut-and-choose method etc. We propose the improved protocol and show how to detect malicious behaviours. Finally, we analyze the correctness and security against malicious behaviours of the improved protocol.

International Conference on Computer Information Science and Application Technology (CISAT)Oct 20, 20220 citations

Secure Comparison Under Ideal/Real Simulation Paradigm

Chuan Zhao, Shengnan Zhao, Bo Zhang +3 more

Secure comparison problem, also known as Yao's Millionaires' problem, was introduced by Andrew Yao in 1982. It is a fundamental problem in secure multi-party computation. In this problem, two millionaires are interested in determining the richer one between them without revealing their actual wealth. Yao's millionaires' problem is a classic and fundamental problem in cryptography. The design of secure and efficient solutions to this problem provides effective building blocks for secure multi-party computation. However, only a few of the solutions in the literature have succeeded in resisting attacks of malicious adversaries, and none of these solutions has been proven secure in malicious model under ideal/real simulation paradigm. In this paper, we propose two secure solutions to Yao's millionaires' problem in the malicious model. One solution has full simulation security, and the other solution achieves onesided simulation security. Both protocols are only based on symmetric cryptography. Experimental results indicate that our protocols can securely solve Yao's millionaires' problem with high efficiency and scalability. Furthermore, our solutions show better performance than the state-of-the-art solutions in terms of complexity and security. Specifically, our solutions only require O(|U|) symmetric operations at most to achieve simulation-based security against malicious adversaries, where U denotes the universal set and |U| denotes the size of U.

IEEE AccessJan 1, 20181 citation

Secure Judgment of Point and Line Relationship Against Malicious Adversaries and Its Applications

Xin Liu Xin Liu, Yang Xu Xin Liu, Gang Xu Yang Xu +2 more

With the rapid development of the Internet and information technology, the problem of zero-trust networks has become increasingly prominent, and secure multi-party computation has become a research hotspot to solve the problem of zero-trust networks. The secure judgment of point and line relationship is an important research branch of secure computing set geometry. However, most of resent secure computing protocols of point and line relationship are designed in the semi-honest model and cannot resist malicious attacks. Therefore, this paper analyzes the possible malicious adversary behaviors and designs a secure protocol in the malicious model. In this paper, the Paillier cryptosystem, zero- knowledge proof, and cut-choose method are used to resist malicious behavior, and the real/ideal model paradigm method is used to prove the security of the protocol. Compared with the existing solutions, the malicious model protocol is still efficient and widely used in real applications.

網際網路技術學刊Sep 1, 20224 citations

Improved Protocol of Yao’s Millionaires Problem

Huiqiang Li, Zhengtao Jiang, Ting Yu +1 more

Secure multi-party computation is a hot research topic in cryptography in recent years, and has become an important research direction in cryptography. This paper studies the millionaires’ problem in secure multi-party computation, and its essence is a comparison issue about the size of two encrypted data. Yao offered a solution to the millionaires’ problem, but his protocol can’t accurately compare two numbers. We improved Yao’s protocol and proposed two generic protocols to solve the millionaires’ problem. Our first protocol has one more round of communication between participants than Yao’s, but our protocol can accurately compare the size of two numbers. The second protocol improved the first protocol, and only one round of communication is needed to get accurate comparison results. Finally, we realized the second protocol based on RSA encryption algorithm, and analyze the security under the semi-honest model.

IEEE/ACIS International Conference on Computer and Information Science (ICIS)Jun 26, 20222 citations

Securely Computing the Manhattan Distance under the Malicious Model and Its Applications

Xin Liu, Xiaomeng Liu, Ruiling Zhang +3 more

Manhattan distance is mainly used to calculate the total absolute wheelbase of two points in the standard coordinate system. The secure computation of Manhattan distance is a new geometric problem of secure multi-party computation. At present, the existing research secure computing protocols for Manhattan distance cannot resist the attack of malicious participants. In the real scene, the existence of malicious participants makes it necessary to study a solution that can resist malicious attacks. This paper first analyzes malicious attacks of the semi-honest model protocol of computing Manhattan distance and then designs an advanced protocol under the malicious model by using the Goldwasser–Micali encryption system and Paillier encryption algorithm, and utilizing some cryptographic tools such as the cut-choose method and zero-knowledge proof. Finally, the real/ideal model paradigm method is used to prove the security of the malicious model protocol. Compared with existing protocols, the experimental simulation shows that the proposed protocol can resist malicious participant attacks while maintaining high efficiency. It has practical value.

Applied SciencesNov 17, 202213 citations