计算机工程与应用2011，Vol.47Issue(36)：99-101,108,4.DOI:10.3778/j.issn.1002-8331.2011.36.027
两种基于Quad-Tree的匿名算法
Two anonymous algorithms based on Quad-Tree
摘要
Abstract
The LBS brings tremendous convenience,it also implies the disclosure of location privacy.To protect users' location privacy,an effective method for protection is to cloak the user's exact coordinates into a spatial region.Existing Quad-tree-based algorithms incur high cloaking time and low accuracy.To address this issue, the paper presents two cloaking algorithms, namely QFC and SWC.In constrast to traditional cloaking algorithm(Casper).QFC can reduce the CPU time significantly at the same cloaking accuracy.SWC can achieve a higher cloaking accuracy than Casper at the cost of certain CPU time.关键词
位置服务/位置隐私/步进式/步进式匿名(SWC)/快速匿名(OFC)Key words
Location Based Service(LBS)/location privacy/stepwise/Stepwise Cloaking(SWC)/Quick Finding Cloaking(QFC)分类
信息技术与安全科学引用本文复制引用
王勇,曹金凤,董一鸿,陈华辉,钱江波..两种基于Quad-Tree的匿名算法[J].计算机工程与应用,2011,47(36):99-101,108,4.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60973047) （the National Natural Science Foundation of China under Grant No.60973047）
浙江省自然科学基金(No.Y1080490) （No.Y1080490）
浙江省公益技术应用研究项目(No.2010C33149) （No.2010C33149）
宁波市自然基金(No.2010A610098,No.2010A610115). （No.2010A610098,No.2010A610115）
