Abstract
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.
Highlights
Data aggregation is the process of gathering data and extracting statistical information from them in a summary form
Data aggregation is widely used in various applications including network traffic analysis, wireless sensor networks (WSNs), Internet of Things (IoT), and data stream management systems (DSMSs)
RELATED WORK There are some research trends concentrated on the verification of computations such as (1) verifiable computations, (2) homomorphic authenticators and (3) methods proposed for verifying the results in specific applications such as outsourced database management system (DBMS), data stream management system (DSMS), wireless sensor network (WSN), and Internet of Things (IoT)
Summary
Data aggregation is the process of gathering data and extracting statistical information from them in a summary form. In this paper, we propose a solution for checking the integrity of the range and aggregate queries in a system with distributed sources. We use a RSA-based homomorphic authenticator to authenticate the result of linear functions, statistical aggregates, and range queries on data collected from distributed sources. To the best of our knowledge, there is not any solution for verifying statistical aggregate queries such as max/min, top-k/first-k, range, and median in DSMSs with more than one source node In these queries, the output of the query is a subset of the input values and the order of the input values, in computing the output, is important. We propose the first scheme for verifying all countable aggregate queries, especially the median (needs to verify the distribution of all input values) in DSMSs in a multi-source model with different data owners.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
