ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 Dynamic Membership Management in Anonymous and Deniable Distance Bounding
Cited 1 time in scopus Download 99 time Share share facebook twitter linkedin kakaostory
저자
조남수, 윤택영
발행일
202012
출처
Sustainability, v.12 no.4, pp.1-16
ISSN
2071-1050
출판사
MDPI
DOI
https://dx.doi.org/10.3390/su122410330
협약과제
20ZR1300, 지능형 사이버 보안 및 신뢰 인프라 기술 연구, 김익균
초록
For secure location proof in many applications, distance bounding protocols are considered as one of the useful tools that can be used in practice. In distance bounding protocols, a prover and a verifier can measure the distance between them by performing an interactive protocol. In general, the verifier is regarded as an honest service provider, and thus, an adversarial verifier is not considered for security analysis. However, we cannot ignore the possibility of the corruption of the verifier, which can spoil the prover's privacy. To handle the security problem, a prover-anonymous and deniable distance bounding protocol is proposed, which can guarantee the privacy of the prover even though the verifier is corrupted. In this paper, we review the prover-anonymous and deniable distance bounding protocol in terms of the membership management, and we show that the communication overhead in the protocol for each membership change is O(n) where n is the number of users. Then, we propose an improved membership management technique, which can efficiently support membership change in terms of the communication overhead. The improved technique requires O(1) for each membership change instead of O(n), as in the existing protocol.
KSP 제안 키워드
Communication overhead, Distance bounding protocols, Dynamic membership, Location proof, Number of users, Service Provider, membership management, security analysis
본 저작물은 크리에이티브 커먼즈 저작자 표시 (CC BY) 조건에 따라 이용할 수 있습니다.
저작자 표시 (CC BY)