Abstract
Delegation of signing capability is a common practice in various applications. Mambo et al. proposed a proxy signatures as a solution for delegation of signing capability. Proxy signatures allow a designated proxy signer to sign on behalf of an original signer. After the concept of proxy signature scheme was proposed, many variants are proposed to support more general delegation setting. To capture all possible delegation structures, the concept of delegation network was introduced by Aura, and an ID-based delegation network was proposed by Chow et al. In the computational point of view, their solution requires E pairing operations and N elliptic curve scalar multiplications where E and N are the number of edges and nodes in a delegation structure, respectively. In this paper, we proposed an efficient ID-based delegation network which requires only E pairing operations. Moreover, we modify our delegation network, and the modified scheme requires only N pairing operations. In general, E is larger than N and E increases according to the complexity of the network. So the modified delegation network is remarkably efficient than the previous delegation network.
| Original language | English |
|---|---|
| Pages (from-to) | 382-391 |
| Number of pages | 10 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 4277 LNCS - I |
| Publication status | Published - 2006 Dec 15 |
Fingerprint
Keywords
- Delegation network
- ID-based signatures
- Proxy signatures
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science
Cite this
An efficient ID-based delegation network. / Youn, Taek G.; Park, Young Ho; Kim, Chang Han; Lim, Jong In.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 4277 LNCS - I, 15.12.2006, p. 382-391.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - An efficient ID-based delegation network
AU - Youn, Taek G.
AU - Park, Young Ho
AU - Kim, Chang Han
AU - Lim, Jong In
PY - 2006/12/15
Y1 - 2006/12/15
N2 - Delegation of signing capability is a common practice in various applications. Mambo et al. proposed a proxy signatures as a solution for delegation of signing capability. Proxy signatures allow a designated proxy signer to sign on behalf of an original signer. After the concept of proxy signature scheme was proposed, many variants are proposed to support more general delegation setting. To capture all possible delegation structures, the concept of delegation network was introduced by Aura, and an ID-based delegation network was proposed by Chow et al. In the computational point of view, their solution requires E pairing operations and N elliptic curve scalar multiplications where E and N are the number of edges and nodes in a delegation structure, respectively. In this paper, we proposed an efficient ID-based delegation network which requires only E pairing operations. Moreover, we modify our delegation network, and the modified scheme requires only N pairing operations. In general, E is larger than N and E increases according to the complexity of the network. So the modified delegation network is remarkably efficient than the previous delegation network.
AB - Delegation of signing capability is a common practice in various applications. Mambo et al. proposed a proxy signatures as a solution for delegation of signing capability. Proxy signatures allow a designated proxy signer to sign on behalf of an original signer. After the concept of proxy signature scheme was proposed, many variants are proposed to support more general delegation setting. To capture all possible delegation structures, the concept of delegation network was introduced by Aura, and an ID-based delegation network was proposed by Chow et al. In the computational point of view, their solution requires E pairing operations and N elliptic curve scalar multiplications where E and N are the number of edges and nodes in a delegation structure, respectively. In this paper, we proposed an efficient ID-based delegation network which requires only E pairing operations. Moreover, we modify our delegation network, and the modified scheme requires only N pairing operations. In general, E is larger than N and E increases according to the complexity of the network. So the modified delegation network is remarkably efficient than the previous delegation network.
KW - Delegation network
KW - ID-based signatures
KW - Proxy signatures
UR - http://www.scopus.com/inward/record.url?scp=33845415669&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845415669&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:33845415669
VL - 4277 LNCS - I
SP - 382
EP - 391
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 -