Practical fault-tolerant data aggregation

DOI10.1007/978-3-319-39555-5_21zbMATH Open1346.68037arXiv1602.04138OpenAlexW2270845606MaRDI QIDQ2822685FDOQ2822685

Authors: Krzysztof Grining, Marek Klonowski, Piotr Syga 

Publication date: 4 October 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Abstract: During Financial Cryptography 2012 Chan et al. presented a novel privacy-protection fault-tolerant data aggregation protocol. Comparing to previous work, their scheme guaranteed provable privacy of individuals and could work even if some number of users refused to participate. In our paper we demonstrate that despite its merits, their method provides unacceptably low accuracy of aggregated data for a wide range of assumed parameters and cannot be used in majority of real-life systems. To show this we use both precise analytic and experimental methods. Additionally, we present a precise data aggregation protocol that provides provable level of security even facing massive failures of nodes. Moreover, the protocol requires significantly less computation (limited exploiting of heavy cryptography) than most of currently known fault tolerant aggregation protocols and offers better security guarantees that make it suitable for systems of limited resources (including sensor networks). To obtain our result we relax however the model and allow some limited communication between the nodes.

Full work available at URL: https://arxiv.org/abs/1602.04138

Recommendations

• Privacy-Preserving Stream Aggregation with Fault Tolerance
• Secure distributed data aggregation
• Privacy-preserving data aggregation with probabilistic range validation
• Private over-threshold aggregation protocols
• A distributed protocol for privacy preserving aggregation with non-permanent participants

zbMATH Keywords

fault tolerancedifferential privacydata aggregation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)

Cites Work

• Theory of Cryptography
• Optimal lower bound for differentially private multi-party aggregation
• Secret-Sharing Schemes: A Survey
• Computational Differential Privacy
• Definitions and properties of zero-knowledge proof systems
• Negotiation-based protocols for disseminating information in wireless sensor networks
• Title not available (Why is that?)
• Topics in Cryptology – CT-RSA 2004
• Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
• Characteristic function of the positive part of a random variable and related results, with applications
• Privacy-Preserving Stream Aggregation with Fault Tolerance
• Practical fault-tolerant data aggregation

Cited In (6)

• Secure distributed data aggregation
• Private over-threshold aggregation protocols
• Privacy-preserving data aggregation with probabilistic range validation
• Fault-tolerant aggregation: flow-updating meets mass-distribution
• Practical fault-tolerant data aggregation
• A novel fault-tolerant privacy-preserving cloud-based data aggregation scheme for lightweight health data

Uses Software

• TAG

This page was built for publication: Practical fault-tolerant data aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822685)