### Abstract

In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain number of times according to his/her position in the group. In proxy signature schemes, an original signer may want to allow a proxy signer to generate a certain number of signatures on behalf of the original signer. In the paper, we discuss signature schemes, called c-times signature schemes, that restrict the signing ability of a signer up to c times for pre-defined value c at set-up. We formally define the notion and the security model of c-times signature schemes. In fact, c-times signature schemes can be classified into two types according to restriction features: one with an explicit limitation, called a c-times signature scheme, and the other with an implicit limitation, called an implicit c-times signature scheme. We present two instances of implicit c-times signature schemes and then give proofs of the security. For one instance we suggest ^{c}S which is a composition of a signature scheme S based on the discrete logarithm and Feldman's VSS. For the other we present ^{c} DSA based on DSA. Our basic approach can be applied to signature schemes such as HVZK based signature schemes.

Original language | English |
---|---|

Pages (from-to) | 324-335 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 2727 LNCS |

DOIs | |

Publication status | Published - 2003 Dec 1 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*,

*2727 LNCS*, 324-335. https://doi.org/10.1007/3-540-45067-X_28

**Digital signature schemes with restriction on signing capability.** / Hwang, Jung Yeon; Kim, Hyun Jeong; Lee, Dong Hoon; Lim, Jong In.

Research output: Contribution to journal › Article

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, vol. 2727 LNCS, pp. 324-335. https://doi.org/10.1007/3-540-45067-X_28

}

TY - JOUR

T1 - Digital signature schemes with restriction on signing capability

AU - Hwang, Jung Yeon

AU - Kim, Hyun Jeong

AU - Lee, Dong Hoon

AU - Lim, Jong In

PY - 2003/12/1

Y1 - 2003/12/1

N2 - In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain number of times according to his/her position in the group. In proxy signature schemes, an original signer may want to allow a proxy signer to generate a certain number of signatures on behalf of the original signer. In the paper, we discuss signature schemes, called c-times signature schemes, that restrict the signing ability of a signer up to c times for pre-defined value c at set-up. We formally define the notion and the security model of c-times signature schemes. In fact, c-times signature schemes can be classified into two types according to restriction features: one with an explicit limitation, called a c-times signature scheme, and the other with an implicit limitation, called an implicit c-times signature scheme. We present two instances of implicit c-times signature schemes and then give proofs of the security. For one instance we suggest cS which is a composition of a signature scheme S based on the discrete logarithm and Feldman's VSS. For the other we present c DSA based on DSA. Our basic approach can be applied to signature schemes such as HVZK based signature schemes.

AB - In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain number of times according to his/her position in the group. In proxy signature schemes, an original signer may want to allow a proxy signer to generate a certain number of signatures on behalf of the original signer. In the paper, we discuss signature schemes, called c-times signature schemes, that restrict the signing ability of a signer up to c times for pre-defined value c at set-up. We formally define the notion and the security model of c-times signature schemes. In fact, c-times signature schemes can be classified into two types according to restriction features: one with an explicit limitation, called a c-times signature scheme, and the other with an implicit limitation, called an implicit c-times signature scheme. We present two instances of implicit c-times signature schemes and then give proofs of the security. For one instance we suggest cS which is a composition of a signature scheme S based on the discrete logarithm and Feldman's VSS. For the other we present c DSA based on DSA. Our basic approach can be applied to signature schemes such as HVZK based signature schemes.

UR - http://www.scopus.com/inward/record.url?scp=21644483944&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21644483944&partnerID=8YFLogxK

U2 - 10.1007/3-540-45067-X_28

DO - 10.1007/3-540-45067-X_28

M3 - Article

AN - SCOPUS:21644483944

VL - 2727 LNCS

SP - 324

EP - 335

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -