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

Communications in computer and information science

Two Anti-quantum Attack Protocols for Secure Multiparty Computation

Lichao Chen, Zhanli Li, Zhenhua Chen, Yaru Liu

Published Jan 1, 2019• 2 citations
Publisher
DOI
10.1007/978-981-13-5913-2_21

Related papers

LaTLS: A Lattice‐Based TLS Proxy Protocol

Xinglong ZHANG, Qingfeng Cheng, Yuting LI

The function of the Internet proxy is to check and convert the data exchanged between client and server. In fact, the two-party secure communication protocol with good security is turned into an unsafe multiparty protocol. At present, there are relatively few proxy protocols that can be applied in practice. This paper analyzes the classic agent protocol mcTLS and pointed out the security issues. We focus on the security of TLS 1.3 and proposed a lattice-based multi-party proxy protocol: LaTLS. LaTLS can be proved secure in the eCK model, it can resist key-sharing attacks, counterfeiting attacks, replay attacks, and achieve forward security. Compared with traditional DH and ECDH schemes, LaTLS is more effcient. Its security is based on the shortest vector problem, therefor it has anti-quantum attack properties.

Chinese Journal of Electronics•Mar 1, 2022•3 citations

Quantum secure protocols for multiparty computations

Tapaswini Mohanty, Vikas Srivastava, Sumit Kumar Debnath +1 more

arXiv:2312.16318•Journal of Information Security and Applications•Mar 20, 2025•1 citation

Cryptanalysis of secure multiparty quantum summation

Xiao‐Qiu Cai, Tian‐Yin Wang, Chun‐Yan Wei +1 more

Quantum Information Processing•Aug 13, 2022•16 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

Multiparty Secure Quantum and Semiquantum Computations

Tian-Yu Ye, Nanrun Zhou, Mingxing Luo +2 more

Frontiers research topics•Jan 1, 2023•0 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
The function of the Internet proxy is to check and convert the data exchanged between client and server. In fact, the two-party secure communication protocol with good security is turned into an unsafe multiparty protocol. At present, there are relatively few proxy protocols that can be applied in practice. This paper analyzes the classic agent protocol mcTLS and pointed out the security issues. We focus on the security of TLS 1.3 and proposed a lattice-based multi-party proxy protocol: LaTLS. LaTLS can be proved secure in the eCK model, it can resist key-sharing attacks, counterfeiting attacks, replay attacks, and achieve forward security. Compared with traditional DH and ECDH schemes, LaTLS is more effcient. Its security is based on the shortest vector problem, therefor it has anti-quantum attack properties.
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.
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.