Distributed Proof Theory and Secure Multi-Party Computation

Jincheng Zhang

Published Sep 5, 2026• 0 citations

Abstract

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. ---

DOI: 10.5281/zenodo.22315070

Related papers

Secure Multi-Party Computation: A and Future Directions

Dr. Emily J. Carter, Dr. Michael Brown

Secure Multi-Party Computation (MPC) is a cryptographic framework that enables multiple parties to jointly compute a function over their inputs while keeping those inputs private. MPC has found applications in privacy-preserving data analytics, secure voting, private machine learning, and secure financial transactions. This article provides a comprehensive survey of recent advances in MPC protocols, including fully homomorphic encryption, garbled circuits, and oblivious transfer. It also explores the challenges in efficiency, scalability, and real-world deployment of MPC and discusses future research directions to enhance its practicality and security.

American Journal Of Cryptography And Network SecurityApr 30, 20200 citations

Secure Multi-Party Computation Protocol Based on Quantum Key Distribution

Jincheng Zhang

This paper presents a novel protocol for secure multi-party computation (MPC) leveraging the security of quantum key distribution (QKD). The core claim is to design a protocol that guarantees secure computation among multiple participants. The proposed mechanism utilizes the inherent security of QKD to construct a framework for secure multi-party computation. This approach addresses the limitations of traditional MPC protocols that often rely on computationally intensive assumptions, offering a potentially more robust solution in the face of evolving cryptographic threats. The protocol details the steps involved in generating a shared secret key through QKD, followed by the secure computation process based on the key. We outline the mathematical foundations and formalize the protocol's components, demonstrating its feasibility and potential advantages. The protocol is designed to be adaptable and scalable, offering a viable route toward secure distributed computing in quantum-enhanced environments.

Aug 28, 20260 citations

Quantum-Inspired Secure Multi-Party Computation via Tensor Networks

Jincheng Zhang

Secure Multi-Party Computation (SMPC) aims to enable computation on sensitive data without revealing the individual inputs of the participants. Traditional SMPC protocols often suffer from significant computational overhead, particularly in terms of communication complexity. This paper proposes a novel approach to SMPC leveraging tensor network techniques inspired by quantum computation. We demonstrate that tensor networks can efficiently represent and manipulate the necessary data structures for SMPC protocols, leading to a substantial reduction in communication overhead and improved scalability. Our method utilizes the inherent structure of tensor networks to minimize the number of exchanges required during computation, effectively addressing a key bottleneck in existing SMPC implementations. We outline the theoretical foundations and present a framework for designing SMPC protocols using tensor networks. This work represents a significant step towards practical and efficient SMPC solutions, particularly for large-scale datasets and complex computations. The key contribution lies in the application of quantum-inspired techniques to solve classical computational problems, specifically within the context of secure computation.

Sep 3, 20260 citations

Quantum Computation Security Multi-Party Computation Protocol Based on Quantum Coherence

Jincheng Zhang

This paper proposes a novel multi-party computation (MPC) protocol leveraging the inherent security properties of quantum coherence, specifically quantum decoherence. The protocol is designed to achieve a high level of security, mitigating the risk of information leakage even in the presence of malicious adversaries. The core mechanism involves constructing a communication protocol where carefully designed decoherence time windows effectively isolate the computation process, preventing adversaries from intercepting sensitive data. The protocol's security relies on the probabilistic nature of quantum decoherence, making it computationally infeasible for an attacker to successfully extract the result without disrupting the computation. We present a detailed mathematical formulation of the protocol, focusing on the key parameters influencing security and efficiency. This approach offers a fundamentally different security paradigm compared to traditional MPC protocols, presenting a promising avenue for secure distributed computation in quantum computing environments. The protocol is evaluated theoretically, demonstrating its potential to provide robust security against various attack scenarios.

Aug 31, 20260 citations

Distributed Proof Theory for Quantum Algorithm Design

Jincheng Zhang

This paper explores the application of Distributed Proof Theory (DPT) to the design of quantum algorithms. DPT, traditionally used in classical algorithm analysis and complexity theory, provides a framework for decomposing problems into smaller, manageable parts. This decomposition can be directly translated into a strategy for constructing efficient proofs of correctness for quantum circuits. We argue that the core strength of DPT lies in its ability to generate minimal, high-level proofs that accurately capture the essence of a quantum algorithm's behavior. The approach presented here avoids the complexities often associated with directly simulating quantum systems, offering a potentially more tractable and insightful method for designing quantum algorithms. We focus on the construction of proofs that leverage the inherent parallelism of quantum computation and demonstrate how DPT can guide the creation of algorithms with reduced resource requirements. The potential of this framework is significant, offering a new perspective on quantum algorithm design and fostering the development of more robust and efficient quantum solutions.

Sep 3, 20260 citations

Quantum Network Secure Multi-Party Computation

Jincheng Zhang

This paper explores the design and implementation of a secure multi-party computation (MPC) protocol within a quantum network environment. The core aim is to facilitate computation among multiple parties while guaranteeing the confidentiality of their inputs and the overall computation results. This is achieved by leveraging the principles of Quantum Key Distribution (QKD) and the inherent security provided by the quantum state's properties. We present a protocol that utilizes QKD for secure key exchange among participants and employs quantum state manipulation to obscure intermediate values during computation. The protocol addresses the challenges posed by quantum eavesdropping and ensures the integrity of the final outcome. The key contributions of this work lie in the integration of established MPC techniques with the unique capabilities of a quantum network, offering a novel approach to secure distributed computation. The theoretical analysis demonstrates the protocol's security under specific assumptions, and outlines potential avenues for future research and optimization.

Aug 28, 20260 citations