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

Quantum Information Processing

A dynamic group multi-party signature scheme based on extended quantum teleportation

Xin-Yu Li, Dong‐Huan Jiang, Hua-Kun Wang, Yu‐Guang Yang, Guang‐Bao Xu

Published Jul 28, 2026• 0 citations
Publisher
DOI
10.1007/s11128-026-05290-2

Related papers

Improved Group Signature Scheme Based on Quantum Teleportation

Qi Su, Wenmin Li

International Journal of Theoretical Physics•Nov 20, 2013•20 citations

Multi-party quantum homomorphic encryption scheme based on quantum teleportation

Zhenzhen Li, Zhao Zhang, Yajing Li +2 more

Journal of Information Security and Applications•Jul 16, 2025•4 citations

Multi-Party Verifiable Arbitrated Quantum Signature Scheme with Information Hiding Function

Dianjun Lu, Dongqin Wen, Suonan Renqian +2 more

•Jan 1, 2025•0 citations

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

SHANG Tao, HOU PengLin, LIU YuChen +2 more

The quantum group signature is a variant of the arbitrated quantum signature with special properties. Most existing teleportation-based quantum group signature schemes do not possess threshold properties, and extending them to quantum threshold group signatures is difficult. Therefore, to realize the extension from ordinary quantum signature to quantum (t, n) threshold group signature and solve the problem of low efficiency of quantum signature based on joint Bell state measurement, this paper proposes a quantum (t, n) threshold group signature scheme based on generalized teleportation implemented by multi-coin quantum walk. In the proposed scheme, n signers form a group, and only t signers can generate a valid signature on behalf of the group using the quantum walking system. In addition, a verifier checks the validity of the signature through the quantum one-time pad and quantum comparison algorithm using a trusted arbiter. The security analysis shows that the proposed scheme meets the requirements of unforgeability, nonrepudiation, threshold security, signer identity traceability, and signer anonymity. In terms of efficiency, the proposed scheme uses teleportation based on multi-coin quantum walk to transmit the quantum message without the need to prepare entangled quantum states in advance. It then replaces the joint Bell measurement of quantum teleportation with a more efficient projection measurement. Moreover, the proposed scheme uses random numbers and public boards, which can avoid the repudiation of signatures and guarantee their integrity.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Nov 7, 2023•2 citations

A multi-party verifiable quantum proxy signature scheme based on quantum teleportation

Chengxiang Wang, Dianjun Lu, Fuyao Tian +1 more

With the development of science and technology and the appearance of various special conditions that cause signers to be unable to sign, proxy signature is gradually becoming a hot spot in cryptography research. This paper combines proxy signature, quantum teleportation, and multi-party verification and proposes a multi-party verifiable quantum proxy signature scheme based on quantum teleportation. This scheme has the following characteristics: The authentication method based on the Hash function can effectively solve the problem of identity identification among members; in order for the proxy signer to be able to verify the correctness of the proxy authorization, a form of proxy signature authorization that concatenates the identity information of the original signer is used. The security analysis shows that our scheme is unforgeable and undeniable and can resist intercept-resend attacks and cheating attacks.

Journal of Applied Physics•Apr 2, 2024•14 citations

Security analysis of quantum multi-signature protocol based on teleportation

Hui-Juan Zuo, Kejia Zhang, Tingting Song

Quantum Information Processing•Jan 28, 2013•24 citations
The quantum group signature is a variant of the arbitrated quantum signature with special properties. Most existing teleportation-based quantum group signature schemes do not possess threshold properties, and extending them to quantum threshold group signatures is difficult. Therefore, to realize the extension from ordinary quantum signature to quantum (t, n) threshold group signature and solve the problem of low efficiency of quantum signature based on joint Bell state measurement, this paper proposes a quantum (t, n) threshold group signature scheme based on generalized teleportation implemented by multi-coin quantum walk. In the proposed scheme, n signers form a group, and only t signers can generate a valid signature on behalf of the group using the quantum walking system. In addition, a verifier checks the validity of the signature through the quantum one-time pad and quantum comparison algorithm using a trusted arbiter. The security analysis shows that the proposed scheme meets the requirements of unforgeability, nonrepudiation, threshold security, signer identity traceability, and signer anonymity. In terms of efficiency, the proposed scheme uses teleportation based on multi-coin quantum walk to transmit the quantum message without the need to prepare entangled quantum states in advance. It then replaces the joint Bell measurement of quantum teleportation with a more efficient projection measurement. Moreover, the proposed scheme uses random numbers and public boards, which can avoid the repudiation of signatures and guarantee their integrity.
With the development of science and technology and the appearance of various special conditions that cause signers to be unable to sign, proxy signature is gradually becoming a hot spot in cryptography research. This paper combines proxy signature, quantum teleportation, and multi-party verification and proposes a multi-party verifiable quantum proxy signature scheme based on quantum teleportation. This scheme has the following characteristics: The authentication method based on the Hash function can effectively solve the problem of identity identification among members; in order for the proxy signer to be able to verify the correctness of the proxy authorization, a form of proxy signature authorization that concatenates the identity information of the original signer is used. The security analysis shows that our scheme is unforgeable and undeniable and can resist intercept-resend attacks and cheating attacks.