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

Physica Scripta

A privacy preserving quantum aggregating technique with simulation

Kartick Sutradhar, Ranjitha Venkatesh

Published Apr 2, 2024• 3 citations
Publisher

Abstract

Abstract Quantum aggregation is a basic operation of secure multiparty quantum computation. All the existing techniques are based on the (n,n) threshold, where n is the total number of players. If any of them is corrupted then these techniques cannot execute correctly. However, the proposed technique is based on the (t,n) threshold. If the players are honest then this technique can perform the aggregation. This technique is based on the monotone span program, access structure, linear secret sharing, control-NOT gate, quantum Fourier transform, blind matrix, and Pauli operator. The proposed technique can aggregate the secrets securely and efficiently. We also simulate the proposed technique using IBM quantum computer to verify the correctness and feasibility.

DOI
10.1088/1402-4896/ad368e

Related papers

Secure multiparty quantum aggregating protocol

Kartick Sutradhar

Secure multiparty quantum computation is an important and essential paradigm of quantum computing. All the existing aggregating protocols are $(n, n)$ threshold approaches, where $n$ represents the total number of players. If one player is dishonest, the aggregation protocols cannot aggregate efficiently. In this paper, we propose a $(t, n)$ threshold-based aggregating protocol, where $t$ represents the threshold number of players. This protocol uses Shamir's secret sharing, quantum state, SUM gate, quantum Fourier transform, blind matrix, and Pauli operator. This protocol can perform the aggregation securely and efficiently. In this protocol, we simulate this aggregating protocol using the IBM quantum processor to verify the correctness and feasibility.

Quantum Information and Computation•Jan 29, 2023•3 citations

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

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

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

General quantum secure multiparty computation protocol for simultaneous summation and multiplication

Feixiang Li, Mei Luo, Shixin Zhu +1 more

Abstract Quantum secure multiparty computation occupies an important place in quantum cryptography. Based on access structure and linear secret sharing, we propose a new general quantum secure multiparty computation protocol for simultaneous summation and multiplication in a high-dimensional quantum system. In our protocol, each participant within any authorized sets only needs to perform local Pauli operation once on the generalized Bell state, then the summation and multiplication results can be output simultaneously, which improves the practicality of the protocol. Moreover, in the privacy computation phase, the decoy particle detection technique as well as the addition of random numbers are applied to blind the privacy information, making our protocol higher privacy protection. Security analysis shows that our protocol is resistant to a series of typical external attacks and dishonest internal participant attacks such as individual attack and collusion attack. Finally, compared with the existing protocols, our protocol not only has higher efficiency but also lower consumption.

Physica Scripta•Dec 5, 2023•8 citations

Efficient Simulation of Quantum Secure Multiparty Computation

Kartick Sutradhar

One of the key characteristics of secure quantum communication is quantum secure multiparty computation. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol that can be applied to many complex quantum operations. It is based on the $(t, n)$ threshold approach. We combine the classical and quantum phenomena to make this protocol realistic and secure. Because the current protocols employ the $(n, n)$ threshold approach, which requires all honest players to execute the quantum multiparty summation protocol, they have certain security and efficiency problems. However, we employ a $(t, n)$ threshold approach, which requires the quantum summation protocol to be computed only by $t$ honest players. Our suggested protocol is more economical, practical, and secure than alternative protocols.

arXiv:2501.10083•Jan 17, 2025•0 citations
Abstract Quantum aggregation is a basic operation of secure multiparty quantum computation. All the existing techniques are based on the (n,n) threshold, where n is the total number of players. If any of them is corrupted then these techniques cannot execute correctly. However, the proposed technique is based on the (t,n) threshold. If the players are honest then this technique can perform the aggregation. This technique is based on the monotone span program, access structure, linear secret sharing, control-NOT gate, quantum Fourier transform, blind matrix, and Pauli operator. The proposed technique can aggregate the secrets securely and efficiently. We also simulate the proposed technique using IBM quantum computer to verify the correctness and feasibility.
Secure multiparty quantum computation is an important and essential paradigm of quantum computing. All the existing aggregating protocols are (n,n)(n, n)(n,n) threshold approaches, where nnn represents the total number of players. If one player is dishonest, the aggregation protocols cannot aggregate efficiently. In this paper, we propose a (t,n)(t, n)(t,n) threshold-based aggregating protocol, where ttt represents the threshold number of players. This protocol uses Shamir's secret sharing, quantum state, SUM gate, quantum Fourier transform, blind matrix, and Pauli operator. This protocol can perform the aggregation securely and efficiently. In this protocol, we simulate this aggregating protocol using the IBM quantum processor to verify the correctness and feasibility.
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 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.
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.
Abstract Quantum secure multiparty computation occupies an important place in quantum cryptography. Based on access structure and linear secret sharing, we propose a new general quantum secure multiparty computation protocol for simultaneous summation and multiplication in a high-dimensional quantum system. In our protocol, each participant within any authorized sets only needs to perform local Pauli operation once on the generalized Bell state, then the summation and multiplication results can be output simultaneously, which improves the practicality of the protocol. Moreover, in the privacy computation phase, the decoy particle detection technique as well as the addition of random numbers are applied to blind the privacy information, making our protocol higher privacy protection. Security analysis shows that our protocol is resistant to a series of typical external attacks and dishonest internal participant attacks such as individual attack and collusion attack. Finally, compared with the existing protocols, our protocol not only has higher efficiency but also lower consumption.
One of the key characteristics of secure quantum communication is quantum secure multiparty computation. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol that can be applied to many complex quantum operations. It is based on the (t,n)(t, n)(t,n) threshold approach. We combine the classical and quantum phenomena to make this protocol realistic and secure. Because the current protocols employ the (n,n)(n, n)(n,n) threshold approach, which requires all honest players to execute the quantum multiparty summation protocol, they have certain security and efficiency problems. However, we employ a (t,n)(t, n)(t,n) threshold approach, which requires the quantum summation protocol to be computed only by ttt honest players. Our suggested protocol is more economical, practical, and secure than alternative protocols.