The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dans les authentifications utilisateur basées sur l'ID, un problème de confidentialité peut survenir, puisque le fournisseur de services (SP) peut accumuler l'historique d'accès de l'utilisateur à partir de l'ID utilisateur. Pour résoudre ce problème, des signatures de groupe ont été recherchées. L'un des problèmes importants dans les signatures de groupe est la révocation de l'utilisateur. Auparavant, un schéma révocable efficace avec signature/vérification de complexité constante avait été proposé par Libert et al. Dans ce schéma, les utilisateurs sont gérés par une arborescence binaire et une liste de données pour les utilisateurs révoqués, appelée liste de révocation (RL), est utilisée pour la révocation. Cependant, le système souffre du grand RL. Récemment, un schéma étendu a été proposé par Sadiah et Nakanishi, dans lequel la taille du RL est réduite en compressant le RL. D'un autre côté, il existe un problème lié au fait qu'une certaine surcharge se produit lors de l'authentification en tant que prix à payer pour réduire la taille du RL. Dans cet article, nous proposons un schéma étendu où l'authentification est accélérée en réduisant le nombre de preuves Groth-Sahai (GS). De plus, nous l'avons implémenté sur PC pour montrer son efficacité. Le temps de vérification est environ 30 % plus court que celui du projet précédent de Sadiah et Nakanishi.
Yasuyuki SEITA
Hiroshima University
Toru NAKANISHI
Hiroshima University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Yasuyuki SEITA, Toru NAKANISHI, "Speeding Up Revocable Group Signature with Compact Revocation List Using Vector Commitments" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 12, pp. 1676-1687, December 2019, doi: 10.1587/transfun.E102.A.1676.
Abstract: In ID-based user authentications, a privacy problem can occur, since the service provider (SP) can accumulate the user's access history from the user ID. As a solution to that problem, group signatures have been researched. One of important issues in the group signatures is the user revocation. Previously, an efficient revocable scheme with signing/verification of constant complexity was proposed by Libert et al. In this scheme, users are managed by a binary tree, and a list of data for revoked users, called a revocation list (RL), is used for revocation. However, the scheme suffers from the large RL. Recently, an extended scheme has been proposed by Sadiah and Nakanishi, where the RL size is reduced by compressing RL. On the other hand, there is a problem that some overhead occurs in the authentication as a price for reducing the size of RL. In this paper, we propose an extended scheme where the authentication is speeded up by reducing the number of Groth-Sahai (GS) proofs. Furthermore, we implemented it on a PC to show the effectiveness. The verification time is about 30% shorter than that of the previous scheme by Sadiah and Nakanishi.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1676/_p
Copier
@ARTICLE{e102-a_12_1676,
author={Yasuyuki SEITA, Toru NAKANISHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Speeding Up Revocable Group Signature with Compact Revocation List Using Vector Commitments},
year={2019},
volume={E102-A},
number={12},
pages={1676-1687},
abstract={In ID-based user authentications, a privacy problem can occur, since the service provider (SP) can accumulate the user's access history from the user ID. As a solution to that problem, group signatures have been researched. One of important issues in the group signatures is the user revocation. Previously, an efficient revocable scheme with signing/verification of constant complexity was proposed by Libert et al. In this scheme, users are managed by a binary tree, and a list of data for revoked users, called a revocation list (RL), is used for revocation. However, the scheme suffers from the large RL. Recently, an extended scheme has been proposed by Sadiah and Nakanishi, where the RL size is reduced by compressing RL. On the other hand, there is a problem that some overhead occurs in the authentication as a price for reducing the size of RL. In this paper, we propose an extended scheme where the authentication is speeded up by reducing the number of Groth-Sahai (GS) proofs. Furthermore, we implemented it on a PC to show the effectiveness. The verification time is about 30% shorter than that of the previous scheme by Sadiah and Nakanishi.},
keywords={},
doi={10.1587/transfun.E102.A.1676},
ISSN={1745-1337},
month={December},}
Copier
TY - JOUR
TI - Speeding Up Revocable Group Signature with Compact Revocation List Using Vector Commitments
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1676
EP - 1687
AU - Yasuyuki SEITA
AU - Toru NAKANISHI
PY - 2019
DO - 10.1587/transfun.E102.A.1676
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2019
AB - In ID-based user authentications, a privacy problem can occur, since the service provider (SP) can accumulate the user's access history from the user ID. As a solution to that problem, group signatures have been researched. One of important issues in the group signatures is the user revocation. Previously, an efficient revocable scheme with signing/verification of constant complexity was proposed by Libert et al. In this scheme, users are managed by a binary tree, and a list of data for revoked users, called a revocation list (RL), is used for revocation. However, the scheme suffers from the large RL. Recently, an extended scheme has been proposed by Sadiah and Nakanishi, where the RL size is reduced by compressing RL. On the other hand, there is a problem that some overhead occurs in the authentication as a price for reducing the size of RL. In this paper, we propose an extended scheme where the authentication is speeded up by reducing the number of Groth-Sahai (GS) proofs. Furthermore, we implemented it on a PC to show the effectiveness. The verification time is about 30% shorter than that of the previous scheme by Sadiah and Nakanishi.
ER -