Check-in service as one of the most popular services in mobile social network services (MSNS), has serious personal privacy leakage threats. In this paper, check-in sequences of pseudonym users were buffered , and association graph for buffered check-in sequences was built, which can achieve a privacy guarantee of k-anonymity. The method guarantee the number of lost check-in locations is minimized while satisfying users' privacy requirements, it is also reduces the cost of finding trajectory k-anonymity set. At last, the results of a set of comparative experiments with (k, δ) - anonymity on real world datasets show the method's accuracy and effectiveness.
목차
Abstract 1. Introduction 2. System Structure 3. The Generation Algorithm of k-anonymity Check-in Sequence 4. Experimental Results and Analysis 4.1 Experiment Data 4.2. Result Analysis 5. Conclusions Acknowledgements References
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.7 No.6