### Abstract

Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N)or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch- Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where no updates of secret key are required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with 0(v'A)-size public key, where signing and verifying have constant extra costs.

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

Pages (from-to) | 463-480 |

Number of pages | 18 |

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

Volume | 5443 |

DOIs | |

Publication status | Published - 2009 |

### 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)*,

*5443*, 463-480. https://doi.org/10.1007/978-3-642-00468-1_26

**Revocable group signature schemes with constant costs for signing and verifying.** / Nakanishi, Toru; Fujii, Hiroki; Hira, Yuta; Funabiki, Nobuo.

Research output: Contribution to journal › Article

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, vol. 5443, pp. 463-480. https://doi.org/10.1007/978-3-642-00468-1_26

}

TY - JOUR

T1 - Revocable group signature schemes with constant costs for signing and verifying

AU - Nakanishi, Toru

AU - Fujii, Hiroki

AU - Hira, Yuta

AU - Funabiki, Nobuo

PY - 2009

Y1 - 2009

N2 - Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N)or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch- Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where no updates of secret key are required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with 0(v'A)-size public key, where signing and verifying have constant extra costs.

AB - Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N)or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch- Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where no updates of secret key are required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with 0(v'A)-size public key, where signing and verifying have constant extra costs.

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

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

U2 - 10.1007/978-3-642-00468-1_26

DO - 10.1007/978-3-642-00468-1_26

M3 - Article

AN - SCOPUS:67049119911

VL - 5443

SP - 463

EP - 480

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -