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 Journal of Theoretical Physics

Blind Quantum Signature with Blind Quantum Computation

Wei Li, Ronghua Shi, Ying Guo

Published Dec 27, 2016• 12 citations
Publisher
DOI
10.1007/s10773-016-3252-z

Related papers

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

Ronghua Shi, Wanting Ding, Jinjing Shi

International Journal of Theoretical Physics•Mar 22, 2018•12 citations

Universal Blind Quantum Computation

Joseph F. Fitzsimons, Elham Kashefi

Bulletin of the American Physical Society•Feb 29, 2012•1 citation

Quantum group blind signature scheme based on measurement-based quantum computation

Haoyang Yu, Yunxiao Qian

Digital signatures are widely used in electronic communications, for example in electronic commerce and e-mail. But classical digital signature scheme only offer security relying on computational assumptions. In contrast, quantum digital signatures provide security based on fundamental principles of quantum physics. Quantum group signatures provide anonymity for signatory, quantum blind signatures provide confidentiality for signed messages. In this paper we demonstrate a quantum group blind signature scheme which have the properties both of group signatures and blind signatures. Besides, the security of our scheme is guaranteed by the quantum mechanics, so without any computational assumption. the group property and blind property of our scheme profits from the properties of the measurement-based quantum computation (MBQC). Our quantum group blind signature scheme can be widely used in e-voting system, e-cash, e-commerce, etc.

International Conference on Computer Network Security and Software Engineering (CNSSE)•Oct 3, 2022•1 citation

Efficient quantum blind signature for quantum networks

Qian Niu, Yu Wang, Jian Li +1 more

Quantum Information Processing•Jan 13, 2026•0 citations

Blind signature protocols based on hidden discrete logarithm problem

Dmitriy Nikolaevich Moldovyan, Alexander Andreevich Moldovyan, D.Yu. Guryanov

Introduction: The progress in the development of quantum computing has raised the problem of constructing post-quantum two-key cryptographic algorithms and protocols, i.e. crypto schemes resistant to attacks from quantum computers. Based on the hidden discrete logarithm problem, some practical post-quantum digital signature schemes have been developed. The next step could be the development of post-quantum blind signature protocols. Purpose: To develop blind signature protocols based on the computational difficulty of the hidden discrete logarithm problem. Method: The use of blinding factors introduced by the client during the blind signature protocol when the parameters necessary for the blind signature formation are passed to the signatory. Results: It has been proposed to use blinding multipliers of two different types: left-sided and right-sided ones. With them, you can develop blind signature protocols on the base of schemes with a verification equation defined in non-commutative algebraic structures. New blind signature protocols have been developed, based on the computational difficulty of the hidden discrete logarithm problem. As the algebraic carrier for the developed protocols, finite non-commutative associative algebras of two types are used: 1) those with a global two-sided unit, and 2) those with a large set of global left units. Practical relevance: The proposed protocols have a high performance and can be successfully implemented either in software or in hardware.

Информационно-управляющие системы•Jun 15, 2020•0 citations

Arbitrable blind quantum computation

Go Sato, Takeshi Koshiba, Tomoyuki Morimae

arXiv:1709.10420•Quantum Information Processing•Oct 30, 2019•10 citations
Digital signatures are widely used in electronic communications, for example in electronic commerce and e-mail. But classical digital signature scheme only offer security relying on computational assumptions. In contrast, quantum digital signatures provide security based on fundamental principles of quantum physics. Quantum group signatures provide anonymity for signatory, quantum blind signatures provide confidentiality for signed messages. In this paper we demonstrate a quantum group blind signature scheme which have the properties both of group signatures and blind signatures. Besides, the security of our scheme is guaranteed by the quantum mechanics, so without any computational assumption. the group property and blind property of our scheme profits from the properties of the measurement-based quantum computation (MBQC). Our quantum group blind signature scheme can be widely used in e-voting system, e-cash, e-commerce, etc.
Introduction: The progress in the development of quantum computing has raised the problem of constructing post-quantum two-key cryptographic algorithms and protocols, i.e. crypto schemes resistant to attacks from quantum computers. Based on the hidden discrete logarithm problem, some practical post-quantum digital signature schemes have been developed. The next step could be the development of post-quantum blind signature protocols. Purpose: To develop blind signature protocols based on the computational difficulty of the hidden discrete logarithm problem. Method: The use of blinding factors introduced by the client during the blind signature protocol when the parameters necessary for the blind signature formation are passed to the signatory. Results: It has been proposed to use blinding multipliers of two different types: left-sided and right-sided ones. With them, you can develop blind signature protocols on the base of schemes with a verification equation defined in non-commutative algebraic structures. New blind signature protocols have been developed, based on the computational difficulty of the hidden discrete logarithm problem. As the algebraic carrier for the developed protocols, finite non-commutative associative algebras of two types are used: 1) those with a global two-sided unit, and 2) those with a large set of global left units. Practical relevance: The proposed protocols have a high performance and can be successfully implemented either in software or in hardware.