Abstract:
Abstract. Delegation of rights is a common practice in the real world. Proxy signature schemes have been invented to delegate signing capability efficiently and transparently. In this paper, we present a new nonrepudiable proxy signature scheme. Nonrepudiation means the signature signers, both original and proxy signers, cannot falsely deny later that he generated a signature. In practice, it is important and, sometimes, necessary to have the ability to know who is the actual signer of a proxy signature for internal auditing purpose or when there is abusing of signing capability. The new nonrepudiable proxy signature scheme also has other desirable properties, such as proxy signature key generation and updating using insecure channels. We also show how to construct threshold proxy signature schemes with an example. Threshold signatures are motivated both by the need that arises in some organizations to have a group of employees agree on a given message (or a document) before signing it, as well as by the need to protect signature keys from the attack of internal and external adversaries. Our approach can also be applied to other ElGamal-like proxy signature schemes. 1
Citations
|
1001
|
How to Share a Secret
– Shamir
- 1979
|
|
247
|
Safeguarding cryptographic keys
– Blakley
|
|
196
|
Threshold cryptosystem
– Desmedt, Frankel
- 1989
|
|
82
|
Society and group oriented cryptography
– Desmedt
- 1987
|
|
59
|
Proxy signatures for delegating signing operation
– Mambo, Usuda, et al.
- 1996
|
|
51
|
Distributed provers with applications to undeniable signatures
– Pedersen
- 1991
|
|
48
|
A new signature scheme based on the DSA giving message recovery
– Nyberg, Rueppel
- 1993
|
|
39
|
Digital Multisignatures
– Boyd
- 1989
|
|
17
|
Threshold DSS signatures without a trusted party
– Langford
- 1995
|
|
16
|
Threshold cryptography,” European Transactions on Telecommunications and Related technologies
– Desmedt
- 1994
|
|
14
|
New digital signature scheme based on discrete logarithm
– YEN, LAIH
- 1993
|
|
8
|
Group oriented (t, n) digital signature scheme
– Harn
- 1994
|
|
8
|
Hidden signature schemes based on the discrete logarithm problem and related concepts
– Horster, Michels, et al.
- 1995
|
|
5
|
t; n)-threshold signature schemes based on discrete logarithm
– Li, Hwang, et al.
- 1995
|
|
2
|
selects ~ k 2 Zq , computes ~ r = g ~ k (mod p), and sends ~ r to Bob
– Alice
|
|
2
|
randomly selects ff 2 Zq and fi 2 Z q , computes r = mg ff ~ r fi (mod p) and ~ m = rfi \Gamma1 (mod q): (b) Bob checks whether ~ m 2 Z q . If this is not the case, he goes back to step a). Otherwise, he sends ~ m to Alice
– Bob
|
|
2
|
computes ~ s = ~ mx+ ~ k(mod q) and forwards ~ s to Bob
– Alice
|
|
2
|
computes s = ~ sfi + ff(mod q): The pair (r; s) is a Nyberg-Rueppel signature of the message m and the above protocol is a blind signature scheme
– Bob
|
|
1
|
Nonrepudiable Proxy Signature Schemes Based on Discrete Logarithm Problem, manuscript
– Zhang
- 1997
|