The sign-in service of Mobile Social Networking Services (MSNS) has a serious issue of privacy disclosure. As to solving this issue, there is a method proposed to protect privacy. This method is to conduct binary coding for sign-in sequence and then construct ant path diagram. The random search, the positive and negative feedback principle of ant path graph are applied to mine frequent item sets. The longest common subsequence is achieved from sign-in sequence and corresponding frequent item sets. Finally, k-anonymous sign-in sequence will be obtained. Based on real data, this method is compared with (k, δ) - anonymity which proves the accuracy and efficiency of this method through various aspects.
목차
Abstract 1. Introduction 2. Generating Algorithm of K-Anonymous Sign-In Sequence 2.1. Coding Sign-In Sequence 2.2. Constructing ANT Path Diagram 2.3. Mining Frequent K Item Sets 2.4. Solution to K-Anonymous Sign-In Sequence 3. Experimental Result and Analysis 4. Conclusions 5. Acknowledgement References
키워드
privacy preservationmobile social networksant colony algorithmk-anonymous
저자
Chen Wen [ School of Mathematics and Computer Science, Tongling College, Tongling, P. R. China ]
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.8 No.3