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

arXiv:1812.06425

Further Investigation on Classical Multiparty computation using Quantum Resources

Hao Cao, Wenping Ma, Ge Liu, Liang-Dong Lyu

Published Dec 16, 2018• 0 citations
arXivHTMLPDF

Abstract

The tremendous development of cloud computing and network technology makes it possible for multiple people with limited resources to complete a large-scale computing with the help of cloud servers. In order to protect the privacy of clients, secure multiparty computation plays an important role in the process of computing. Recently, Clementi et al[\textcolor[rgb]{0.00,0.07,1.00}{Phys. Rev. A {\bf 96}, 062317(2017)}] proposed a secure multiparty computation protocol using quantum resources. In their protocol, utilizing only linear classical computing and limited manipulation of quantum information, a method of computing $n-variable$ symmetric Boolean function $f(x_1, x_2, \cdots, x_n)$ with degree 2 is proposed, and all clients can jointly compute $f(x_1, x_2, \cdots, x_n)$ without revealing their private inputs with the help of a sever. They proposed an open problem: are there more simple nonlinear functions like the one presented by them that can be used as subroutines for larger computation protocols? We will give the answer to this question in this paper. Inspired by Clementi et al's work, we continue to explore the quantum realization of Boolean functions. First, we demonstrate a way to compute a class of $n-variable$ symmetric Boolean function $f_n^k$ by using single-particle quantum state $|0\rangle$ and single-particle unitary operations $U_k$. Second, we show that each $n-variable$ symmetric Boolean function can be represented by the linear combination of $f_n^k(k=0,1,\cdots,n)$ and each function $f_n^k(2\leq k\leq n)$ can be used to perform secure multiparty computation. Third, we propose an universal quantum implementation method for arbitrary $n-variable$ symmetric Boolean function $f(x_1, x_2, \cdots, x_n)$. Finally, we demonstrate our secure multiparty computation protocol on IBM quantum cloud platform.

DOI
10.48550/arxiv.1812.06425

Related papers

Quantum Secure Multiparty Computation with Symmetric Boolean Functions*

Hao Cao, Wenping Ma, Ge Liu +2 more

We propose a class of n-variable Boolean functions which can be used to implement quantum secure multiparty computation. We also give an implementation of a special quantum secure multiparty computation protocol. An advantage of our protocol is that only 1 qubit is needed to compute the n-tuple pairwise and function, which is more efficient comparing with previous protocols. We demonstrate our protocol on the IBM quantum cloud platform, with a probability of correct output as high as 94.63%. Therefore, our protocol presents a promising generalization in realization of various secure multipartite quantum tasks.

Chinese Physics Letters•May 1, 2020•4 citations

Classical multiparty computation using quantum resources

Marco Clementi, Anna Pappa, A. Eckstein +3 more

In this work, we demonstrate a way to perform classical multiparty computing among parties with limited computational resources. Our method harnesses quantum resources to increase the computational power of the individual parties. We show how a set of clients restricted to linear classical processing are able to jointly compute a nonlinear multivariable function that lies beyond their individual capabilities. The clients are only allowed to perform classical xor gates and single-qubit gates on quantum states. We also examine the type of security that can be achieved in this limited setting. Finally, we provide a proof-of-concept implementation using photonic qubits that allows four clients to compute a specific example of a multiparty function, the pairwise and.

arXiv:1708.06144•Physical Review A•Dec 18, 2017•20 citations

Multiparty Delegated Quantum Computing

Elham Kashefi, Anna Pappa

Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. We prove the security of the protocol against a dishonest server and against dishonest clients, under the assumption of common classical cryptographic constructions.

arXiv:1606.09200•Cryptography•Jul 30, 2017•78 citations

Secure Quantum Protocol for Multiparty Computation

Amitesh Kumar Pandit, Kakali Chatterjee

With the recent development in quantum computers, the classical cryptographic tools may need to be upgraded and ensure that they must be quantum resistant. Secure multiparty is one of the important cryptographic protocols, with this a team of n-players can jointly compute a function, in such a way that the input of the function will be anonymous. In this paper, we have proposed a secure multiparty summation protocol for multiparty computation in a distributed environment. In this protocol out of n, the initiator selects k players, which will compute partial summation and send these partial results to the initiator. Here the initiator plays an important role and members elect the initiator by a voting function.

International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)•Dec 18, 2020•0 citations

Quantum-Secure Multiparty Deep Learning

Kfir Sulimany, Sri Krishna Vadlamani, Ryan Hamerly +2 more

Secure multiparty computation enables the joint evaluation of multivariate functions across distributed users while ensuring the privacy of their local inputs. This field has become urgent due to the demand for computationally intensive deep learning inference. These computations are typically offloaded to cloud servers, leading to vulnerabilities. To solve this problem, we introduce a linear algebra engine that leverages the quantum nature of light for information-theoretically secure multiparty inference using telecommunication components. We apply this linear algebra engine to deep learning and derive rigorous upper bounds on the information leakage of both the deep neural network weights and the client’s data, enabling double-blind operations. Applied to the modified National Institute of Standards and Technology classification task, we obtain test accuracies exceeding 95% while guaranteeing leakage of less than 0.1 bits per weight and data element. This leakage is an order of magnitude below the minimum bit precision required for accurate deep learning using state-of-the-art quantization techniques. Our work lays the foundation for practical quantum-secure computation and unlocks secure cloud deep learning as a field.

arXiv:2408.05629•Physical Review X•Oct 31, 2025•13 citations

Quantum Secure Multiparty Computation for Privacy-Preserving AI

Made Dwi Setyadhi Mustika

Quantum Secure Multiparty Computation (QMPC) is a new way to use cryptography that lets a lot of people work together to compute a function over their private inputs while keeping those inputs secret, even if attackers have quantum computing power. As AI becomes more common in fields like healthcare, banking, and self- driving cars, secure collaborative learning becomes more and more important. But the rise of quantum computers is a big threat to the encryption methods that are commonly used in modern multiparty computation protocols. QMPC is a very secure and scalable way to protect privacy in AI. It does this by combining quantum-safe oblivious transfer (QOT), quantum key distribution (QKD), and quantum oblivious linear evaluation (qOLE). This study shows a full QMPC architecture for AI systems that are both federated and decentralized. It lets you train and use private neural networks and is safe from quantum attacks because it uses safe aggregation and encrypted processing protocols. The architecture lets AI do a lot of things, like private set intersection, federated learning, and collaborative model training, without giving away user data. A thorough security analysis based on postquantum assumptions and the universal composability paradigm makes sure that the system can withstand attackers who are adaptive, colluding, or quantum-capable. When tested against datasets like MNIST and CIFAR-10, the protocol gets results that are as accurate as plaintext models with very little extra work on the computer or network. Experiments show that when the accuracy of the model drops by less than 1%, all data privacy is still protected. This study looks at how QMPC might help make AI safer in sensitive areas like medical diagnostics and financial forecasts, as well as how it might help companies follow data protection laws like GDPR and HIPAA. Auditability and consent procedures are two of the legal and moral issues that need to be thought about. The study also talks about problems with scalability and suggests an ideal communication plan and methods like circuit pruning, quantization, and hybrid classical-quantum communication models. We look at what QMPC could do in relation to secure federated analytics, real-time collaborative robotics, and processing encrypted smart contracts. In conclusion, QMPC for privacy-preserving AI is no longer just a theory; it is now a necessary, possible, and realistic way of doing things in a world that is quickly moving toward quantum supremacy. By using quantum-resistant encryption and distributed machine learning together, QMPC creates a way to get to safe, understandable, and decentralized AI that will work in the future. This study sets the stage for future progress at the crossroads of postquantum security and collaborative intelligence.

International Journal of Quantum Computing and Artificial Intelligence (IJQCAI)•Dec 24, 2025•0 citations
The tremendous development of cloud computing and network technology makes it possible for multiple people with limited resources to complete a large-scale computing with the help of cloud servers. In order to protect the privacy of clients, secure multiparty computation plays an important role in the process of computing. Recently, Clementi et al[\textcolor[rgb]{0.00,0.07,1.00}{Phys. Rev. A {\bf 96}, 062317(2017)}] proposed a secure multiparty computation protocol using quantum resources. In their protocol, utilizing only linear classical computing and limited manipulation of quantum information, a method of computing n−variablen-variablen−variable symmetric Boolean function f(x1,x2,⋯ ,xn)f(x_1, x_2, \cdots, x_n)f(x1​,x2​,⋯,xn​) with degree 2 is proposed, and all clients can jointly compute f(x1,x2,⋯ ,xn)f(x_1, x_2, \cdots, x_n)f(x1​,x2​,⋯,xn​) without revealing their private inputs with the help of a sever. They proposed an open problem: are there more simple nonlinear functions like the one presented by them that can be used as subroutines for larger computation protocols? We will give the answer to this question in this paper. Inspired by Clementi et al's work, we continue to explore the quantum realization of Boolean functions. First, we demonstrate a way to compute a class of n−variablen-variablen−variable symmetric Boolean function fnkf_n^kfnk​ by using single-particle quantum state ∣0⟩|0\rangle∣0⟩ and single-particle unitary operations UkU_kUk​. Second, we show that each n−variablen-variablen−variable symmetric Boolean function can be represented by the linear combination of fnk(k=0,1,⋯ ,n)f_n^k(k=0,1,\cdots,n)fnk​(k=0,1,⋯,n) and each function fnk(2≤k≤n)f_n^k(2\leq k\leq n)fnk​(2≤k≤n) can be used to perform secure multiparty computation. Third, we propose an universal quantum implementation method for arbitrary n−variablen-variablen−variable symmetric Boolean function f(x1,x2,⋯ ,xn)f(x_1, x_2, \cdots, x_n)f(x1​,x2​,⋯,xn​). Finally, we demonstrate our secure multiparty computation protocol on IBM quantum cloud platform.
We propose a class of n-variable Boolean functions which can be used to implement quantum secure multiparty computation. We also give an implementation of a special quantum secure multiparty computation protocol. An advantage of our protocol is that only 1 qubit is needed to compute the n-tuple pairwise and function, which is more efficient comparing with previous protocols. We demonstrate our protocol on the IBM quantum cloud platform, with a probability of correct output as high as 94.63%. Therefore, our protocol presents a promising generalization in realization of various secure multipartite quantum tasks.
In this work, we demonstrate a way to perform classical multiparty computing among parties with limited computational resources. Our method harnesses quantum resources to increase the computational power of the individual parties. We show how a set of clients restricted to linear classical processing are able to jointly compute a nonlinear multivariable function that lies beyond their individual capabilities. The clients are only allowed to perform classical xor gates and single-qubit gates on quantum states. We also examine the type of security that can be achieved in this limited setting. Finally, we provide a proof-of-concept implementation using photonic qubits that allows four clients to compute a specific example of a multiparty function, the pairwise and.
Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. We prove the security of the protocol against a dishonest server and against dishonest clients, under the assumption of common classical cryptographic constructions.
With the recent development in quantum computers, the classical cryptographic tools may need to be upgraded and ensure that they must be quantum resistant. Secure multiparty is one of the important cryptographic protocols, with this a team of n-players can jointly compute a function, in such a way that the input of the function will be anonymous. In this paper, we have proposed a secure multiparty summation protocol for multiparty computation in a distributed environment. In this protocol out of n, the initiator selects k players, which will compute partial summation and send these partial results to the initiator. Here the initiator plays an important role and members elect the initiator by a voting function.
Secure multiparty computation enables the joint evaluation of multivariate functions across distributed users while ensuring the privacy of their local inputs. This field has become urgent due to the demand for computationally intensive deep learning inference. These computations are typically offloaded to cloud servers, leading to vulnerabilities. To solve this problem, we introduce a linear algebra engine that leverages the quantum nature of light for information-theoretically secure multiparty inference using telecommunication components. We apply this linear algebra engine to deep learning and derive rigorous upper bounds on the information leakage of both the deep neural network weights and the client’s data, enabling double-blind operations. Applied to the modified National Institute of Standards and Technology classification task, we obtain test accuracies exceeding 95% while guaranteeing leakage of less than 0.1 bits per weight and data element. This leakage is an order of magnitude below the minimum bit precision required for accurate deep learning using state-of-the-art quantization techniques. Our work lays the foundation for practical quantum-secure computation and unlocks secure cloud deep learning as a field.
Quantum Secure Multiparty Computation (QMPC) is a new way to use cryptography that lets a lot of people work together to compute a function over their private inputs while keeping those inputs secret, even if attackers have quantum computing power. As AI becomes more common in fields like healthcare, banking, and self- driving cars, secure collaborative learning becomes more and more important. But the rise of quantum computers is a big threat to the encryption methods that are commonly used in modern multiparty computation protocols. QMPC is a very secure and scalable way to protect privacy in AI. It does this by combining quantum-safe oblivious transfer (QOT), quantum key distribution (QKD), and quantum oblivious linear evaluation (qOLE). This study shows a full QMPC architecture for AI systems that are both federated and decentralized. It lets you train and use private neural networks and is safe from quantum attacks because it uses safe aggregation and encrypted processing protocols. The architecture lets AI do a lot of things, like private set intersection, federated learning, and collaborative model training, without giving away user data. A thorough security analysis based on postquantum assumptions and the universal composability paradigm makes sure that the system can withstand attackers who are adaptive, colluding, or quantum-capable. When tested against datasets like MNIST and CIFAR-10, the protocol gets results that are as accurate as plaintext models with very little extra work on the computer or network. Experiments show that when the accuracy of the model drops by less than 1%, all data privacy is still protected. This study looks at how QMPC might help make AI safer in sensitive areas like medical diagnostics and financial forecasts, as well as how it might help companies follow data protection laws like GDPR and HIPAA. Auditability and consent procedures are two of the legal and moral issues that need to be thought about. The study also talks about problems with scalability and suggests an ideal communication plan and methods like circuit pruning, quantization, and hybrid classical-quantum communication models. We look at what QMPC could do in relation to secure federated analytics, real-time collaborative robotics, and processing encrypted smart contracts. In conclusion, QMPC for privacy-preserving AI is no longer just a theory; it is now a necessary, possible, and realistic way of doing things in a world that is quickly moving toward quantum supremacy. By using quantum-resistant encryption and distributed machine learning together, QMPC creates a way to get to safe, understandable, and decentralized AI that will work in the future. This study sets the stage for future progress at the crossroads of postquantum security and collaborative intelligence.