Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
type: Item
instance of: scholarly article
title: Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
zbMATH Open document ID: 1231.68095
author: Haifeng Yu
published in: Distributed Computing
publication date: 2012-02-06T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6003851
zbMATH Keywords: aggregation queries
zbMATH Keywords: secure aggregation queries
zbMATH Keywords: sampling algorithms
zbMATH Keywords: set sampling
zbMATH Keywords: tree sampling
describes a project that uses: SPINS
describes a project that uses: TAG
MaRDI profile type: Publication
OpenAlex ID: W3137008996
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Decision trees with Boolean threshold queries
cites work: Complexity measures and decision tree complexity: a survey.
cites work: Ranked set sampling. Theory and applications
cites work: An Optimal Algorithm for Monte Carlo Estimation
cites work: Simple proofs of occupancy tail bounds
cites work: Probabilistic counting algorithms for data base applications
cites work: Cryptographic Hardware and Embedded Systems - CHES 2004
cites work: Tail bounds for occupancy and the satisfiability threshold conjecture
cites work: Probability and Computing
cites work: SPINS: Security protocols for sensor networks
DOI: 10.1007/S00446-011-0130-Z
Recommended article: DoS-resilient secure aggregation queries in sensor networks
Recommended article: A note on efficient aggregate queries in sensor networks
description: scientific article; zbMATH DE number 6003851