Integrity Checking for Aggregate Queries

With the advent of cloud computing and Internet of Things and delegation of data collection and aggregation to third parties, the results of the computations should be verified. In distributed models, there are multiple sources. Each source creates authenticators for the values and sends them to the aggregator. The aggregator combines the authenticated values and creates a verification object for verifying the computation/aggregation results. In this paper, we propose two constructions for verifying the results of countable and window-based countable functions. These constructions are useful for aggregate functions such as median, max/min, top-k/first-k, and range queries, where the distribution of values is not visible for sources but is visible to the aggregator. The proposed constructions are secure based on the RSA problem in the random oracle model and have the correctness and succinctness properties. Experimental results show that the communication and computation costs of the constructions are acceptable in practice and the proposed solution can be employed for real-world applications.