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

DOI10.1007/S00446-011-0130-ZzbMath1231.68095OpenAlexW3137008996MaRDI QIDQ658674

Haifeng Yu

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.5872

zbMATH Keywords

sampling algorithmsaggregation queriessecure aggregation queriesset samplingtree sampling

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

The Cost of Fault Tolerance in Multi-Party Communication Complexity

Uses Software

• SPINS
• TAG

Cites Work

• Probabilistic counting algorithms for data base applications
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Ranked set sampling. Theory and applications
• Complexity measures and decision tree complexity: a survey.
• SPINS: Security protocols for sensor networks
• Decision trees with Boolean threshold queries
• Simple proofs of occupancy tail bounds
• Tail bounds for occupancy and the satisfiability threshold conjecture
• An Optimal Algorithm for Monte Carlo Estimation
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Probability and Computing

This page was built for publication: Secure and highly-available aggregation queries in large-scale sensor networks via set sampling