ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Dynamic Membership Management in Anonymous and Deniable Distance Bounding
Cited 1 time in scopus Download 198 time Share share facebook twitter linkedin kakaostory
Authors
Nam-Su Jho, Taek-Young Youn
Issue Date
2020-12
Citation
Sustainability, v.12, no.4, pp.1-16
ISSN
2071-1050
Publisher
MDPI
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.3390/su122410330
Abstract
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 Keywords
Communication overhead, Distance bounding protocol, Dynamic membership, Location proof, Number of users, Service Provider, membership management, security analysis
This work is distributed under the term of Creative Commons License (CCL)
(CC BY)
CC BY