Institutional Repository
Technical University of Crete
EN  |  EL



My Space

Proof sketches: verifiable in-network aggregation

Garofalakis Minos, Hellerstein Joseph M., Maniatis Petros

Simple record

Extent10 pagesen
TitleProof sketches: verifiable in-network aggregationen
CreatorGarofalakis Minosen
CreatorΓαροφαλακης Μινωςel
CreatorHellerstein Joseph M.en
CreatorManiatis Petrosen
PublisherInstitute of Electrical and Electronics Engineersen
Content SummaryRecent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In this paper we present a first step towards verifiable yet efficient distributed, in-network aggregation in adversarial settings. We describe a general framework and threat model for the problem and then present proof sketches, a compact verification mechanism that combines cryptographic signatures and Flajolet-Martin sketches to guarantee acceptable aggregation error bounds with high probability. We derive proof sketches for count aggregates and extend them for random sampling, which can be used to provide verifiable approximations for a broad class of dataanalysis queries, e.g., quantiles and heavy hitters. Finally, we evaluate the practical use of proof sketches, and observe that adversaries can often be reduced to much smaller violations in practice than our worst-case bounds suggest.en
Type of ItemΠλήρης Δημοσίευση σε Συνέδριοel
Type of ItemConference Full Paperen
Date of Item2015-11-30-
Date of Publication2007-
SubjectData engineeringen
SubjectDatabases managementen
Bibliographic CitationM. Garofalakis, J. M. Hellerstein and P. Maniatis, "Proof sketches: verifiable in-network aggregation", in IEEE 23rd International Conference on Data Engineering, 2007, pp. 996-1005. doi: 10.1109/ICDE.2007.368958 en