ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 New Efficient Batch Verification for an Identity-Based Signature Scheme
Cited 3 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
황정연, 최두호, 조현숙, 송보연
발행일
201510
출처
Security and Communication Networks, v.8 no.15, pp.2524-2535
ISSN
1939-0114
출판사
Wiley-Blackwell
DOI
https://dx.doi.org/10.1002/sec.1194
협약과제
15ZS1200, 시큐리티 큐레이션을제공하는 프라이버시강화형 개인정보유통보안 핵심기술개발, 진승헌
초록
Batch verification is a method to verify multiple digital signatures at a batch in time less than total individual verification time. Batch verification for an identity-based signature scheme (IBS) is attractive because a short public identity such as an e-mail address can be used as a verification key. In this paper, we first review the recent IBS scheme proposed by Shim and its batch verifier to show that the batch verifier is vulnerable to a forgery attack. In order to resist to the attack, we propose a new efficient batch verifier for the IBS scheme. The proposed batch verifier can deal with arbitrary number of signatures as a batch. We prove formally that the proposed batch verifier is secure. Then, we analyze the computation cost of the proposed batch verifier using concrete parameters and compare it with well-known batch verifiers. The comparison shows that our batch verifier can significantly outperform the existing batch verifiers in computation. We finally present a one-round three-party identity-based key agreement protocol as an application of our batch verifier, which requires only three pairing operations in verification.
키워드
Authenticated key agreement, Batch verification, Digital signature, Identity-based system
KSP 제안 키워드
Authenticated key agreement, Batch Verification, Computation cost, Concrete parameters, Digital signature, E-Mail, Identity-based system, One round, Signature scheme, Three-party, forgery attack