ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 Authenticated Distance Bounding Protocol with Improved FAR: Beyond the Minimal Bound of FAR
Cited 2 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
윤택영, 홍도원
발행일
201412
출처
IEICE Transactions on Communications, v.E97.B no.5, pp.930-935
ISSN
1745-1345
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/transcom.E97.B.930
협약과제
13SS1200, 미래 복합 컴퓨팅 환경에서의 데이터 프라이버시 강화 기술 개발, 장구영
초록
Distance bounding protocols permit a verifier to compute the distance to a prover by measuring the execution time of n rounds of challenge-response authentication. Many protocols have been proposed to reduce the false acceptance rate of the challenge-response procedure. Until now, it has been widely believed that the lowest bound of the false acceptance rate is (1/2)n when n is the number of rounds and the prover can send only one response bit for each round. In this paper, we propose a new distance bounding protocol whose false acceptance rate is (1/3)n against the distance fraud attacks and the mafia fraud attacks. To reduce the false acceptance rate, we use two challenge bits for each iteration and introduce a way of expressing three cases with the use of only one response bit, the same bit length as existing protocols. Our protocol is the first distance bounding protocol whose false acceptance rate is lower than the currently believed minimal bound without increasing the number of response bits for each round. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers.
키워드
Authentication, Distance bounding protocol, Distance fraud attacks, False acceptance rate, Mafia fraud attacks, Security
KSP 제안 키워드
Challenge-response authentication, Distance bounding protocols, Distance fraud, False acceptance rate, Information and communication, Mafia fraud, execution time