Secure and highly-available aggregation queries in large-scale sensor networks via set sampling

Wireless sensor networks are often queried for aggregates such as predicate count, sum, and average. In untrusted environments, sensors may potentially be compromised. Existing approaches for securely answering aggregation queries in untrusted sensor networks can detect whether the aggregation resul...

Full description

Saved in:
Bibliographic Details
Published in:2009 International Conference on Information Processing in Sensor Networks pp. 1 - 12
Main Author: Haifeng Yu
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 13.04.2009
IEEE
Series:ACM Conferences
Subjects:
ISBN:1424451086, 9781424451081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Wireless sensor networks are often queried for aggregates such as predicate count, sum, and average. In untrusted environments, sensors may potentially be compromised. Existing approaches for securely answering aggregation queries in untrusted sensor networks can detect whether the aggregation result is corrupted by an attacker. However, the attacker (controlling the compromised sensors) can keep corrupting the result, rendering the system unavailable. This paper aims to enable aggregation queries to tolerate instead of just detecting the adversary. To this end, we propose a novel tree sampling algorithm that directly uses sampling to answer aggregation queries. It leverages a novel set sampling technique to overcome a key and well-known obstacle in sampling — traditional sampling technique is only effective when the predicate count or sum is large. Set sampling can efficiently sample a set of sensors together, and determine whether any sensor in the set satisfies the predicate (but not how many). With set sampling as a building block, tree sampling can provably generate a correct answer despite adversarial interference, while without the drawbacks of traditional sampling techniques.
AbstractList Wireless sensor networks are often queried for aggregates such as predicate count, sum, and average. In untrusted environments, sensors may potentially be compromised. Existing approaches for securely answering aggregation queries in untrusted sensor networks can detect whether the aggregation result is corrupted by an attacker. However, the attacker (controlling the compromised sensors) can keep corrupting the result, rendering the system unavailable. This paper aims to enable aggregation queries to tolerate instead of just detecting the adversary. To this end, we propose a novel tree sampling algorithm that directly uses sampling to answer aggregation queries. It leverages a novel set sampling technique to overcome a key and well-known obstacle in sampling - traditional sampling technique is only effective when the predicate count or sum is large. Set sampling can efficiently sample a set of sensors together, and determine whether any sensor in the set satisfies the predicate (but not how many). With set sampling as a building block, tree sampling can provably generate a correct answer despite adversarial interference, while without the drawbacks of traditional sampling techniques.
Author Haifeng Yu
Author_xml – sequence: 1
  surname: Haifeng Yu
  fullname: Haifeng Yu
  organization: National University of Singapore, Singapore
BookMark eNqNUD1PwzAUNAIkaOnMwOKRJcF27MQeUcWXVIkBmK3nxElNU6fYaVH_Pa7aH8Atp3f37kn3JujCD94idEtJLhIeaEkYLUV-ZHmGZqqSaRBCFhUtz9GEcsa5oESWV2gW4zdJ4IJVFblG-sPW22Ax-AYvXbfs9xnswPVg-iR2XbAdjG7w-Gdrg7MRO497CJ3NYg1pJVofh4C9HX-HsIp45yBpI46w3vTOdzfosoU-2tmJp-jr-elz_pot3l_e5o-LDGjJxowDMbziih46lKylola8aZqiUVRwI2yjWmNAspYoVhAhK8Ja00ohgciakmKK7o53nbVWb4JbQ9hrwShVXCQ3P7pQr7UZhlXUlOjD-_TpfSeW2qSWbQrc_zNQ_AEmt29m
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.5555/1602165.1602168
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781605583716
1605583715
EndPage 12
ExternalDocumentID 5211945
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IERZE
OCL
RIE
RIL
AAWTH
LHSKQ
ID FETCH-LOGICAL-a162t-4a0b47491021662f15c94ddd3d9154b5ed9fbba82f0923058702fbf858a08c103
IEDL.DBID RIE
ISBN 1424451086
9781424451081
IngestDate Wed Aug 27 02:15:31 EDT 2025
Wed Jan 31 06:36:53 EST 2024
Wed Jan 31 06:36:52 EST 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a162t-4a0b47491021662f15c94ddd3d9154b5ed9fbba82f0923058702fbf858a08c103
PageCount 12
ParticipantIDs acm_books_10_5555_1602165_1602168_brief
acm_books_10_5555_1602165_1602168
ieee_primary_5211945
PublicationCentury 2000
PublicationDate 20090413
2009-April
PublicationDateYYYYMMDD 2009-04-13
2009-04-01
PublicationDate_xml – month: 04
  year: 2009
  text: 20090413
  day: 13
PublicationDecade 2000
PublicationPlace Washington, DC, USA
PublicationPlace_xml – name: Washington, DC, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle 2009 International Conference on Information Processing in Sensor Networks
PublicationTitleAbbrev IPSN
PublicationYear 2009
Publisher IEEE Computer Society
IEEE
Publisher_xml – name: IEEE Computer Society
– name: IEEE
SSID ssj0000452770
Score 1.5155126
Snippet Wireless sensor networks are often queried for aggregates such as predicate count, sum, and average. In untrusted environments, sensors may potentially be...
SourceID ieee
acm
SourceType Publisher
StartPage 1
SubjectTerms Aggregates
Base stations
Computer security
Computer systems organization -- Architectures -- Distributed architectures
Information systems -- Data management systems -- Database management system engines -- Database query processing
Information systems -- Data management systems -- Database management system engines -- Parallel and distributed DBMSs
Interference
Large-scale systems
Mathematics of computing -- Probability and statistics -- Statistical paradigms
Mathematics of computing -- Probability and statistics -- Statistical paradigms -- Statistical graphics
Networks -- Network types -- Mobile networks
Networks -- Network types -- Wireless access networks
Protocols
Sampling methods
Security and privacy -- Database and storage security
Sensor phenomena and characterization
Sensor systems
Theory of computation -- Theory and algorithms for application domains -- Database theory -- Database query processing and optimization (theory)
Theory of computation -- Theory and algorithms for application domains -- Database theory -- Theory of database privacy and security
Wireless sensor networks
Title Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
URI https://ieeexplore.ieee.org/document/5211945
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH_o8KAXP6Y4v4ggeLGaZEmTnsXhQcSDgreSr47B7GTdBv73vrTdVBDEXtKGHpqXlJffy_v9HsCF8gJBBUOkahxHgOJYYrn0SWF4qmNtBydrovCDenzUr6_Z0xpcrbgwIYQ6-Sxcx9v6LN9P3DyGym5klCMTch3WlUobrtYqnhKlwZWiS-6WjBWElpJO7TNrpH0kXjcsReeWyuumrXVW3duPCiu1gxls_-_TdmD_i6lHnlY-aBfWQrkHW99EBruQ1yH1QEzpSRQnHn8kZmFG48iZImaIeHtYzw5BDxFxMxmVZBzzw5MK5y-QCoHuZErKJl-8IouRwb4ZqUxMRi-H-_AyuHu-vU_asgqJYSmfJcJQK5TIYlHvNOUFky4T3vu-z3A_ZWXwWWGt0byguPujEv9oXthCS22odoz2D6BTTspwCESYkFEaGOchFbgctHBWqSIz3lgWtOvBOZo1j3ihyhFuRNPnrenbVvfg8s93covjL3rQjYbP3xsdjry1-dHv3cewuTz5oewEOrPpPJzChlvMRtX0rF48n6olvJc
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7oFNQX7zivEQRfrEti0qbP4lCcwwcF30puHYPZyToH_ntPum4qCGJf0oY-NCcpJ9_JOd8HcJY4gaCCIVLVliNAsSwyXLoo1zxWQdvByqpQuJN0u-rlJX1cgIt5LYz3vko-85fhtjrLd0P7HkJlLRnoyIRchKWgnFVXa80jKoEcPEnorHpLBg2hGalT_cym5D4SrxaL0b3F8nLaVkyr9vWHxkrlYtrr__u4Ddj5qtUjj3MvtAkLvtiCtW80g9uQVUF1T3ThSKAnHnxEeqL7g1A1RXQPEXevmh-CPiIgZ9IvyCBkiEclzqAnJULd4YgU04zxkkz6GvvGpNQhHb3o7cBz--bp-jaqhRUizWI-joSmRiQiDbLeccxzJm0qnHNXLsUdlZHepbkxWvGc4v6PSvyneW5yJZWmyjJ6tQuNYlj4PSBC-5RSzzj3scAFoYQ1SZKn2mnDvLJNOEWzZgExlBkCjmD6rDZ93aomnP_5TmZw_HkTtoPhs7cpE0dW23z_9-4TWLl9euhknbvu_QGszs6BKDuExnj07o9g2U7G_XJ0XC2kT6-7v-A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+International+Conference+on+Information+Processing+in+Sensor+Networks&rft.atitle=Secure+and+highly-available+aggregation+queries+in+large-scale+sensor+networks+via+set+sampling&rft.au=Haifeng+Yu&rft.date=2009-04-01&rft.pub=IEEE&rft.isbn=9781424451081&rft.spage=1&rft.epage=12&rft_id=info:doi/10.5555%2F1602165.1602168&rft.externalDocID=5211945
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424451081/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424451081/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424451081/sc.gif&client=summon&freeimage=true