Over-Threshold Multiparty Private Set Intersection for Collaborative Network Intrusion Detection

• URL: http://arxiv.org/abs/2510.12045v1
• Date: Tue, 14 Oct 2025 00:58:58 GMT
• Title: Over-Threshold Multiparty Private Set Intersection for Collaborative Network Intrusion Detection
• Abstract summary: We present the privacy-preserving collection of IP addresses.<n>In this protocol $N$ participants identify the IP addresses that appear in at least $t$ participant's sets without revealing any information about other IP addresses.<n>We present two deployment options: a collusion-safe deployment, which provides stronger security guarantees at the cost of increased communication overhead, and a non-interactive deployment, which assumes a non-colluding collector but offers significantly lower communication costs.
• Score: 19.95270422828659
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: An important function of collaborative network intrusion detection is to analyze the network logs of the collaborators for joint IP addresses. However, sharing IP addresses in plain is sensitive and may be even subject to privacy legislation as it is personally identifiable information. In this paper, we present the privacy-preserving collection of IP addresses. We propose a single collector, over-threshold private set intersection protocol. In this protocol $N$ participants identify the IP addresses that appear in at least $t$ participant's sets without revealing any information about other IP addresses. Using a novel hashing scheme, we reduce the computational complexity of the previous state-of-the-art solution from $O(M(N \log{M}/t)^{2t})$ to $O(t^2M\binom{N}{t})$, where $M$ denotes the dataset size. This reduction makes it practically feasible to apply our protocol to real network logs. We test our protocol using joint networks logs of multiple institutions. Additionally, we present two deployment options: a collusion-safe deployment, which provides stronger security guarantees at the cost of increased communication overhead, and a non-interactive deployment, which assumes a non-colluding collector but offers significantly lower communication costs and applicable to many use cases of collaborative network intrusion detection similar to ours.

Related papers

• Differentially private quantum sensor networks [1.5006258585503878]
  We show that entangled quantum sensor networks are vulnerable to certain privacy-violating attacks.<n>We introduce secure sensing protocols endowed with differential privacy.<n>We prove that our protocols are resilient to attacks by broad classes of classical and quantum adversaries.
  arXiv  Detail & Related papers  (2026-07-07T17:27:30Z)
• Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms [67.94856074923571]
  This paper introduces a novel proof technique based on a multi-player communication game.<n>We show that winning this communication game requires transmitting information proportional to the number of over-active users.<n>We show that this communication-theoretic technique generalizes to broad classes of problems, yielding lower bounds for private medians, quantiles, and max-select.
  arXiv  Detail & Related papers  (2026-02-12T17:49:07Z)
• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [95.33295072401832]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• Privacy-Preserving Anonymization of System and Network Event Logs Using Salt-Based Hashing and Temporal Noise [5.85293491327449]
  Event logs contain Personally Identifiable Information (PII)<n>Overly aggressive anonymization can destroy contextual integrity, while weak techniques risk re-identification through linkage or inference attacks.<n>This paper introduces novel field-specific anonymization methods that address this trade-off.
  arXiv  Detail & Related papers  (2025-07-29T15:16:42Z)
• Multi-Party Private Set Intersection: A Circuit-Based Protocol with Jaccard Similarity for Secure and Efficient Anomaly Detection in Network Traffic [10.775721991076793]
  We present a new circuit-based protocol for multi-party private set intersection (PSI) With 7 parties, each possessing a set size of 212, our protocol completes in just 19 seconds.
  arXiv  Detail & Related papers  (2024-01-23T07:59:04Z)
• Preserving Node-level Privacy in Graph Neural Networks [8.939810456787173]
  We propose a solution that addresses the issue of node-level privacy in Graph Neural Networks (GNNs)<n>Our protocol consists of two main components: 1) a sampling routine called HeterPoisson, which employs a specialized node sampling strategy and a series of tailored operations to generate a batch of sub-graphs with desired properties, and 2) a randomization routine that utilizes symmetric Laplace noise instead of the commonly used Gaussian noise.<n>Our protocol enables GNN learning with good performance, as demonstrated by experiments on five real-world datasets.
  arXiv  Detail & Related papers  (2023-11-12T16:21:29Z)
• Differentially Private Computation of Basic Reproduction Numbers in Networked Epidemic Models [3.1966459264817875]
  We develop a framework to compute and release the reproduction number of a networked epidemic model in a differentially private way. We show that, under real-world conditions, we can compute $R_0$ in a differentially private way while incurring errors as low as $7.6%$ on average.
  arXiv  Detail & Related papers  (2023-09-29T14:38:02Z)
• Trustless Privacy-Preserving Data Aggregation on Ethereum with Hypercube Network Topology [0.0]
  We have proposed a scalable privacy-preserving data aggregation protocol for summation on the blockchain. The protocol consists of four stages as contract deployment, user registration, private submission and proof verification.
  arXiv  Detail & Related papers  (2023-08-29T12:51:26Z)
• Smooth Anonymity for Sparse Graphs [69.1048938123063]
  differential privacy has emerged as the gold standard of privacy, however, when it comes to sharing sparse datasets. In this work, we consider a variation of $k$-anonymity, which we call smooth-$k$-anonymity, and design simple large-scale algorithms that efficiently provide smooth-$k$-anonymity.
  arXiv  Detail & Related papers  (2022-07-13T17:09:25Z)
• More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR [61.13962963550403]
  A long line of research on secure computation has confirmed that anything that can be computed, can be computed securely using a set of non-colluding parties.<n>However, it remains highly susceptible to covert, undetectable collusion among computing parties.<n>This work stems from an observation that if the number of available computing parties is much higher than the number of parties required to perform a secure computation task, collusion attempts in privacy-preserving computations could be deterred.
  arXiv  Detail & Related papers  (2022-01-19T17:29:39Z)
• Specificity-preserving RGB-D Saliency Detection [103.3722116992476]
  We propose a specificity-preserving network (SP-Net) for RGB-D saliency detection. Two modality-specific networks and a shared learning network are adopted to generate individual and shared saliency maps. Experiments on six benchmark datasets demonstrate that our SP-Net outperforms other state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-08-18T14:14:22Z)
• Decoupled and Memory-Reinforced Networks: Towards Effective Feature Learning for One-Step Person Search [65.51181219410763]
  One-step methods have been developed to handle pedestrian detection and identification sub-tasks using a single network. There are two major challenges in the current one-step approaches. We propose a decoupled and memory-reinforced network (DMRNet) to overcome these problems.
  arXiv  Detail & Related papers  (2021-02-22T06:19:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.