ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Short Dynamic Group Signature Scheme Supporting Controllable Linkability
Cited 43 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
황정연, Liqun Chen, 조현숙, 양대훈
발행일
201506
출처
IEEE Transactions on Information Forensics and Security, v.10 no.6, pp.1109-1124
ISSN
1556-6013
출판사
IEEE
DOI
https://dx.doi.org/10.1109/TIFS.2015.2390497
협약과제
15ZS1200, 시큐리티 큐레이션을제공하는 프라이버시강화형 개인정보유통보안 핵심기술개발, 진승헌
초록
The controllable linkability of group signatures introduced by Hwang et al. enables an entity who has a linking key to find whether or not two group signatures were generated by the same signer, while preserving the anonymity. This functionality is very useful in many applications that require the linkability but still need the anonymity, such as sybil attack detection in a vehicular ad hoc network and privacy-preserving data mining. In this paper, we present a new group signature scheme supporting the controllable linkability. The major advantage of this scheme is that the signature length is very short, even shorter than this in the best-known group signature scheme without supporting the linkability. We have implemented our scheme in both a Linux machine with an Intel Core2 Quad and an iPhone4. We compare the results with a number of existing group signature schemes. We also prove security features of our scheme, such as anonymity, traceability, nonframeability, and linkability, under a random oracle model.
키워드
Anonymity, Group signature, Linkability, Privacy
KSP 제안 키워드
Attack Detection, Controllable linkability, Data mining(DM), Dynamic group signature, Privacy Preserving Data Mining(PPDM), Signature scheme, Vehicular Ad hoc Networks(VANETs), random oracle model, security features, sybil attack