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
그룹 서명은 서명자가 자신이 속한 그룹을 대신하여 서명을 생성할 수 있는 서명자 익명성을 제공하는 서명입니다. 이러한 익명성은 개인 정보 보호 문제를 고려하면 상당히 매력적이지만 서명자가 취소되었는지 여부를 확인하는 것은 사소한 일이 아닙니다. 따라서 서명자의 권리를 철회하는 방법은 단체 서명 연구의 주요 주제 중 하나이다. 특히, 서명자 수에 따라 서명 및 검증 비용과 서명 크기가 일정한 확장성 N, 서명자와 관련된 기타 비용은 최대 대수적입니다. N, 매우 중요합니다. 본 논문에서는 이전의 모든 확장 가능한 방식에 비해 현재 더 효율적인 취소 가능 그룹 서명 방식을 제안합니다. 더욱이, 우리의 취소 가능한 그룹 서명 체계는 간단한 가정(임의의 오라클 모델) 하에서 안전하지만, 모든 확장 가능한 체계는 다음과 같이 안전합니다. q- 유형의 가정. 우리는 12비트 프라임 필드(BLS-455-12)에 대한 임베딩 차수 455의 Barreto-Lynn-Scott 곡선과 12비트 프라임 필드에 대한 임베딩 차수 382의 Barreto-Naehrig 곡선( BN-12-382), 각각 RELIC 라이브러리를 사용합니다. 우리 서명 알고리즘의 온라인 실행 시간은 약 14msec(BLS-12-455)와 11msec(BN-12-382)이며, 검증 알고리즘의 온라인 실행 시간은 약 20msec(BLS-12-455)와 16msec(BS-12-382)인 것으로 나타났습니다. BN-XNUMX-XNUMX). 마지막으로 우리는 우리의 계획(약간 확장)이 Isshiki et al.이 제안한 ID 관리 시스템에 적용되었음을 보여주었습니다.
Keita EMURA
National Institute of Information and Communications Technology (NICT)
Takuya HAYASHI
National Institute of Information and Communications Technology (NICT)
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.
부
Keita EMURA, Takuya HAYASHI, "A Revocable Group Signature Scheme with Scalability from Simple Assumptions" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 125-140, January 2020, doi: 10.1587/transfun.2019CIP0004.
Abstract: Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers N, and other costs regarding signers are at most logarithmic in N, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under q-type assumptions. We implemented our scheme by employing a Barreto-Lynn-Scott curve of embedding degree 12 over a 455-bit prime field (BLS-12-455), and a Barreto-Naehrig curve of embedding degree 12 over a 382-bit prime field (BN-12-382), respectively, by using the RELIC library. We showed that the online running times of our signing algorithm were approximately 14msec (BLS-12-455) and 11msec (BN-12-382), and those of our verification algorithm were approximately 20msec (BLS-12-455) and 16msec (BN-12-382), respectively. Finally, we showed that our scheme (with a slight extension) is applied to an identity management system proposed by Isshiki et al.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0004/_p
부
@ARTICLE{e103-a_1_125,
author={Keita EMURA, Takuya HAYASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Revocable Group Signature Scheme with Scalability from Simple Assumptions},
year={2020},
volume={E103-A},
number={1},
pages={125-140},
abstract={Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers N, and other costs regarding signers are at most logarithmic in N, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under q-type assumptions. We implemented our scheme by employing a Barreto-Lynn-Scott curve of embedding degree 12 over a 455-bit prime field (BLS-12-455), and a Barreto-Naehrig curve of embedding degree 12 over a 382-bit prime field (BN-12-382), respectively, by using the RELIC library. We showed that the online running times of our signing algorithm were approximately 14msec (BLS-12-455) and 11msec (BN-12-382), and those of our verification algorithm were approximately 20msec (BLS-12-455) and 16msec (BN-12-382), respectively. Finally, we showed that our scheme (with a slight extension) is applied to an identity management system proposed by Isshiki et al.},
keywords={},
doi={10.1587/transfun.2019CIP0004},
ISSN={1745-1337},
month={January},}
부
TY - JOUR
TI - A Revocable Group Signature Scheme with Scalability from Simple Assumptions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 125
EP - 140
AU - Keita EMURA
AU - Takuya HAYASHI
PY - 2020
DO - 10.1587/transfun.2019CIP0004
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2020
AB - Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering privacy issues, it is not trivial to check whether a signer has been revoked or not. Thus, how to revoke the rights of signers is one of the major topics in the research on group signatures. In particular, scalability, where the signing and verification costs and the signature size are constant in terms of the number of signers N, and other costs regarding signers are at most logarithmic in N, is quite important. In this paper, we propose a revocable group signature scheme which is currently more efficient compared to previous all scalable schemes. Moreover, our revocable group signature scheme is secure under simple assumptions (in the random oracle model), whereas all scalable schemes are secure under q-type assumptions. We implemented our scheme by employing a Barreto-Lynn-Scott curve of embedding degree 12 over a 455-bit prime field (BLS-12-455), and a Barreto-Naehrig curve of embedding degree 12 over a 382-bit prime field (BN-12-382), respectively, by using the RELIC library. We showed that the online running times of our signing algorithm were approximately 14msec (BLS-12-455) and 11msec (BN-12-382), and those of our verification algorithm were approximately 20msec (BLS-12-455) and 16msec (BN-12-382), respectively. Finally, we showed that our scheme (with a slight extension) is applied to an identity management system proposed by Isshiki et al.
ER -