2017
DOI: 10.1007/978-3-319-63579-8_38
|View full text |Cite
|
Sign up to set email alerts
|

SET: Secure and Efficient Top-k Query in Two-Tiered Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Tsou et al [7] constructed a layered authentication tree by an order-preserving symmetric encryption and used it to verify the completeness of query results. Zhang et al [12] designed a renormalized arithmetic coding method such that storage nodes can calculate exact top-k query results without knowing real values of data, and they proposed a verification scheme to detect compromised storage nodes. Peng et al [13] encoded top-k queries by threshold-based scheme and proposed a secure protocol that storage nodes can calculate query results over encrypted sensory data.…”
Section: Related Workmentioning
confidence: 99%
“…Tsou et al [7] constructed a layered authentication tree by an order-preserving symmetric encryption and used it to verify the completeness of query results. Zhang et al [12] designed a renormalized arithmetic coding method such that storage nodes can calculate exact top-k query results without knowing real values of data, and they proposed a verification scheme to detect compromised storage nodes. Peng et al [13] encoded top-k queries by threshold-based scheme and proposed a secure protocol that storage nodes can calculate query results over encrypted sensory data.…”
Section: Related Workmentioning
confidence: 99%