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.

[1]  Craig Gentry,et al.  Pinocchio: Nearly Practical Verifiable Computation , 2013, 2013 IEEE Symposium on Security and Privacy.

[2]  Rob Johnson,et al.  Homomorphic Signatures for Digital Photographs , 2011, Financial Cryptography.

[3]  Dan Boneh,et al.  Preventing Pollution Attacks in Multi-Source Network Coding , 2010, IACR Cryptol. ePrint Arch..

[4]  Kyriakos Mouratidis,et al.  Scalable Verification for Outsourced Dynamic Databases , 2009, Proc. VLDB Endow..

[5]  Craig Gentry,et al.  Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.

[6]  D. Jackson.  Note on the median of a set of numbers , 1921 .

[7]  Feifei Li,et al.  Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams , 2007, VLDB.

[8]  Wenjing Lou,et al.  Tell me the truth: Practically public authentication for outsourced databases with multi-user modification , 2017, Inf. Sci..

[9]  Dan Boneh,et al.  Homomorphic Signatures for Polynomial Functions , 2011, EUROCRYPT.

[10]  Hakan Hacigümüs,et al.  Executing SQL over encrypted data in the database-service-provider model , 2002, SIGMOD '02.

[11]  Benjamin Braun,et al.  Verifying computations with state , 2013, IACR Cryptol. ePrint Arch..

[12]  Marcelo Dias de Amorim,et al.  Securing wireless sensor networks against aggregator compromises , 2008, IEEE Communications Magazine.

[13]  Dan Boneh,et al.  Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures , 2011, Public Key Cryptography.

[14]  Sherman S. M. Chow,et al.  Multi-key Homomorphic Signatures Unforgeable Under Insider Corruption , 2018, ASIACRYPT.

[15]  Michael Backes,et al.  Verifiable delegation of computation on outsourced data , 2013, CCS.

[16]  Daniel Wichs,et al.  Leveled Fully Homomorphic Signatures from Standard Lattices , 2015, IACR Cryptol. ePrint Arch..

[17]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[18]  Feifei Li,et al.  Small synopses for group-by query verification on outsourced data streams , 2009, TODS.

[19]  Aikaterini Mitrokotsa,et al.  Multi-key Homomorphic Authenticators , 2016, ASIACRYPT.

[20]  Chun-Shien Lu,et al.  SER: Secure and efficient retrieval for anonymous range query in wireless sensor networks , 2017, Comput. Commun..

[21]  Michael Gertz,et al.  Authentic Data Publication Over the Internet , 2003, J. Comput. Secur..

[22]  Stavros Papadopoulos,et al.  Lightweight authentication of linear algebraic queries on data streams , 2013, SIGMOD '13.

[23]  Yael Tauman Kalai,et al.  Delegating RAM Computations , 2016, TCC.

[24]  Jon Howell,et al.  Geppetto: Versatile Verifiable Computation , 2015, 2015 IEEE Symposium on Security and Privacy.

[25]  Rolf Haenni,et al.  A Lightweight Implementation of a Shuffle Proof for Electronic Voting Systems , 2014, GI-Jahrestagung.

[26]  Xuemin Shen,et al.  An Efficient Merkle-Tree-Based Authentication Scheme for Smart Grid , 2014, IEEE Systems Journal.

[27]  Joseph M. Hellerstein,et al.  Proof Sketches: Verifiable In-Network Aggregation , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[28]  Bogdan Warinschi,et al.  Efficient Network Coding Signatures in the Standard Model , 2012, Public Key Cryptography.

[29]  Rafail Ostrovsky,et al.  Efficient Arguments without Short PCPs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[30]  Naixue Xiong,et al.  Privacy-preserving max/min query in two-tiered wireless sensor networks , 2013, Comput. Math. Appl..

[31]  Lingxuan Hu,et al.  Secure aggregation for wireless networks , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[32]  Wenjing Lou,et al.  Publicly Verifiable Inner Product Evaluation over Outsourced Data Streams under Multiple Keys , 2017, IEEE Transactions on Services Computing.

[33]  Suman Nath,et al.  Publicly verifiable grouped aggregation queries on outsourced data streams , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[34]  Xu An Wang,et al.  Improved publicly verifiable group sum evaluation over outsourced data streams in IoT setting , 2018, Computing.

[35]  Dawn Xiaodong Song,et al.  SIA: secure information aggregation in sensor networks , 2003, SenSys '03.

[36]  Jonathan Katz,et al.  Secure Network Coding Over the Integers , 2010, IACR Cryptol. ePrint Arch..

[37]  Erol Gelenbe,et al.  Top-$k$ Query Result Completeness Verification in Tiered Sensor Networks , 2014, IEEE Transactions on Information Forensics and Security.

[38]  Yunghsiang Sam Han,et al.  A witness-based approach for data fusion assurance in wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[39]  Ron Kohavi,et al.  Supervised and Unsupervised Discretization of Continuous Features , 1995, ICML.

[40]  Gene Tsudik,et al.  Authentication of Outsourced Databases Using Signature Aggregation and Chaining , 2006, DASFAA.

[41]  Michael T. Goodrich,et al.  Super-Efficient Verification of Dynamic Outsourced Databases , 2008, CT-RSA.

[42]  Lucas Schabhüser,et al.  Context Hiding Multi-Key Linearly Homomorphic Authenticators , 2018, IACR Cryptol. ePrint Arch..

[43]  Jonathan Katz,et al.  Signing a Linear Subspace: Signature Schemes for Network Coding , 2009, IACR Cryptol. ePrint Arch..

[44]  Bogdan Warinschi,et al.  Homomorphic Signatures with Efficient Verification for Polynomial Functions , 2014, CRYPTO.

[45]  Rosario Gennaro,et al.  Fully Homomorphic Message Authenticators , 2013, IACR Cryptol. ePrint Arch..