PDCS: Security and privacy support for data-centric sensor networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1298-1306

  Shao, Min ^a   Zhu, Sencun ^a   Zhang, Wensheng ^b   Cao, Guohong ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b Iowa State University

Author keywords

Data centric; Keyed bloom filter; Privacy; Security; Wireless sensor networks

Indexed keywords

COMPUTER SIMULATION; CRYPTOGRAPHY; DATA PRIVACY; INFORMATION DISSEMINATION; OPTIMIZATION;

DATA-CENTRIC SENSOR NETWORKS (DCS); KEYED BLOOM FILTER; QUERY DELAY;

WIRELESS SENSOR NETWORKS;

EID: 34548302064     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.154     Document Type: Conference Paper

References (26)

1. S. RatNasamy, B. karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, "GHT: A Geographic Hash Table for Data-Centric Storage," ACM International Workshop on Wireless Sensor Networks and Applications, September 2002.
2. S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin, "Data-centric storage in sensornets," ACM SIGCOMM Computer Communication Review archive, vol. 33, no. 1, pp. 137-142, 2003.
3. D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin and J. Heidemann, "Multi-resolution Storage and Search in Sensor Networks," ACM Transactions on Storage, August 2005.
4. W. Zhang, G. Cao, and T. La Porta, "Data Dissemination with Ring-Based Index for Wireless Sensor Networks," IEEE International Conference on Network Protocols (ICNP), pp. 305-314, November 2003.
5. B. Karp and H. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," ACM Mobicom, 2000.
6. A. Perrig, J. Stankovic, and D. Wagner, "Security in Wireless Sensor Networks," Communications of the ACM, vol. 47, no. 6, June 2004.
7. J. Deng, C. Hartung, R. Han, and S. Mishra, "A practical study of transitory master key establishment for wireless sensor networks," in IEEE/CreateNet Conference on Security and Privacy for Emerging Areas in Communication Networks (SecureComm), 2005, pp. 289-299.
8. A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. Tygar, "Spins: security protocols for sensor netowrks," in ACM Mobicom, 2001.
9. W. Du, J. Deng, Y. Han, and P. Varshney, "A pairwise key pre-distribution scheme for wireless sensor networks," in Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03), 2003, pp. 42-51.
10. D. Liu and P. Ning, "Establishing pairwise keys in distributed sensor networks," in ACM CCS, 2003.
11. S. Zhu, S. Setia, and S. Jajodia, "Leap: Efficient security mechanisms for large-scale distributed sensor networks," in ACM CCS, 2003.
12. Y. Zhang,W. Liu, W. Lou, and Y. Fang, "Location-based compromise-tolerant security mechanisms for wireless sensor networks," IEEE Journal on Selected Areas in Communications, Feb. 2006.
13. Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, and William Arbaugh, "Toward resilient security in wireless sensor networks," in ACM MOBIHOC, 2005.
14. W. Zhang and G. Cao, "Group Rekeying for Filtering False Data in Sensor Networks: A Predistribution and Local Collaboration-Based Approach," IEEE INFOCOM, March 2005.
15. J. Deng, R. Han, and S. Mishra, "Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks," International Conference on Dependable Systems and Networks (DSN'04), June 2004.
16. C. Ozturk, Y. Zhang, and W. Trappe, "Source-location privacy in energy-constrained sensor networks routing," ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'04), October 2004.
17. M. Reiter and A. Rubin, "Crowds: Anonymity for web transactions," ACM Transactions on Information and System Security, vol. 1, no. 1, pp. 66-92, 1998.
18. Pawel Winter and Martin Zachariasen, "Euclidean steiner minimum trees: An improved exact algorithm.," Networks, vol. 30, no. 3, pp. 149-166, 1997.
19. B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Communications of the ACM, 1970.
20. "The tinydb project," http://telegraph.cs.berkeley.edu/tinydb/.
21. Roberto Cordone and Francesco Maffioli, "On the complexity of graph tree partition problems," Discrete Appl. Math., vol. 134, no. 1-3, pp. 51-65, 2004.
22. G. Myles, A. Friday, and N. Davies, "Preserving privacy in environments with location-based applications," in IEEE Pervasive Computing, 2003.
23. U. Hengartner and P. Steenkiste, "Protecting access to people location information.," in Proceedings of the First International Conference on Security in Pervasive Computing, 2003.
24. M. Gruteser, G. Schelle, A. Jain, R. Han, and D. Grunwald, "Privacy-aware location sensor networks," in Proceedings of 9th USENIX Workshop on Hot Topics in Operating Systems (HotOS IX), 2003.
25. Y. Ko and N. Vaidya, "Location-aided Routing in Mobile Ad Hoc Networks," ACM Mobicom, pp. 66-75, 1998.
26. D. Niculescu and B. Nath, "Trajectory Based Forwarding and Its Applications," ACM MOBICOM, 2003.