scholarly journals Message recovery for signature schemes based on the discrete logarithm problem

1995 ◽  
pp. 182-193 ◽  
Author(s):  
Kaisa Nyberg ◽  
Rainer A. Rueppel
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Signature Schemes ◽  
Message Recovery

scholarly journals Generalized Key Substitution Attacks on Message Recovery Signatures

2017 ◽  
Vol 70 (1) ◽  
pp. 119-138
Author(s):  
Atsushi Fujioka
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Signature Schemes ◽  
Message Recovery

Abstract The generalized key substitution attacks were proposed as a generalization of the key substitution attacks to examine the security of the signature schemes adopted in ISO/IEC (1st CD) 14888-3, which standardizes appendix- -type signature schemes based on the discrete logarithm problem. This paper examines the message recovery signature schemes based on the discrete logarithm problem, adopted in ISO/IEC 9796-3:2006, and shows that all but one scheme are vulnerable to the generalized key substitution attacks.

Efficient Convertible User Designating Confirmer Partially Blind Signature with Provable Security

2011 ◽  
Vol 282-283 ◽  
pp. 307-311
Author(s):  
Li Zhen Ma
Keyword(s):  
Provable Security ◽  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Schemes ◽  
Partially Blind Signature ◽  
Provably Secure

Any one who knows the signer’s public key can verify the validity of a given signature in partially blind signature schemes. This verifying universality may be used by cheats if the signed message is sensitive or personal. To solve this problem, a new convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm the validity of given signatures and convert given signatures into publicly verifiable ones, is proposed. Compared with Huang et al.’s scheme, the signature size is shortened about 25% and the computation quantity is reduced about 36% in the proposed scheme. Under random oracle model and intractability of Discrete Logarithm Problem the proposed scheme is provably secure.

Blind Signature Based on Discrete Logarithm Type Cryptosystem

2011 ◽  
Vol 204-210 ◽  
pp. 1318-1321
Author(s):  
Xuan Wu Zhou ◽  
Yan Fu
Keyword(s):  
Elliptic Curves ◽  
Discrete Logarithm ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Security Level ◽  
Signature Schemes ◽  
Public Key Cryptosystems ◽  
Trapdoor Function ◽  
Asymmetric Cryptosystem

Discrete logarithm problem is an important trapdoor function to design asymmetric cryptosystem, and some fast public key cryptosystems have been designed based on it. In the paper, we introduced fast asymmetric cryptosystem into the designing and analyzing of blind signature, and presented improved blind signature schemes based on ECC (Elliptic Curves Cryptosystem). The trapdoor function of the blind signatures is based on ECDLP (Elliptic Curves Discrete Logarithm Problem), and the algorithms of the scheme make full use of the superiority of ECC, such as high efficiency and short key length. The improved blind signature schemes can achieve the same security level with less storing space, smaller communication band-width and less overheads regarding software and hardware application. Furthermore, the algorithms in the schemes can be generalized into other public key cryptosystems based on discrete logarithm problem without any influence to efficiency or security.

Improvement of a Structured Multi-Signature Scheme

2010 ◽  
Vol 439-440 ◽  
pp. 401-406
Author(s):  
Jun Zhang
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Scheme ◽  
Forgery Attack ◽  
Signature Schemes ◽  
Insider Attack ◽  
Public Keys

Structured multi-signatures is a special multi-signature which multiple signer can sign the same message and it provided co-signers with different position have different authorization capability. There are lots of structured multi-signature schemes such as Harn’s scheme and Burmester’s scheme, etc. Though Harn’s scheme was relatively safer, yet this scheme was not safety enough because it was very easily aggressed by the forgery attack. This paper shows the scheme can not resist the forgery attack. Then the paper proposed a new structure multi-signature scheme based on the difficulty of the discrete logarithm problem with verifying signature parameter and signers’ public keys. By verifying public-key, the new scheme can resist lots of outsider attack and insider attack. The validity of the new scheme can be verified, and it is a secure structured multi-signature scheme.

Sign in / Sign up

Export Citation Format

Share Document