[논문]Dynamic Membership Management in Anonymous and Deniable Distance Bounding

Jho, Nam-Su; Youn, Taek-Young

doi:10.3390/su122410330

[해외논문] Dynamic Membership Management in Anonymous and Deniable Distance Bounding 원문보기

Sustainability, v.12 no.24, 2020년, pp.10330 -

Jho, Nam-Su (Electronics and Telecommunications Research Institute (ETRI), 218 Gajeong-ro, Yuseong-gu, Daejeon 34128, Korea) , Youn, Taek-Young (Department of Industrial Security, Dankook University, 655 Mabuk-dong, Giheung-gu, Yongin-si 16891, Korea)

Abstract ▼ AI-Helper

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.

참고문헌 (21)

Brands Distance-bounding protocols Advances in Cryptology-EUROCRYPT’93 1994 Volume 765 344
Hancke Distance Bounding: A Practical Security Solution for Real-Time Location Systems IEEE Trans. Ind. Inform. 2013 10.1109/TII.2012.2218252 9 16

상세보기
Čapkun, S., and Hubaux, J.-P. (2005, January 13-17). Secure positioning of wireless devices with application to sensor networks. Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Miami, FL, USA.
Nosouhi PASPORT: A Secure and Private Location Proof Generation and Verification Framework IEEE Trans. Comput. Soc. Syst. 2020 10.1109/TCSS.2019.2960534 7 293

상세보기
10.1145/3052973.3053000 Avoine, G., Bultel, X., Gambs, S., Gérault, D., Lafourcade, P., Onete, C., and Robert, J.-M. (2017, January 2-6). A Terrorist-fraud Resistant and Extractor-free Anonymous Distance-bounding Protocol. Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, Abu Dhabi, UAE.
10.1145/2939918.2939919 Bultel, X., Gambs, S., Gérault, D., Lafourcade, P., Onete, C., and Robert, J.-M. (2016, January 18-20). A Prover-Anonymous and Terrorist-Fraud Resistant Distance-Bounding Protocol. Proceedings of the 9th ACM Conference on Security & Privacy in Wireless and Mobile Networks, Darmstadt, Germany.
Yang Two-hop Distance-Bounding Protocols: Keep your Friends Close IEEE Trans. Mob. Comput. 2017 10.1109/TMC.2017.2771769 17 1723

상세보기
Hanke, G., and Kuhn, M. (2005, January 5-9). An RFID distance boundiing protocol. Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM’05), Athens, Greece.
10.1145/2590296.2590331 Gambs, S., Onete, C., and Robert, J.-M. (2014, January 4-6). Prover Anonymous and Deniable Distance-Bounding Authentication. Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, Kyoto, Japan.
Juels Defining Strong Privacy for RFID ACM Trans. Inf. Syst. Secur. 2009 10.1145/1609956.1609963 13 7

상세보기
10.1007/978-3-540-76900-2_5 Vaudenay, S. (2007). On privacy models for RFID. Advances in Cryptology-ASIACRYPT 2007, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, 2-6 December 2007, Springer.

상세보기
10.1145/1368310.1368352 Paise, R.-I., and Vaudenay, S. (2008, January 18-20). Mutual authentication in RFID: Security and privacy. Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, Tokyo, Japan.
10.1007/978-3-642-25286-0_6 Kardaş, S., Kiraz, M.S., Bingöl, M.A., and Demirci, H. (2011). A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions. RFID: Security and Privacy, Proceedings of the RFIDSec: International Workshop on Radio Frequency Identification: Security and Privacy, Amherst, MA, USA, 26-28 June 2011, Springer.

상세보기
10.1145/1229285.1229314 Reid, J., Nieto, J.M.G., Tang, T., and Senadji, B. (2007, January 20-22). Detecting relay attacks with timing-based protocols. Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, Singapore.
10.1007/0-387-25660-1_15 Bussard, L., and Bagga, W. (2005). Distance-bounding proof of knowledge to avoid real-time attacks. Security and Privacy in the Age of Ubiquitous Computing, Proceedings of the IFIP International Federation for Information Processing, Chiba, Japan, 30 May-1 June 2005, Springer.
10.1145/2462096.2462129 Hermans, J., Peeters, R., and Onete, C. (2013, January 17-19). Efficient, secure, private distance bounding without key updates. Proceedings of the Sixth ACM Conference on Security and Privacy in Wireless and Mobile Networks, Budapest, Hungary.
Kim RFID distance bounding protocols with mixed challenges IEEE Trans. Wirel. Commun. 2011 10.1109/TWC.2011.030411.101158 10 1618

상세보기
Kim Security Analysis of YKHL Distance Bounding Protocol with Adjustable False Acceptance Rate IEEE Commun. Lett. 2011 10.1109/LCOMM.2011.080811.111299 15 1078

상세보기
Yum Distance bounding protocol with adjustable false acceptance rate IEEE Commun. Lett. 2011 10.1109/LCOMM.2011.030911.110066 15 434

상세보기
Entezari RFID unilateral distance bounding protocols: A trade-off between mafia and distance fraud Comput. Commun. 2017 10.1016/j.comcom.2016.09.001 98 97

상세보기
Youn Signcryption with Fast Online Signing and Short Signcryptext for Secure and Private Mobile Communication Sci. China Inf. Sci. 2012 10.1007/s11432-012-4635-2 55 2530

상세보기

LOADING...

활용도 분석정보

상세보기

다운로드

내보내기

활용도 Top5 논문

해당 논문의 주제분야에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.

원문 보기

AccessON 원문보기

원문 URL 링크

DOI : 10.3390/su122410330 [무료]
Molecular Diversity Preservation International : 저널
AccessON : 저널

*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.

오픈액세스(OA) 유형

GOLD

오픈액세스 학술지에 출판된 논문

저작권 관리 안내

내보내기 메뉴

내보내기 구분

파일저장
인쇄
메일전송

구성항목

기본정보
상세정보

관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관

저장형식

Text(ASCII format)
Excel format
RefWorks Direct Export
RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley

메일정보

받는사람 (필수): @
보내는사람 (선택): @
제목
내용: KISTI 검색결과 이메일 서비스

안내

총 건의 자료가 검색되었습니다.

다운받으실 자료의 인덱스를 입력하세요. (1-10,000)

검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다.

데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요)

다운로드 파일은 UTF-8 형태로 저장됩니다.
파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오.

Text(ASCII format)
Excel format

표제어: PCR

동의어: Packet Collision Rate

용어 설명 출처 목록 (6)

용어 설명: PCR은 세균 특이성이 있는 primer를 이용하여 적은 수의 세균이 있을지라도 쉽게 검출할 수 있는 유용한 방법이며, 이를 이용하여 구강 내 치면세균막이나 타액에서 직접 세균을 검출할 수 있게 되었다[8].

AI-Helper ※ AI-Helper는 을 사용합니다.

AI-Helper

안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

연합인증