Traditional digital signatures are based on mathematical hard problems that are vulnerable to quantum attacks. For privacy-sensitive applications such as electronic cash and electronic voting, partially blind signatures are preferable because they protect private messages while allowing signers to verify necessary public information. This paper proposes an identity-based quantum partially blind signature scheme based on quantum teleportation. Each signing session is assigned a unique identifier. The user blinds the private binary message by applying Pauli-X operations with a one-time random string, while public information remains visible to the signer. A trusted PKG performs identity authentication, signature authorization, session-key distribution, and time-period-based key lifecycle management. Quantum tags and quantum authentication codes provide verification and arbitration evidence, while quantum teleportation is used to transmit quantum information. In case of disputes, an arbitrator can verify independently stored quantum evidence, and channel monitoring enables the detection of eavesdropping and tampering. Security analysis shows that the proposed scheme satisfies partial blindness, unforgeability, and non-repudiation, and resists malicious third-party attacks. It is suitable for privacy-preserving and restricted-authorization applications such as electronic cash and electronic voting.
Traditional digital signatures are based on mathematical hard problems that are vulnerable to quantum attacks. For privacy-sensitive applications such as electronic cash and electronic voting, partially blind signatures are preferable because they protect private messages while allowing signers to verify necessary public information. This paper proposes an identity-based quantum partially blind signature scheme based on quantum teleportation. Each signing session is assigned a unique identifier. The user blinds the private binary message by applying Pauli-X operations with a one-time random string, while public information remains visible to the signer. A trusted PKG performs identity authentication, signature authorization, session-key distribution, and time-period-based key lifecycle management. Quantum tags and quantum authentication codes provide verification and arbitration evidence, while quantum teleportation is used to transmit quantum information. In case of disputes, an arbitrator can verify independently stored quantum evidence, and channel monitoring enables the detection of eavesdropping and tampering. Security analysis shows that the proposed scheme satisfies partial blindness, unforgeability, and non-repudiation, and resists malicious third-party attacks. It is suitable for privacy-preserving and restricted-authorization applications such as electronic cash and electronic voting.
Blind signatures have been widely applied when privacy preserving is required, and the delegation of blind signature rights and a proxy blind signature (Proxy-BS) become necessary when the signer cannot sign. Existing Proxy-BS schemes are based on traditional cryptographically hard problems, and they cannot resist quantum attacks. Moreover, most current Proxy-BS schemes depend on public key infrastructure (PKI), which leads to high certificate storage and management overhead. To simplify key management and resist quantum attacks, we propose a post-quantum secure identity-based proxy blind signature (ID-Proxy-BS) scheme on a lattice using a matrix cascade technique and lattice cryptosystem. Under the random oracle model (ROM), the security of the proposed scheme is proved. Security shows that the proposed scheme assures security against quantum attacks and satisfies the correctness, blindness, and unforgeability. In addition, we apply the ID-Proxy-BS scheme on a lattice to e-voting and propose a quantum-resistant proxy e-voting system, which is resistant to quantum attacks and achieves the efficiency of e-voting.
Abstract When the original signer is unable to sign and the proxy signer does not know the information content, proxy blind signature comes into being and becomes a hot topic in cryptography research. This paper combines the methods of proxy blind signature, controlled quantum teleportation and multi-party verification, and proposes a multi-party verifiable quantum proxy blind signature scheme based on controlled quantum teleportation. This scheme has the following features: using a Hash function shared by all participants for authentication can effectively solve the problem of identity identification among members; in order to facilitate the original signer to ensure the security of proxy authorization, the quantum proxy signature authorization form is used to generate quantum states with mutual unbiased fundamental particles. The security analysis shows that the scheme is unforgeable and undeniable, and can resist intercept-forgery attack and collusive attack.
Based on the Hadamard operator and Bell states, an identity-based public-key quantum signature scheme is proposed. In our scheme, the signer’s identity is used as her public key. Her private keys are generated by the trusted private key generator (PKG). Given a quantum signature, the verifier can verify the validity of the quantum signature by the signer’s identity information without any public-key certificate. So, our quantum signature has the advantages of the identity-based signature system. On the other hand, in our scheme, it need not use the long-term quantum memory. The verifier need not perform any quantum swap test or state comparison algorithm. What is more, our quantum signature is secure against PKG’s forgery attack. And the disputation of losing quantum signature can be arbitrated by PKG. Therefore, our scheme is relatively more practical and efficient than the similar schemes.
With the advancement of quantum cryptography, proxy blind signature technology combines the message concealment of blind signatures with the delegation of authority inherent in proxy signatures, thereby simultaneously ensuring message privacy and the controlled delegation of signing authority, and playing a critical role in numerous fields. This paper proposes a quantum proxy blind signature protocol based on quantum teleportation. This protocol has the following features: First, by simplifying the keys and the encryption process and using a pseudorandom number generator and quantum state permutations to perform encryption, we avoid complex unitary transformations, thereby significantly lowering the technical barrier. Second, by employing high-capacity quantum encoding — where a two-particle quantum state encodes three classical bits — the information capacity of a single communication session is significantly increased. Finally, we propose the “local operation, global signature” paradigm, in which the surrogate need only manipulate a single entangled particle to achieve a global signature through nonlocality, while the verifier recovers the message via a joint measurement. This approach conserves quantum resources and simplifies the verification process. The security analysis demonstrates that the proposed protocol can ensure blindness, satisfy the requirements of unforgeability and undeniability, and effectively resistance to interception-retransmission attacks.
With the development of wireless sensor networks, IoT devices are crucial for the Smart City; these devices change people's lives such as e-payment and e-voting systems. However, in these two systems, the state-of-art authentication protocols based on traditional number theory cannot defeat a quantum computer attack. In order to protect user privacy and guarantee trustworthy of big data, we propose a new identity-based blind signature scheme based on number theorem research unit lattice, this scheme mainly uses a rejection sampling theorem instead of constructing a trapdoor. Meanwhile, this scheme does not depend on complex public key infrastructure and can resist quantum computer attack. Then we design an e-payment protocol using the proposed scheme. Furthermore, we prove our scheme is secure in the random oracle, and satisfies confidentiality, integrity, and non-repudiation. Finally, we demonstrate that the proposed scheme outperforms the other traditional existing identity-based blind signature schemes in signing speed and verification speed, outperforms the other lattice-based blind signature in signing speed, verification speed, and signing secret key size.
In a quantum partially blind signature (QPBS) scheme, the contradiction between anonymity and controllability of completely blind signature (BS) schemes was better solved by adding common negotiated public information between the signer and the requester (the message holder). After reviewing the proposed scheme, we give an analysis about it and then propose a novel QPBS scheme without entanglement. The security without preconditions of this signature scheme is ensured by the secure quantum key distribution (QKD) protocol and quantum one-time pad (QOTP). Furthermore, in the process of security analysis, it proves that our scheme satisfies the foundational attribution of partially blind signature (PBS). Moreover, the scheme can solve the problem we put forward so as to allow it to have a wider application in the future.