Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF

• URL: http://arxiv.org/abs/2506.00566v1
• Date: Sat, 31 May 2025 13:50:40 GMT
• Title: Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF
• Authors: Xinyu Feng, Yukun Wang, Cong Li, Wu Xin, Ming Yao, Dian Zhang, Wanwan Wang, Hao He,
• Abstract summary: Multiparty private set intersection (MPSI) allows multiple participants to compute the intersection of their locally owned data sets without revealing them.<n>Most existing MPSI protocols are based on the star, mesh, and ring topologies.<n>We develop an MPSI protocol with a ring topology, addressing the challenges of communication and computational overhead.
• Score: 11.846509777720415
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multiparty private set intersection (MPSI) allows multiple participants to compute the intersection of their locally owned data sets without revealing them. MPSI protocols can be categorized based on the network topology of nodes, with the star, mesh, and ring topologies being the primary types, respectively. Given that star and mesh topologies dominate current implementations, most existing MPSI protocols are based on these two topologies. However, star-topology MPSI protocols suffer from high leader node load, while mesh topology protocols suffer from high communication complexity and overhead. In this paper, we first propose a multi-point sequential oblivious pseudorandom function (MP-SOPRF) in a multi-party setting. Based on MP-SOPRF, we then develop an MPSI protocol with a ring topology, addressing the challenges of communication and computational overhead in existing protocols. We prove that our MPSI protocol is semi-honest secure under the Hamming correlation robustness assumption. Our experiments demonstrate that our MPSI protocol outperforms state-of-the-art protocols, achieving a reduction of 74.8% in communication and a 6% to 287% improvement in computational efficiency.

Related papers

• Automatic State Machine Inference for Binary Protocol Reverse Engineering [20.35198277628804]
  We propose an automatic PSM inference framework for unknown protocols.<n>We refine a probabilistic PSM algorithm to infer protocol states and the transition conditions between these states.<n> Experimental results show that, compared with existing PRE techniques, our method can infer PSMs while enabling more precise classification of protocols.
  arXiv  Detail & Related papers  (2024-12-03T16:33:17Z)
• Secure and Scalable Circuit-based Protocol for Multi-Party Private Set Intersection [4.946124980718068]
  Circuit-based approach has advantages over using custom protocols to achieve this task. By using secure computation between two parties, our protocol sidesteps the complexities associated with multi-party interactions. In order to mitigate the high overhead associated with circuit-based constructions, we have further enhanced our protocol by utilizing simple hashing scheme and permutation-based hash functions.
  arXiv  Detail & Related papers  (2023-09-14T03:20:33Z)
• Task-dependent semi-quantum secure communication in layered networks with OAM states of light [0.0]
  We present two protocols for secure communication in layered networks. First protocol allows sharing of two keys simultaneously in a network of two layers. Second protocol facilitates direct communication in one layer and key distribution in the other.
  arXiv  Detail & Related papers  (2023-06-20T17:57:00Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Multiparty Entanglement Routing in Quantum Networks [0.0]
  A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks. The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
  arXiv  Detail & Related papers  (2022-11-12T15:40:34Z)
• ScionFL: Efficient and Robust Secure Quantized Aggregation [36.668162197302365]
  We introduce ScionFL, the first secure aggregation framework for federated learning. It operates efficiently on quantized inputs and simultaneously provides robustness against malicious clients. We show that with no overhead for clients and moderate overhead for the server, we obtain comparable accuracy for standard FL benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T21:46:55Z)
• Towards Semantic Communication Protocols: A Probabilistic Logic Perspective [69.68769942563812]
  We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog) By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
  arXiv  Detail & Related papers  (2022-07-08T14:19:36Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Reinforcement learning-enhanced protocols for coherent population-transfer in three-level quantum systems [50.591267188664666]
  We deploy a combination of reinforcement learning-based approaches and more traditional optimization techniques to identify optimal protocols for population transfer. Our approach is able to explore the space of possible control protocols to reveal the existence of efficient protocols. The new protocols that we identify are robust against both energy losses and dephasing.
  arXiv  Detail & Related papers  (2021-09-02T14:17:30Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• A polarization quantum key distribution scheme based on phase matching [0.0]
  The Quantum Key Distribution protocol can encode a single quantum state and implements an information-theoretically secure key distribution protocol in communication. This paper successfully gives the polarization scheme of this PM-QKD protocol, the bases in the polarization scheme are arbitrary, and eliminates detector side channel attacks. The simulation results show that our protocol is superior to the BB84 protocol in terms of transmission distance under the fixed key rate.
  arXiv  Detail & Related papers  (2020-03-02T10:33:18Z)

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.