Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-8374
|Main Title:||P2KMV: A Privacy-preserving Counting Sketch for Efficient and Accurate Set Intersection Cardinality Estimations|
|Abstract:||In this paper, we propose P2KMV, a novel privacy-preserving counting sketch, based on the k minimum values algorithm. With P2KMV, we offer a versatile privacy-enhanced technology for obtaining statistics, following the principle of data minimization, and aiming for the sweet spot between privacy, accuracy, and computational efficiency. As our main contribution, we develop methods to perform set operations, which facilitate cardinality estimates under strong privacy requirements. Most notably, we propose an efficient, privacy-preserving algorithm to estimate the set intersection cardinality. P2KMV provides plausible deniability for all data items contained in the sketch. We discuss the algorithm's privacy guarantees as well as the accuracy of the obtained estimates. An experimental evaluation confirms our analytical expectations and provides insights regarding parameter choices.|
|DDC Class:||004 Datenverarbeitung; Informatik|
|Series:||Cryptology ePrint Archive|
|Appears in Collections:||FG Distributed Security Infrastructures (DSI) » Publications|
Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.