Information security events aggregation with multi party privacy preserving

Over the past several years a lot of research has focused on privacy preserving of data. In this work we are interested in the following privacy-preserving problem in the domain of information security. A set of parties hold private lists of information security events and want to find and disclose the top-k security events without revealing any other information. We use secure homomorphic encryption techniques to solve this problem and design protocols, analyzing their efficiency.