Secure server-aided top-k monitoring

Abstract In a data streaming model, a data owner releases records or documents to a set of users with matching interests, in such a way that the match in interest can be calculated from the correlation between each pair of document and user query. For scalability and availability reasons, this calculation is delegated to third-party servers, which gives rise to the need to protect the integrity and privacy of the documents and user queries. In this paper, we propose a server-aided data stream monitoring scheme ( DSM ) to address the aforementioned integrity and privacy challenges, so that the users are able to verify the correlation scores obtained from the server. The scheme provides strong security protection, even in the event of collusion between the server and other users. We also offer techniques to bound the computation demand in decoding the correlation scores, and we demonstrate the practicality of the scheme through experiments with real data.

[1]  Philippe Golle,et al.  Authenticating Streamed Data in the Presence of Random Packet Loss , 2001, NDSS.

[2]  Jonathan Katz,et al.  Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products , 2008, Journal of Cryptology.

[3]  Ran Canetti,et al.  Efficient authentication and signing of multicast streams over lossy channels , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

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

[5]  Rakesh Agrawal,et al.  Privacy-preserving data mining , 2000, SIGMOD 2000.

[6]  Xuhua Ding,et al.  Verifiable and private top-k monitoring , 2013, ASIA CCS '13.

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

[8]  Rafail Ostrovsky,et al.  Private Searching on Streaming Data , 2005, Journal of Cryptology.

[9]  Yuan Zhou,et al.  Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations , 2016, ACISP.

[10]  Ihab F. Ilyas,et al.  A survey of top-k query processing techniques in relational database systems , 2008, CSUR.

[11]  Elaine Shi,et al.  Predicate Privacy in Encryption Systems , 2009, IACR Cryptol. ePrint Arch..

[12]  Jian Pei,et al.  Privacy-Preserving Data Stream Classification , 2008, Privacy-Preserving Data Mining.

[13]  Charu C. Aggarwal,et al.  On Randomization, Public Information and the Curse of Dimensionality , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[14]  Bart Goethals,et al.  On Private Scalar Product Computation for Privacy-Preserving Data Mining , 2004, ICISC.

[15]  Jörg Meier,et al.  Towards a Secure Data Stream Management System , 2005, TEAA.

[16]  William E. Burr,et al.  Recommendation for Key Management, Part 1: General (Revision 3) , 2006 .

[17]  Reihaneh Safavi-Naini,et al.  Batch Verifiable Computation of Polynomials on Outsourced Data , 2015, ESORICS.

[18]  Yin Yang,et al.  CADS: Continuous Authentication on Data Streams , 2007, VLDB.

[19]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[20]  Suman Nath,et al.  Secure outsourced aggregation via one-way chains , 2009, SIGMOD Conference.

[21]  Brent Waters,et al.  New constructions and practical applications for private stream searching , 2006, 2006 IEEE Symposium on Security and Privacy (S&P'06).