Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information Sciences

Secure Multi-Party Computation: Theory, practice and applications

Chuan Zhao, Shengnan Zhao, Minghao Zhao, Zhenxiang Chen, Chong-Zhi Gao, Hongwei Li, Yu‐an Tan

Published Oct 16, 2018• 509 citations
Publisher
DOI
10.1016/j.ins.2018.10.024

Related papers

Advances in Key Techniques of Practical Secure Multi-Party Computation

Han Jiang, Qiuliang Xu

Journal of Computer Research and Development•Oct 1, 2015•2 citations

A practical approach to solve Secure Multi-party Computation problems

Wenliang Kevin Du, Zhijun Zhan

New Security Paradigms Workshop•Jan 1, 2002•40 citations

Secure multi-party computation problems and their applications

Wenliang Kevin Du, Mikhail J. Atallah

New Security Paradigms Workshop•Jan 1, 2001•18 citations

Research and Application of Secure Multi-party Computation Protocols

Ke Chen

•Jan 1, 2003•2 citations

Distributed Proof Theory and Secure Multi-Party Computation

Jincheng Zhang

This paper presents a novel approach to secure multi-party computation (MPC) leveraging the theoretical framework of Distributed Proof Theory (DPT). Traditional MPC schemes frequently exhibit substantial communication overhead, hindering their practical deployment, particularly in resource-constrained environments. Our methodology addresses this limitation by employing DPT to construct MPC protocols that guarantee provable security while dramatically reducing the number of communication rounds. The core innovation lies in the efficient use of DPT's algebraic techniques to distill the essential computational steps, effectively eliminating redundant operations. We demonstrate that by carefully selecting and manipulating algebraic structures within the DPT framework, we can achieve comparable security levels to existing MPC protocols with significantly improved performance. This work represents a substantial advancement in the field, offering a more practical and secure solution for distributed computation. The presented protocols are designed for scenarios demanding high efficiency and minimal communication, opening avenues for applications in privacy-preserving data analysis, secure voting systems, and distributed machine learning. ---

•Sep 5, 2026•0 citations

A novel quantum security multi-party extremum protocol in a d-dimensional quantum system

Yaohua Lu, Gangyi Ding

Abstract Secure multi-party extremum computation (SMEC) is a specific application scenario of secure multi-party computation, which allows multiple participants to compute the extremum of data without disclosing private information. The extremum includes maximum, minimum, sum of extremums, and difference of extremums. SMEC has wide applications in financial transactions, market analysis, sports events, healthcare, etc. Current protocol research mainly exists in the classical domain and cannot withstand quantum computing attacks. To address this issue, we propose a novel QSME protocol based on a d-dimensional quantum system, capable of computing the maximum and minimum values among multi-party data under unconditional security, and can compute the sum and difference of extremums without disclosing the maximum and minimum values, to adapt to complex application scenarios. The article proposes a coding method for a d-dimensional quantum system to further enhance security, provides correctness analysis, security analysis, robustness analysis, and comparative analysis, and proposes an experimental method for a d-dimensional quantum system to verify the effectiveness of the protocol, demonstrating strong practicality.

Physica Scripta•Aug 14, 2024•6 citations
This paper presents a novel approach to secure multi-party computation (MPC) leveraging the theoretical framework of Distributed Proof Theory (DPT). Traditional MPC schemes frequently exhibit substantial communication overhead, hindering their practical deployment, particularly in resource-constrained environments. Our methodology addresses this limitation by employing DPT to construct MPC protocols that guarantee provable security while dramatically reducing the number of communication rounds. The core innovation lies in the efficient use of DPT's algebraic techniques to distill the essential computational steps, effectively eliminating redundant operations. We demonstrate that by carefully selecting and manipulating algebraic structures within the DPT framework, we can achieve comparable security levels to existing MPC protocols with significantly improved performance. This work represents a substantial advancement in the field, offering a more practical and secure solution for distributed computation. The presented protocols are designed for scenarios demanding high efficiency and minimal communication, opening avenues for applications in privacy-preserving data analysis, secure voting systems, and distributed machine learning. ---
Abstract Secure multi-party extremum computation (SMEC) is a specific application scenario of secure multi-party computation, which allows multiple participants to compute the extremum of data without disclosing private information. The extremum includes maximum, minimum, sum of extremums, and difference of extremums. SMEC has wide applications in financial transactions, market analysis, sports events, healthcare, etc. Current protocol research mainly exists in the classical domain and cannot withstand quantum computing attacks. To address this issue, we propose a novel QSME protocol based on a d-dimensional quantum system, capable of computing the maximum and minimum values among multi-party data under unconditional security, and can compute the sum and difference of extremums without disclosing the maximum and minimum values, to adapt to complex application scenarios. The article proposes a coding method for a d-dimensional quantum system to further enhance security, provides correctness analysis, security analysis, robustness analysis, and comparative analysis, and proposes an experimental method for a d-dimensional quantum system to verify the effectiveness of the protocol, demonstrating strong practicality.