Secure Distributed Data Aggregation
Seiten
2011
now publishers Inc (Verlag)
978-1-60198-450-0 (ISBN)
now publishers Inc (Verlag)
978-1-60198-450-0 (ISBN)
Surveys the various families of approaches to secure aggregation in distributed networks such as sensor networks. In its selection of covered literature, this book sets out to provide the reader with a general intuitive understanding of the field, rather than to bring the reader exhaustively up to date with all algorithms for the area.
Secure Distributed Data Aggregation surveys the various families of approaches to secure aggregation in distributed networks such as sensor networks. It focuses on the important algorithmic features of each approach, and provides an overview of a family of secure aggregation protocols which use resilient distributed estimation to retrieve an approximate query result that is guaranteed to be resistant against malicious tampering. It then covers a second family, the commitment-based techniques, in which the query result is exact but the chance of detecting malicious computation tampering is probabilistic. Finally, it describes a hash-tree based approach that can both give an exact query result and is fully resistant against malicious computation tampering.
In its selection of covered literature, this book sets out to provide the reader with a general intuitive understanding of the field, rather than to bring the reader exhaustively up to date with all algorithms for the area. It adopts a tutorial approach, selecting the publications that most clearly exemplify a certain class of approaches (or which have been most influential historically), rather than focusing on breadth or depth of coverage in terms of the most effective or the most recent algorithms.
Secure Distributed Data Aggregation surveys the various families of approaches to secure aggregation in distributed networks such as sensor networks. It focuses on the important algorithmic features of each approach, and provides an overview of a family of secure aggregation protocols which use resilient distributed estimation to retrieve an approximate query result that is guaranteed to be resistant against malicious tampering. It then covers a second family, the commitment-based techniques, in which the query result is exact but the chance of detecting malicious computation tampering is probabilistic. Finally, it describes a hash-tree based approach that can both give an exact query result and is fully resistant against malicious computation tampering.
In its selection of covered literature, this book sets out to provide the reader with a general intuitive understanding of the field, rather than to bring the reader exhaustively up to date with all algorithms for the area. It adopts a tutorial approach, selecting the publications that most clearly exemplify a certain class of approaches (or which have been most influential historically), rather than focusing on breadth or depth of coverage in terms of the most effective or the most recent algorithms.
1: Introduction 2: Problem Definition 3: Early Work on Secure Aggregation 4: Resilient Estimation 5: Commitment-based Techniques. References
| Erscheint lt. Verlag | 30.6.2011 |
|---|---|
| Reihe/Serie | Foundations and Trends® in Databases |
| Verlagsort | Hanover |
| Sprache | englisch |
| Maße | 156 x 234 mm |
| Gewicht | 105 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Datenbanken |
| Informatik ► Netzwerke ► Sicherheit / Firewall | |
| Informatik ► Office Programme ► Outlook | |
| Mathematik / Informatik ► Informatik ► Software Entwicklung | |
| ISBN-10 | 1-60198-450-2 / 1601984502 |
| ISBN-13 | 978-1-60198-450-0 / 9781601984500 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Management der Informationssicherheit und Vorbereitung auf die …
Buch (2024)
Carl Hanser (Verlag)
CHF 97,95
