Research on the Millionaires' Problem under the Malicious Model Based on the Elliptic Curve Cryptography

【Author】 Liu, Xin; Xu, Yang; Xu, Gang; Li, Baoshan

【Source】SECURITY AND COMMUNICATION NETWORKS

【影响因子】1.968

【Abstract】With the rapid development of blockchain, big data, cloud computing, and artificial intelligence, the security of multisource data collaborative computing has become increasingly prominent. Secure multiparty computing has become the core technology of privacy collaborative computing. Millionaires' problem is the cornerstone of secure multiparty computation. Firstly, this paper proposes a 0-1 coding rule, which is used to solve the millionaires' problem under the semihonest model. Aiming at the possible malicious behaviors of the protocol under the semihonest model, the millionaires' problem protocol under the malicious model based on the elliptic curve cryptography is designed by using cryptographic tools such as the zero-knowledge proof and the cut-choose method. This protocol not only can effectively solve the millionaires' problem but also can safely and effectively prevent malicious behaviors. Meanwhile, the security ordering designed by the protocol can be effectively applied to a quality evaluation in the blockchain.

【Keywords】

【发表时间】2022 MAR 24

【收录时间】2022-05-21

【文献类型】理论性文章

【主题类别】

区块链技术-协同技术-隐私计算