Quantum signature for designated verifier with strong security

A digital signature with designated verifier (SWDV) makes that only the designated verifier can verify its validity. It can be used to protect the privacy and economic interest of the signer. So, the SWDV schemes have many applications in e-voting, auction and some other fields. To make the SWDV secure against the quantum forger, a quantum signature with designated verifier signature (QSWDV) scheme is proposed. Our QSWDV is robust due to its strong security against forgery attack, inter-resending attacks, impersonation attacks and Trojan horse attacks. Its properties such as non-transferability and hiding source can be guaranteed by the signature simulation of the designated verifier. What is more, our scheme can be proved to be information-theoretically secure, which can guarantee the secrecy of the signer’s private key and the unforgeability of the QSWDV. In the proposed QSWDV scheme, the partners neither need use quantum one-way function nor need perform quantum state comparisons, which can reduce the complexity and improve the efficiency the QSWDV scheme.

Download Full-text

Post-quantum digital signature schemes: setting a hidden group with two-dimensional cyclicity

Informatization and communication ◽

10.34219/2078-8320-2020-11-4-75-82 ◽

2020 ◽

Vol 4 ◽

pp. 75-82

Author(s):

D.Yu. Guryanov ◽

◽

D.N. Moldovyan ◽

A. A. Moldovyan ◽

Keyword(s):

Associative Algebra ◽

Digital Signature ◽

Quantum Signature ◽

Commutative Group ◽

Two Dimensional ◽

Signature Scheme ◽

Signature Schemes ◽

Fixed Element ◽

Commutative Associative Algebra ◽

Quantum Digital Signature

For the construction of post-quantum digital signature schemes that satisfy the strengthened criterion of resistance to quantum attacks, an algebraic carrier is proposed that allows one to define a hidden commutative group with two-dimensional cyclicity. Formulas are obtained that describe the set of elements that are permutable with a given fixed element. A post-quantum signature scheme based on the considered finite non-commutative associative algebra is described.

Download Full-text

Publicly auditable conditional blind signatures

Journal of Computer Security ◽

10.3233/jcs-181270 ◽

2021 ◽

Vol 29 (2) ◽

pp. 229-271

Author(s):

Panagiotis Grontas ◽

Aris Pagourtzis ◽

Alexandros Zacharakis ◽

Bingsheng Zhang

Keyword(s):

Proof Of Concept ◽

Equivalence Test ◽

Zero Knowledge ◽

Private Key ◽

Blind Signatures ◽

Cryptographic Primitive ◽

Security Properties ◽

Designated Verifier

This work formalizes Publicly Auditable Conditional Blind Signatures (PACBS), a new cryptographic primitive that allows the verifiable issuance of blind signatures, the validity of which is contingent upon a predicate and decided by a designated verifier. In particular, when a user requests the signing of a message, blinded to protect her privacy, the signer embeds data in the signature that makes it valid if and only if a condition holds. A verifier, identified by a private key, can check the signature and learn the value of the predicate. Auditability mechanisms in the form of non-interactive zero-knowledge proofs are provided, so that a cheating signer cannot issue arbitrary signatures and a cheating verifier cannot ignore the embedded condition. The security properties of this new primitive are defined using cryptographic games. A proof-of-concept construction, based on the Okamoto–Schnorr blind signatures infused with a plaintext equivalence test is presented and its security is analyzed.

Download Full-text

Security Analysis of an Arbitrated Quantum Signature Scheme with Bell States

International Journal of Theoretical Physics ◽

10.1007/s10773-016-3041-8 ◽

2016 ◽

Vol 55 (9) ◽

pp. 4142-4156 ◽

Cited By ~ 2

Author(s):

Guoliang Xu ◽

Xiangfu Zou

Keyword(s):

Security Analysis ◽

Quantum Signature ◽

Bell States ◽

Signature Scheme ◽

Arbitrated Quantum Signature

Download Full-text

QUANTUM PROXY GROUP SIGNATURE SCHEME WITH χ-TYPE ENTANGLED STATES

International Journal of Quantum Information ◽

10.1142/s0219749912500414 ◽

2012 ◽

Vol 10 (04) ◽

pp. 1250041 ◽

Cited By ~ 12

Author(s):

XUN-RU YIN ◽

WEN-PING MA ◽

WEI-YAN LIU

Keyword(s):

Initial Phase ◽

Proxy Signature ◽

Quantum Signature ◽

Unconditional Security ◽

Group Signature ◽

Entangled States ◽

Utilization Rate ◽

Signature Scheme ◽

State Sequence ◽

General Quantum

A quantum proxy group signature scheme is proposed with χ-type entangled states. Our scheme combines the properties of group signature and proxy signature. Moreover, the particles in the χ-type state sequence are used to distribute proxy warrants and quantum keys in the initial phase, and then used for quantum signature. Therefore it increases the utilization rate of quantum resources compared with the general quantum signature scheme. Finally, the unconditional security of our scheme is also analyzed.

Download Full-text

Delegatability of designated verifier signature

2008 IEEE Conference on Cybernetics and Intelligent Systems ◽

10.1109/iccis.2008.4670894 ◽

2008 ◽

Author(s):

Yongjian Liao ◽

Zhiguang Qin

Keyword(s):

Designated Verifier ◽

Designated Verifier Signature

Download Full-text

Arbitrated Quantum Signature of Quantum Messages with a Semi-honest Arbitrator

International Journal of Theoretical Physics ◽

10.1007/s10773-017-3660-8 ◽

2018 ◽

Vol 57 (5) ◽

pp. 1310-1318 ◽

Cited By ~ 4

Author(s):

Zhang MeiLing ◽

Liu YuanHua ◽

Nie Min ◽

Zheng QingJi ◽

Zheng Dong

Keyword(s):

Quantum Signature ◽

Arbitrated Quantum Signature

Download Full-text

Code-based authentication with designated verifier

International Journal of Grid and Utility Computing ◽

10.1504/ijguc.2016.073779 ◽

2016 ◽

Vol 7 (1) ◽

pp. 61 ◽

Cited By ~ 4

Author(s):

Yan Ren ◽

Hongbin Wang ◽

Jiali Du ◽

Liqiong Ma

Keyword(s):

Designated Verifier

Download Full-text

Time-constrained strong multi-designated verifier signature suitable for Internet of things–based collaborative fog computing systems

International Journal of Distributed Sensor Networks ◽

10.1177/15501477211001760 ◽

2021 ◽

Vol 17 (3) ◽

pp. 155014772110017

Author(s):

Han-Yu Lin

Keyword(s):

Internet Of Things ◽

Fog Computing ◽

Discrete Logarithm ◽

Signature Scheme ◽

Computing Systems ◽

Extended Technique ◽

Diffie Hellman ◽

Designated Verifier ◽

Designated Verifier Signature ◽

Cloud Servers

Fog computing is viewed as an extended technique of cloud computing. In Internet of things–based collaborative fog computing systems, a fog node aggregating lots of data from Internet of things devices has to transmit the information to distributed cloud servers that will collaboratively verify it based on some predefined auditing policy. However, compromised fog nodes controlled by an adversary might inject bogus data to cheat or confuse remote servers. It also causes the waste of communication and computation resources. To further control the lifetime of signing capability for fog nodes, an appropriate mechanism is crucial. In this article, the author proposes a time-constrained strong multi-designated verifier signature scheme to meet the above requirement. In particular, a conventional non-delegatable strong multi-designated verifier signature scheme with low computation is first given. Based on its constructions, we show how to transform it into a time-constrained variant. The unforgeability of the proposed schemes is formally proved based on the famous elliptic curve discrete logarithm assumption. The security requirement of strong signer ambiguity for our substantial constructions is also analyzed by utilizing the intractable assumption of decisional Diffie–Hellman. Moreover, some comparisons in terms of the signature size and computational costs for involved entities among related mechanisms are made.

Download Full-text