scholarly journals Quantum signature for designated verifier with strong security

2020 ◽  
Vol 69 (19) ◽  
pp. 190302
Author(s):  
Min-Xi Rong ◽  
Xiang-Jun Xin ◽  
Fa-Gen Li
Keyword(s):  
Quantum Signature ◽  
Designated Verifier

A scheme on converting quantum signature with public verifiability into quantum designated verifier signature

Optik ◽  
2018 ◽  
Vol 164 ◽  
pp. 753-759 ◽  
Author(s):  
Wei-Min Shi ◽  
Yan-Mei Wang ◽  
Yi-Hua Zhou ◽  
Yu-Guang Yang ◽  
Jan-Biao Zhang
Keyword(s):  
Quantum Signature ◽  
Public Verifiability ◽  
Designated Verifier ◽  
Designated Verifier Signature

Secure and efficient quantum designated verifier signature scheme

2020 ◽  
Vol 35 (18) ◽  
pp. 2050148
Author(s):  
Yue Zhang ◽  
Xiangjun Xin ◽  
Fagen Li
Keyword(s):  
Quantum State ◽  
Digital Signature ◽  
Quantum Signature ◽  
Economic Interest ◽  
Signature Scheme ◽  
Forgery Attack ◽  
Private Key ◽  
Designated Verifier ◽  
Designated Verifier Signature ◽  
One Way Function

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.

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

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.

Publicly auditable conditional blind signatures

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.

QUANTUM PROXY GROUP SIGNATURE SCHEME WITH χ-TYPE ENTANGLED STATES

2012 ◽  
Vol 10 (04) ◽  
pp. 1250041 ◽  
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.

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

2018 ◽  
Vol 57 (5) ◽  
pp. 1310-1318 ◽  
Author(s):  
Zhang MeiLing ◽  
Liu YuanHua ◽  
Nie Min ◽  
Zheng QingJi ◽  
Zheng Dong
Keyword(s):  
Quantum Signature ◽  
Arbitrated Quantum Signature

Code-based authentication with designated verifier

2016 ◽  
Vol 7 (1) ◽  
pp. 61 ◽  
Author(s):  
Yan Ren ◽  
Hongbin Wang ◽  
Jiali Du ◽  
Liqiong Ma
Keyword(s):  
Designated Verifier

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

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.

Sign in / Sign up

Export Citation Format

Share Document