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

International Conference on Advances in Computing, Communication Control and Networking (ICAC3N)

Secure Quantum Protocol for Multiparty Computation

Amitesh Kumar Pandit, Kakali Chatterjee

Published Dec 18, 2020• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icacccn51052.2020.9362954

Related papers

A Generalized Quantum Protocol for Secure Multiparty Summation

Kartick Sutradhar, Hari Om

The secure multiparty quantum summation is an important primitive of quantum cryptography. The existing multiparty quantum summation protocols have (n, n) threshold approach, where n out of total n players need compute the summation protocol. In this brief, we present a generalized secure multiparty quantum summation protocol. In our protocol, the linear secret sharing (LSS) and Quantum Fourier Transform (QFT) are used to take the advantages of both classical and quantum summation. We show that the outside and participant attacks are not possible in our protocol. We simulate it using the real quantum processor released by IBM corporation on “cloud”.

IEEE Transactions on Circuits & Systems II Express Briefs•Apr 22, 2020•40 citations

An efficient simulation for quantum secure multiparty computation

Kartick Sutradhar, Hari Om

The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation's online quantum computer, or quantum experience.

Scientific Reports•Jan 26, 2021•36 citations

Hybrid Quantum Protocols for Secure Multiparty Summation and Multiplication

Kartick Sutradhar, Hari Om

The summation and multiplication are two basic operations for secure multiparty quantum computation. The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players. In this paper, we propose two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication based on the Shamir's secret sharing, SUM gate, quantum fourier transform, and generalized Pauli operator, where t is a threshold number of players that can perform the summation and multiplication. Their computation type is secret-by-secret with modulo d, where d, n ≤ d ≤ 2n, is a prime. The proposed protocols can resist the intercept-resend, entangle-measure, collusion, collective, and coherent quantum attacks. They have better computation as well as communication costs and no player can get other player's private input.

Scientific Reports•Jun 4, 2020•57 citations

Cryptographic collusion-resistant protocols for secure sum

Ahmad Baraani Dastjerdi, Maede Ashouri Talouki

Secure summation is one of the most applicable functions of secure multiparty computation (MPC) in which a group of users securely computes the summation value of their private inputs. The current solutions to this problem are basically on adding a random number to private inputs or splitting the inputs among users which need secure channel among members. Moreover, to be resistant against collusion of n − 2 players, they impose high communication cost. In this paper, we propose three cryptography-based protocols for secure sum that do not need secure channel and are secure against collusion of n − 2 players. Also, the communication cost of the proposed protocols is of complexity O(n). Based on the privacy requirements, the proposed protocols can provide the final result privacy as well as the private input privacy.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2017•1 citation

Cryptographic collusion-resistant protocols for secure sum

Maede Ashouri-Talouki, Ahmad Baraani Dastjerdi

Secure summation is one of the most applicable functions of secure multiparty computation (MPC) in which a group of users securely computes the summation value of their private inputs. The current solutions to this problem are basically on adding a random number to private inputs or splitting the inputs among users which need secure channel among members. Moreover, to be resistant against collusion of n − 2 players, they impose high communication cost. In this paper, we propose three cryptography-based protocols for secure sum that do not need secure channel and are secure against collusion of n − 2 players. Also, the communication cost of the proposed protocols is of complexity O(n). Based on the privacy requirements, the proposed protocols can provide the final result privacy as well as the private input privacy.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2017•2 citations

An efficient secure multiparty quantum computation protocol

Song Lin, Ning Wang, LIU Xiao-Fen

Secure multiparty computing is an important class of cryptographic primitives and is widely used in electronic voting, data mining, blockchain, cloud computing and other fields. In this paper, we propose an efficient secure multiparty quantum computation protocol based on quantum entanglement and the Euler theorem. In this protocol, all participants can safely compute multivariate polynomial functions with the help of a semitrusted third party. A performance analysis shows that the protocol is correct and can resist some common external and internal attacks. Additionally, the proposed protocol not only improves particle detection efficiency but also effectively reduces the communication complexity.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Feb 15, 2023•8 citations
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.
The secure multiparty quantum summation is an important primitive of quantum cryptography. The existing multiparty quantum summation protocols have (n, n) threshold approach, where n out of total n players need compute the summation protocol. In this brief, we present a generalized secure multiparty quantum summation protocol. In our protocol, the linear secret sharing (LSS) and Quantum Fourier Transform (QFT) are used to take the advantages of both classical and quantum summation. We show that the outside and participant attacks are not possible in our protocol. We simulate it using the real quantum processor released by IBM corporation on “cloud”.
The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation's online quantum computer, or quantum experience.
The summation and multiplication are two basic operations for secure multiparty quantum computation. The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players. In this paper, we propose two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication based on the Shamir's secret sharing, SUM gate, quantum fourier transform, and generalized Pauli operator, where t is a threshold number of players that can perform the summation and multiplication. Their computation type is secret-by-secret with modulo d, where d, n ≤ d ≤ 2n, is a prime. The proposed protocols can resist the intercept-resend, entangle-measure, collusion, collective, and coherent quantum attacks. They have better computation as well as communication costs and no player can get other player's private input.
Secure summation is one of the most applicable functions of secure multiparty computation (MPC) in which a group of users securely computes the summation value of their private inputs. The current solutions to this problem are basically on adding a random number to private inputs or splitting the inputs among users which need secure channel among members. Moreover, to be resistant against collusion of n − 2 players, they impose high communication cost. In this paper, we propose three cryptography-based protocols for secure sum that do not need secure channel and are secure against collusion of n − 2 players. Also, the communication cost of the proposed protocols is of complexity O(n). Based on the privacy requirements, the proposed protocols can provide the final result privacy as well as the private input privacy.
Secure summation is one of the most applicable functions of secure multiparty computation (MPC) in which a group of users securely computes the summation value of their private inputs. The current solutions to this problem are basically on adding a random number to private inputs or splitting the inputs among users which need secure channel among members. Moreover, to be resistant against collusion of n − 2 players, they impose high communication cost. In this paper, we propose three cryptography-based protocols for secure sum that do not need secure channel and are secure against collusion of n − 2 players. Also, the communication cost of the proposed protocols is of complexity O(n). Based on the privacy requirements, the proposed protocols can provide the final result privacy as well as the private input privacy.
Secure multiparty computing is an important class of cryptographic primitives and is widely used in electronic voting, data mining, blockchain, cloud computing and other fields. In this paper, we propose an efficient secure multiparty quantum computation protocol based on quantum entanglement and the Euler theorem. In this protocol, all participants can safely compute multivariate polynomial functions with the help of a semitrusted third party. A performance analysis shows that the protocol is correct and can resist some common external and internal attacks. Additionally, the proposed protocol not only improves particle detection efficiency but also effectively reduces the communication complexity.