期刊文献+

An Anonymous Data Collection Framework for Digital Community

An Anonymous Data Collection Framework for Digital Community
原文传递
导出
摘要 Collected data in digital community containing sensitive information about individuals or corporations and such information should be protected. In this paper, a security framework based on (a, k)-anonymity for privacy preserving data collection in digital community is proposed. In our framework, aggregation nodes anonymize the collected data to a basic privacy level. Then, the base stations further anonymize the data to a deeper privacy level with encryption-generalizaiton operations. Experimental results and detailed theory analysis demonstrate that this method is effective in terms of privacy levels and data quality with low resource consumption. Collected data in digital community containing sensitive information about individuals or corporations and such information should be protected. In this paper, a security framework based on (a, k)-anonymity for privacy preserving data collection in digital community is proposed. In our framework, aggregation nodes anonymize the collected data to a basic privacy level. Then, the base stations further anonymize the data to a deeper privacy level with encryption-generalizaiton operations. Experimental results and detailed theory analysis demonstrate that this method is effective in terms of privacy levels and data quality with low resource consumption.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2013年第5期385-392,共8页 武汉大学学报(自然科学英文版)
基金 Supported by Program for Changjiang Scholars and Innovative Research Team in University of China (IRT1078) the Key Program of NSFC-Guangdong Union Foundation of China (U1135002) the Major national S&T program of China (2011ZX03005-002) the Fundamental Research Funds for the Central Universities of China (JY10000903001)
关键词 ANONYMITY digital community data collection PRIVACY anonymity digital community data collection privacy
  • 相关文献

参考文献22

  • 1Australian Unity.Australian unity wellbeing index[EB/OL]. [2010-10-06].http://www.australianunitycorporate.com. au/c ommunity/auwi/Pages/default.aspx.
  • 2Chaum D. The dining cryptographers problem: Unconditional sender and receipent untraceability [J]. Journal of Cryptology, 1988, 1(1): 65-75.
  • 3Chaum D. Untraceable electronic mail, return addresses, and digital pseudonyms [J]. Advances in Information Security, 2003, 24(2): 84-88.
  • 4Marga N, Carlos T C, Juan C C. An overview of anonymous communication in mobile ad hocnetworks [J]. Wireless Communication and Mobile Computing, 2012, 12(8): 661- 675.
  • 5Pfitzmann A, Pfitzmarm B, Waidner M. ISDN-Mixes: Untra- ceable communication with very small bandwithoverhead [C]// Proc GI/ITG: Communication in Distributed Systems. Mannheim: Springer-Verlag, 1991 : 451-463.
  • 6Edith C H, Ngai, Loana R. On providing location privacy for mobile sinks in wireless sensor networks [J]. Wireless Networks, 2013, 19(1): 115-130.
  • 7Lakshmi S, Ramesh S P. Secure encrypted-data routing protocol for wireless sensor networks [J]. Journal of Computer Applications, 2012, 5(2): 167-173.
  • 8Ganesh S, Amutha R, Efficient and secure routing protocol forwireless sensor networks through optimal power control and optimal handoff-based recovery mechanism [EB/OL]. [2013-02- 16]. http://www, hindawi, com/journals/jcnc/2012/971685~eta~.
  • 9Kumar S, Dohare D, Kumar M. An efficient key distribution scheme for wireless sensor networks using polynomial based schemes [C]//Proc 2012 International Conference on Information and Network Technology. Singapore: IACSIT Press, 2012: 21-27.
  • 10Sridhar V, Raghavendar V. Key predistribution scheme for grid based wireless sensor networks using quadruplex polynomial shares per node [C]// Proc 2nd International Conference on Ambient Systems, Networks and Technologies Niagara Falls: Elsevier Ltd, 2011: 132-140.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部