Ieee Infocom 2009 2009
DOI: 10.1109/infcom.2009.5062004
|View full text |Cite
|
Sign up to set email alerts
|

ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query

Abstract: Abstract-With in-network sensor data storage and query, storage nodes are responsible for storing the data collected by sensor nodes and answering queries from users. Thus, without proper protection for data types and user queries, compromise of storage nodes and/or sensor nodes may reveal sensitive information about the sensed environment as well as users' private interests and query patterns. In this paper, we explore trade-offs between privacy, computation overhead, communication overhead, network flexibili… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…As a note, the purposes of collusion users are to obtain more data with the key. By comparing with directly capturing node and intercepting attacks, collusion can save overhead and is hard to be detected [16]. As shown in Figure 6, three schemes have almost the same abilities against attacks when there are few collusion users.…”
Section: Experiments and Analysismentioning
confidence: 99%
“…As a note, the purposes of collusion users are to obtain more data with the key. By comparing with directly capturing node and intercepting attacks, collusion can save overhead and is hard to be detected [16]. As shown in Figure 6, three schemes have almost the same abilities against attacks when there are few collusion users.…”
Section: Experiments and Analysismentioning
confidence: 99%
“…Privacy-preserving algorithms have been developed for data mining [14][15][16][17], data aggregation [4,[18][19][20][21][22], and other applications [23,24]. There are four main classes of solutions: perturbation, k-anonymity, secure multi-party computation, and homomorphic encryption.…”
Section: Related Workmentioning
confidence: 99%
“…A few related works [13][14][15][16][17][18] regarding secure distributed data storage and query can be found in the literature, but none of them satisfies the overall requirements of data confidentiality, dependability, integrity, and efficiency. The work in [13] designed an adaptive polynomial-based data storage scheme for efficient data management.…”
Section: Related Workmentioning
confidence: 99%
“…However, it cannot deal with collusive attacks and pollution attacks by compromised sensor nodes. In , the author proposed an elliptic curve based privacy scheme by introducing the concept of ‘anonymizer’, which has been used for Internet applications. It hides the untrustworthy data sources from the storage nodes under the collusive attacks of sensor nodes, storage nodes, and anonymizers.…”
Section: Related Workmentioning
confidence: 99%