A practical approach to solve Secure Multi-party Computation problems

Chuan Zhao, Shengnan Zhao, Minghao Zhao +4 more

Wenliang Kevin Du, Mikhail J. Atallah

Xue Ge, Jiawei Dou, Wenli Wang +1 more

Abstract Applying secure multi‐party computation (SMC) to implement secure linear programming is an important problem of SMC. Private feasible solution determination means that one of the participants has a private value and the other participants have some constraints, and they want to cooperatively determine whether the private value satisfies the constraints without disclosing their private information. This problem has important theoretical and practical significance in both scientific research and practice. In this study, the authors propose a protocol based on elliptic curve cryptosystem for this problem and prove that the protocol is secure in the semi‐honest model. Furthermore, threshold decryption elliptic curve cryptosystem is used to privately determine a feasible solution with multiple constraints for two‐party and multi‐party scenarios. The efficiency analysis shows that the protocols developed in this study are simple and efficient. Finally, the authors also show how to use these protocols to solve other SMC problems.

CHENG Wen, LI Shundong, WANG Wenli

Secure multi-party computation (SMC) is a research hotspot in cryptography in recent years, and is also a key technology for information security protection. The interval secure multi-party computation problems have important theoretical significance in cryptography. Previous studies rarely involve secret interval, that is, interval is generated by two-party or multi-party, and any one knows nothing about the interval information. The secret interval problems have important practical significance in real life. This paper mainly studies the privacy-preserving determination of secret interval and threshold. Firstly, for the secret interval is generated by two-party, based on Paillier’s homomorphic encryption, this paper proposes a protocol. Secondly, for the secret interval is generated by multi-party, this paper proposes an optimization protocol that uses the coding principle combined with Lifted ElGamal homomorphic encryption. Thirdly, this paper proves the protocols can resist collusion attacks, and proves they are safe by using the simulation paradigm. Finally, many practical application problems can be solved by using the protocols proposed in this paper.

Martin Hirt, Ueli M. Maurer, Bartosz Przydatek

Yaohua Lu, Gangyi Ding

Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.