Taiming Feng, Chuang wang, Wensheng Zhang and Lu Ruan INFOCOM 2008 Presented by Mary Nader.

Slides:



Advertisements
Similar presentations
Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Advertisements

Efficient Information Retrieval for Ranked Queries in Cost-Effective Cloud Environments Presenter: Qin Liu a,b Joint work with Chiu C. Tan b, Jie Wu b,
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Enhancing Secrecy With Channel Knowledge
Beyond the MDS Bound in Distributed Cloud Storage
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
Security and Privacy Issues in Wireless Communication By: Michael Glus, MSEE EEL
Location-Aware Security Services for Wireless Sensor Networks using Network Coding IEEE INFOCOM 2007 최임성.
An Energy Efficient Hierarchical Heterogeneous Wireless Sensor Network
1 Security in Wireless Sensor Networks Group Meeting Fall 2004 Presented by Edith Ngai.
A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks Wenliang (Kevin) Du, Jing Deng, Yunghsiang S. Han and Pramod K. Varshney Department.
H-SPREAD: A Hybrid Multipath Scheme for Secure and Reliable Data Collection in Wireless Sensor Networks Wenjing Lou, Member, IEEE, and Younggoo Kwon.
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Random Key Predistribution Schemes for Sensor Networks Authors: Haowen Chan, Adrian Perrig, Dawn Song Carnegie Mellon University Presented by: Johnny Flowers.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
INSENS: Intrusion-Tolerant Routing For Wireless Sensor Networks By: Jing Deng, Richard Han, Shivakant Mishra Presented by: Daryl Lonnon.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
SafeQ: Secure and Efficient Query Processing in Sensor Networks Fei Chen and Alex X. Liu Department of Computer Science and Engineering Michigan State.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Privacy and Integrity Preserving in Distributed Systems Presented for Ph.D. Qualifying Examination Fei Chen Michigan State University August 25 th, 2009.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Effect of Intrusion Detection on Reliability Jin-Hee Cho, Member, IEEE, Ing-Ray Chen, Member, IEEE, and Phu-Gui Feng IEEE TRANSACTIONS ON RELIABILITY,
Cong Wang1, Qian Wang1, Kui Ren1 and Wenjing Lou2
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Guomin Yang et al. IEEE Transactions on Wireless Communication Vol. 6 No. 9 September
Secure Cell Relay Routing Protocol for Sensor Networks Xiaojiang Du, Fengiing Lin Department of Computer Science North Dakota State University 24th IEEE.
1 A Location-ID Sensitive Key Establishment Scheme in Static Wireless Sensor Networks Proceedings of the international conference on mobile technology,applications,and.
Aggregation in Sensor Networks
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
Shambhu Upadhyaya 1 Ad Hoc Networks Routing Security Shambhu Upadhyaya Wireless Network Security CSE 566 (Lecture 19)
Providing Transparent Security Services to Sensor Networks Hamed Soroush, Mastooreh Salajegheh and Tassos Dimitriou IEEE ICC 2007 Reporter :呂天龍 1.
Distributed Detection of Node Replication Attacks in Sensor Networks Bryan Parno, Adrian perrig, Virgil Gligor IEEE Symposium on Security and Privacy 2005.
WP4 deliverable Critical Infrastructure Protection: Attack Prevention Solutions and Attacks.
Group Rekeying for Filtering False Data in Sensor Networks: A Predistribution and Local Collaboration-Based Approach Wensheng Zhang and Guohong Cao.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Junfeng Xu, Keqiu Li, and Geyong Min IEEE Globecom 2010 Speak: Huei-Rung, Tsai Layered Multi-path Power Control in Underwater Sensor Networks.
Paper Review: On communication Security in Wireless Ad-Hoc Sensor Networks By Toni Farley.
Tufts Wireless Laboratory Tufts University School Of Engineering Real-Time Data Services for Cyber Physical Systems Zhong Zou.
Sensor Networks: privacy-preserving queries Nguyen Dinh Thuc University of Science, HCMC
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Collaborative Broadcasting and Compression in Cluster-based Wireless Sensor Networks Anh Tuan Hoang and Mehul Motani National University of Singapore Wireless.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Shambhu Upadhyaya 1 Sensor Networks – Hop- by-Hop Authentication Shambhu Upadhyaya Wireless Network Security CSE 566 (Lecture 22)
Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Privacy-Preserving and Content-Protecting Location Based Queries.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
Efficient Pairwise Key Establishment Scheme Based on Random Pre-Distribution Keys in Wireless Sensor Networks Source: Lecture Notes in Computer Science,
1 Authenticated Key Exchange Rocky K. C. Chang 20 March 2007.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
Security of the Internet of Things: perspectives and challenges
Computer Science Least Privilege and Privilege Deprivation: Towards Tolerating Mobile Sink Compromises in Wireless Sensor Network Presented by Jennifer.
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
Presented by Edith Ngai MPhil Term 3 Presentation
Introduction to Wireless Sensor Networks
Computing and Compressive Sensing in Wireless Sensor Networks
Location Cloaking for Location Safety Protection of Ad Hoc Networks
Net 435: Wireless sensor network (WSN)
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
Presentation transcript:

Taiming Feng, Chuang wang, Wensheng Zhang and Lu Ruan INFOCOM 2008 Presented by Mary Nader

Problem Wirless sensor network It’s goals: Improve resource efficiency Enhance security The two goals may not be achieved simultaneously and could even be sharply contrary to each other. A renowned example is the conflict between in- network data aggregation and data confidentiality (privacy) protection.

Related works Recently proposed two pioneering privacy-preserving data aggregation schemes ( INFOCOM th IEEE International Conference on Computer Communications. ) The cluster-based private data aggregation(CPDA) scheme Sensor nodes randomly form clusters, and sensor nodes within the same cluster collectively compute the aggregate value. Specifically, two rounds of interactions are required: first, each pair of sensor nodes in the same cluster exchange one data item derived from their own sensory data; second, each sensor node broadcasts, to other sensor nodes in the same cluster, another data item derived from the data it received in the previous round The slice-mix-aggregate (SMART)scheme Each sensor node only needs to exchange data for once with some nearest sensor nodes. Specifically, each sensor node slices its sensory data into a certain number (say, n) of pieces, and the pieces are then securely distributed to n − 1 nearest sensor nodes for aggregation.

Related works Both schemes can only tolerate up to a certain threshold number (i.e., the number of sensor nodes in a cluster minus two for CPDA, and the sum of outdegree and indegree minus one for SMART) of sensor node or communication link compromises. Although the threshold can be raised by expanding the size of cluster for CPDA or increasing the number of slices for SMART, it will result in higher communication overhead.

System Model propose a new series of schemesfor data confidentiality protection in additive data aggregation. Similar to the scheme proposed by Castelluccia “Efficient Aggregation of Encrypted Data in Wireless Sensor Networks,” Mobiquitous, July built on the following basic idea of Secret Perturbation (SP): the sink shares a secret with each sensor node respectively; when a sensor node has a sensory data item to report, it does not report the original data, but the sum of the original data and the secret shared with the sink. This way, each reported data item is a perturbed version of the original data item. The perturbed data can be transmitted without encryption because eavesdroppers or other sensor nodes do not know the secret used in the perturbation and thus cannot discover the original data.

System model propose a Fullyreporting SP-based (FSP) scheme each sensor nodeis required to report its perturbed sensory data to the sink; all data are aggregated as being forwarded; upon receiving the aggregated data, the sink can simply subtract the sum of secrets from it to obtain the aggregation of the original data. This scheme, however, may not be efficient if not all sensor nodes have data to report

Assuming that the sink knows the tree structure and the membership of each cluster (i.e., which nodes are in which clusters).

Security Assumptions and Design Goals only consider the attack where outsiders or compromised sensor nodes eavesdrop sensor data, reveal the data they receive/forward to the adversary. Future work: Aim to achieve Data privacy: The data produced by each sensor node should be only known to itself. Data confidentiality: In addition to data privacy, partially or fully aggregated data should only be known by the sink. Efficiency: After the confidentiality protection schemes are introduced, the system overhead should be kept as small as possible.

PROPOSED SECRET PERTURBATION-BASED SCHEMES Basic Idea of Secret Perturbation BSP: A Basic Secret Perturbation-based Scheme System initialization Sending query at the sink Response to a query at each node Data aggregation at each intermediate node Retrieving the sum of original data items at the sink FSP: A Fully-reporting Secret Perturbation based Scheme O-ASP: An Optimal Adaptive Secret Perturbation-based Scheme

Evaluation

our schemes D-ASP and O-ASP significantly outperform FSP in terms of bandwidth consumption and scalability under various simulation settings and in most cases our schemes are better than SMART. D-ASP performs almost as well as O-ASP while runs much faster than O-ASP. D-ASP is a practical solution to confidentiality protection for data aggregation in wireless sensor networks.

Summary First presented a basic schema which employs the basic principle of module operations to achieve data confidentially. Then, we proposed FSP, O-ASP and DASP to improve the communication performance. Extensive simulations have also been conducted to evaluate the proposed schemes. The results show that our schemes provide confidentiality protection for both raw and aggregated data items with an overhead lower than that of existing related schemes.

Questions?