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

IEEE Transactions on Computers

Quantum Secret Permutating Protocol

Runhua Shi, Yi-Fei Li

Published Sep 15, 2022• 21 citations
Publisher

Abstract

In modern cryptography, distributing a private and unique index number to each participant is an important cryptographic task, which can be adopted to efficiently solve many complicated secure multiparty computations. In this paper, we define this cryptographic primitive, called Secret Permutating, in which every one of$n$participants can get a random but unique secret${k}_i \in \{ {1,2, \ldots,n} \}$. Furthermore, we focus on the unconditional security of Secret Permutating based on laws of quantum mechanics. Accordingly, by local Pauli operators and entanglement swapping of Bell states, we design novel quantum Secret Permutating protocols. What's more, to reduce the communicational complexity, we exploit the uniform, random and independent properties of quantum measurements to evenly divide all participants into many secret groups with the small approximate sizes. Finally, the analysis results and simulated experiments show that the proposed protocols have the unconditional security and the good feasibility.

DOI
10.1109/tc.2022.3207121

Related papers

A flexible framework for (n,n) quantum secret sharing

Kuo-Chun Tseng, Wei-Lin Lee, Chi‐Yuan Chen +1 more

With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.

Modern Physics Letters A•Jul 4, 2025•1 citation

Multiparty Quantum Secret Sharing Protocol with Authentication

Xiaofen Liu, Xuanhui Yan, Zhiqiang Yao

Utilizing the advantage of Bell state,a multiparty quantum secret sharing protocol with authentication is put forward.In the protocol,the deal encodes two classical bits of secret message on the quantum carrier though performing local unitary operation.He splits the secret message into n shares and then distributes them to n agents via entanglement swapping.Each agent makes a Bell state measurement on the particles in his hand,and obtains his piece of secret according to the measurement result.In the process of reconstruction,these n agents declare respectively their pieces of secret,and recover the secret message if and only if they collaborate.At the same time,combining the technology of Hash function,the identities of the deal and the agents are authenticated.Hence,one main goal of designing the presented protocol,two-way authentication,is achieved.Moreover,we analyze the security and authentication of the presented protocol in detail.It is shown that this protocol can stand against the attacks of outside eavesdropper and inside participant,which means that it is secure in theory.In addition,since the Bell state was used at most,as compared with other quantum secret sharing protocols,the implementation of the presented protocol is more feasible in the current technical conditions.

Journal of Chinese Computer Systems•Jan 1, 2012•1 citation

Secure Multi-Party Shuffling.

Mahnush Movahedi, Jared Saia, Mahdi Zamani

Abstract. In secure multi-party shuffling, multiple parties, each holding an input, want to agree on a random permutation of their inputs while keeping the permutation secret. This problem is important as a primitive in many privacy-preserving applications such as anonymous communication, location-based services, and electronic voting. Known techniques for solving this problem suffer from poor scalability, load-balancing issues, trusted party assumptions, and/or weak security guarantees. In this paper, we propose an unconditionally-secure protocol for multi-party shuffling that scales well with the number of parties and is load-balanced. In particular, we require each party to send only a polylogarithmic number of bits and perform a polylogarithmic number of operations while incurring only a logarithmic round complexity. We show security under universal composability against up to about n/3 fully-malicious parties. We also provide simulation results showing that our protocol im-proves significantly over previous work. For example, for one million parties, when compared to the state of the art, our protocol reduces the communication and computation costs by at least three orders of magnitude and slightly decreases the number of communication rounds. 1

•Jan 1, 2015•1 citation

Unconditional security of entanglement-based continuous-variable quantum secret sharing

Ioannis Kogias, Yu Xiang, Qiongyi He +1 more

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.

arXiv:1603.03224•Physical Review A•Jan 12, 2017•200 citations

An efficient multiparty quantum secret sharing scheme using a single qudit

WenWen Hu, Bangshu Xiong, Ri‐Gui Zhou

The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.

Chinese Physics B•Nov 17, 2022•7 citations

Cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled state

Shuang Li, Xiao‐Qiu Cai, Shaorui Song +2 more

Quantum secret sharing is a basic quantum cryptographic primitive, which plays an important role in robust key management and secure multiparty computation etc. In this work, we give a cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled states proposed recently, which shows that the controller can recover the secret if he cooperates with any one participant. Furthermore, an external opponent can make participants recover a false secret without being detected by a special denial-of-service attack. Therefore, this protocol does not satisfy the security requirement that any unauthorized set can gain access to no information on the secret and cannot guarantee its correctness.

Scientific Reports•Apr 29, 2025•2 citations
In modern cryptography, distributing a private and unique index number to each participant is an important cryptographic task, which can be adopted to efficiently solve many complicated secure multiparty computations. In this paper, we define this cryptographic primitive, called Secret Permutating, in which every one ofnnnparticipants can get a random but unique secretki∈{1,2,…,n}{k}_i \in \{ {1,2, \ldots,n} \}ki​∈{1,2,…,n}. Furthermore, we focus on the unconditional security of Secret Permutating based on laws of quantum mechanics. Accordingly, by local Pauli operators and entanglement swapping of Bell states, we design novel quantum Secret Permutating protocols. What's more, to reduce the communicational complexity, we exploit the uniform, random and independent properties of quantum measurements to evenly divide all participants into many secret groups with the small approximate sizes. Finally, the analysis results and simulated experiments show that the proposed protocols have the unconditional security and the good feasibility.
With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.
Utilizing the advantage of Bell state,a multiparty quantum secret sharing protocol with authentication is put forward.In the protocol,the deal encodes two classical bits of secret message on the quantum carrier though performing local unitary operation.He splits the secret message into n shares and then distributes them to n agents via entanglement swapping.Each agent makes a Bell state measurement on the particles in his hand,and obtains his piece of secret according to the measurement result.In the process of reconstruction,these n agents declare respectively their pieces of secret,and recover the secret message if and only if they collaborate.At the same time,combining the technology of Hash function,the identities of the deal and the agents are authenticated.Hence,one main goal of designing the presented protocol,two-way authentication,is achieved.Moreover,we analyze the security and authentication of the presented protocol in detail.It is shown that this protocol can stand against the attacks of outside eavesdropper and inside participant,which means that it is secure in theory.In addition,since the Bell state was used at most,as compared with other quantum secret sharing protocols,the implementation of the presented protocol is more feasible in the current technical conditions.
Abstract. In secure multi-party shuffling, multiple parties, each holding an input, want to agree on a random permutation of their inputs while keeping the permutation secret. This problem is important as a primitive in many privacy-preserving applications such as anonymous communication, location-based services, and electronic voting. Known techniques for solving this problem suffer from poor scalability, load-balancing issues, trusted party assumptions, and/or weak security guarantees. In this paper, we propose an unconditionally-secure protocol for multi-party shuffling that scales well with the number of parties and is load-balanced. In particular, we require each party to send only a polylogarithmic number of bits and perform a polylogarithmic number of operations while incurring only a logarithmic round complexity. We show security under universal composability against up to about n/3 fully-malicious parties. We also provide simulation results showing that our protocol im-proves significantly over previous work. For example, for one million parties, when compared to the state of the art, our protocol reduces the communication and computation costs by at least three orders of magnitude and slightly decreases the number of communication rounds. 1
The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.
The aim of quantum secret sharing, as one of most promising components of quantum cryptograph, is one-to-multiparty secret communication based on the principles of quantum mechanics. In this paper, an efficient multiparty quantum secret sharing protocol in a high-dimensional quantum system using a single qudit is proposed. Each participant's shadow is encoded on a single qudit via a measuring basis encryption method, which avoids the waste of qudits caused by basis reconciliation. Security analysis indicates that the proposed protocol is immune to general attacks, such as the measure-resend attack, entangle-and-measure attack and Trojan horse attack. Compared to former protocols, the proposed protocol only needs to perform the single-qudit measurement operation, and can share the predetermined dits instead of random bits or dits.
Quantum secret sharing is a basic quantum cryptographic primitive, which plays an important role in robust key management and secure multiparty computation etc. In this work, we give a cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled states proposed recently, which shows that the controller can recover the secret if he cooperates with any one participant. Furthermore, an external opponent can make participants recover a false secret without being detected by a special denial-of-service attack. Therefore, this protocol does not satisfy the security requirement that any unauthorized set can gain access to no information on the secret and cannot guarantee its correctness.