期刊文献+

基于隐私保护和完整性验证的Top-k查询方法 被引量:5

A Privacy-Preserving Integrity-Verification-Based Top-k Query Processing
下载PDF
导出
摘要 2层无线传感器网络由于具有寿命长和易扩展的特点,已经成为当前的研究热点.Top-k查询是一种重要的查询类型,但是大多数的Top-k查询不能执行精确查询任务.提出了一种精确的Top-k查询算法PI-TQ(privacy-preserving integrity-verification Top-kquery),同时提供了隐私保护和完整性验证功能.算法采用2次查询方法以减少数据通信量,利用基于干扰数的扰动算法实现隐私保护,并采用概率空间邻居验证模式实现完整性验证.仿真结果表明,PI-TQ算法与同类算法相比较,可以明显减少查询的通信量和计算代价,同时保证查询结果的正确性、隐私性和完整性. The two-tiered wireless sensor networks have become the research hotspot because of its scalability and long lifetime. Top-k query is an important query type but most Top-k query technologies cannot perform precise query. :A Top-k query asks for data items whose numeric attributes are among the k highest, where k is an application-dependent parameter. The privacy preservation is important for Top-k query in a hostile environment because sensitive information may leak from compromised nodes. The integrity and authenticity of the Top-k query results should be verified because the adversary can instruct a compromised master node to delete or modify data in response to Top-k queries. This paper presents a precise query algorithm called PI-TQ (privacy- preserving integrity-verification Top-k query) which provides both privacy preservation and integrity verification. The algorithm uses a two-step query method to reduce the communication traffic between nodes and sinks. To ensure the privacy and correctness of the query results, the perturbation algorithm is utilized to protect the privacy of sensitive data. The neighbor verification method achieves integrity verification by using probability space. The simulation results show that PI-TQ algorithm can greatly reduce the computational cost and traffic consumption compared with other algorithms. It can also guarantee accuracy, privacy and integrity of the query results.
出处 《计算机研究与发展》 EI CSCD 北大核心 2014年第12期2585-2592,共8页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61202353 61272084 61300240) 江苏省高校自然科学研究项目(12KJB520008) 江苏省普通高校研究生科研创新计划基金项目(CXLX13_464)
关键词 2层无线传感器网络 TOP-K查询 隐私保护 完整性验证 数据扰动 two-tiered wireless sensor, networks Top-k query privacy preserving integrityverification data perturbation
  • 相关文献

参考文献17

  • 1Sheng B,Li Q.Verifiable privacy-preserving range query in two-tiered sensor networks[C]// Proc of the 27th IEEE INFOCOM.Piscataway,NJ:IEEE,2008:46-50.
  • 2Zhang W,Wang C,Feng T.GP2S:Generic privacy-preservation solutions for approximate aggregation of sensor data[C]// Proc of the 6th Annual IEEE Int Conf on PerCom.Piscataway,NJ:IEEE,2008:179-184.
  • 3He W,Liu X,Nguyen H,et al.Pda:Privacy-preserving data aggregation in wireless sensor networks[C]// Proc of the 26th IEEE INFOCOM.Piscataway,NJ:IEEE,2007:2045-2053.
  • 4Bu Jiajun,Yin Mingjian,He Daojing,et al.SEF:A secure,efficient,and flexible range query scheme in two-tiered sensor networks[OL].[2014-04-30].http://www.hindawi.com/journals/ijdsn/2011/126407/.
  • 5Zhang R,Shi J,Liu Y,et al.Verifiable fine-grained Top-k queries in tiered sensor networks[C]// Proc of the 29th IEEE INFOCOM.Piscataway,NJ:IEEE,2010:1-9.
  • 6范永健,陈红.两层传感器网络中可验证隐私保护Top-k查询协议[J].计算机学报,2012,35(3):423-433. 被引量:29
  • 7He T,Krishnamurthy S,Stankovic J A,et al.Energy efficient surveillance system using wireless sensor networks[C]//Proc of the 2nd Int Conf on Mobile Systems,Applications and Services.New York:ACM,2004:270-283.
  • 8Szewczyk R,Ferencz A.Energy implications of network sensor designs[J].EURASIP Journal on Wireless Communications and Networking,2005,5(5):635-644.
  • 9Zeinalipour-Yazti D,Vagena Z,Gunopulos D,et al.The threshold join algorithm for Top-k queries in distributed sensor networks[C]//Proc of the 2nd Int Workshop on Data Management for Sensor Networks.New York:ACM,2005:61-66.
  • 10Silberstein A S,Braynard R,Ellis C,et al.A samplingbased approach to optimizing Top-k queries in sensor networks[C]// Proc of the 22nd Int Conf on Data Engineering.Piscataway,NJ:IEEE,2006:68-68.

二级参考文献59

  • 1李顺东,王道顺,戴一奇,罗平.两个集合相等的多方保密计算[J].中国科学(F辑:信息科学),2009,39(3):305-310. 被引量:5
  • 2李顺东,戴一奇,游启友.姚氏百万富翁问题的高效解决方案[J].电子学报,2005,33(5):769-773. 被引量:43
  • 3秦波,秦慧,周克复,王晓峰,王育民.常数复杂性的百万富翁协议[J].西安理工大学学报,2005,21(2):149-152. 被引量:13
  • 4Yao A. Protocols for secure computation[ A]. Proceeding of the 23th IEEE Symposium on Foundations of Computer Science [C]. Los Alamitos, CA: 1EEE Computer Society Press, 1982. 160- 164.
  • 5Cachin C. Efficient private bidding and auctions with an oblivi- ous third party[ A] .Proceedings of the 6th ACM Conference on Computer and Communications Security[ C ]. New York: ACM Press, 1999.120 - 127.
  • 6Lin H Y, Tzeng W G. An efficient solution to the millionaires problem based on homomorphic Encrypfion[ A]. Proceedings of the 4th International Conference on Applied Cryptography and Networks Security[ C] .New York: 2005.456 - 466.
  • 7Fagin R, Naor M, Winkler P. Comparing information without leaking it[ J ]. Communications of the A CM, 1996,39(5 ) : 77 - 85.
  • 8Ioannidis I,Grama A.An efficient protocol for Yao's million- aires' problem[ A]. In Proceedings of the 36th Annual Hawaii International Conference on System Sciences [ C]. Hawaii: 2003.
  • 9Li S D,Wang D S,Dai Y Q,Luo P. Symmetric cryptographic solution to Yao's Milh'onaires' problem and an evaluation of secure multiparty computafions[ J]. Information Sciences. 2008, 178: 244 - 255.
  • 10Goldreich O, Micali S, Wigderson A. How to play any mental game[ A] .In Proceedings of the 19th Annual ACM Conference on Theory of Computing[ C]. New York: ACM, 1987. 218 - 229.

共引文献76

同被引文献27

引证文献5

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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