Efficient scalable multi-party private set intersection using oblivious PRF

Kavousi, A ; Sharif University of Technology | 2021

114 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-030-91859-0_5
  3. Publisher: Springer Science and Business Media Deutschland GmbH , 2021
  4. Abstract:
  5. In this paper, we present a concretely efficient protocol for private set intersection (PSI) in the multi-party setting using oblivious pseudorandom function (OPRF). In fact, we generalize the approach used in the work of Chase and Miao [CRYPTO 2020] towards deploying a lightweight multi-point OPRF construction for two-party PSI. Our protocol only includes oblivious transfer (OT) extension and garbled Bloom filter as its main ingredients and avoids computationally expensive operations. From a communication pattern perspective, the protocol consists of two types of interactions. The first type is performed over a star-like communication graph in which one designated party interacts with all other parties via performing OTs as the sender. Besides, parties communicate through a path-like communication graph that involves sending a garbled Bloom filter from the first party to its neighboring party following the last one. This design makes our protocol to be highly scalable due to the independence of each party’s complexity from the number of participating parties and thus causes a communication and computation complexities of O(nλk), where n is the set size, k is the number of hash functions, and λ is the security parameter. Moreover, the asymptotic complexity of the designated party is O(tnλ) which linearly scales with the number of parties t. We prove security of the proposed protocol against semi-honest adversaries. © 2021, Springer Nature Switzerland AG
  6. Keywords:
  7. Concretes ; Data structures ; Security of data ; Bloom filters ; Communication graphs ; Concrete efficiency ; Efficient protocols ; Function construction ; Multi-points ; Oblivious pseudorandom functions ; Private set intersection ; Secure multi-party computation ; Set intersection ; Hash functions
  8. Source: 17th International Workshop on Security and Trust Management, STM 2021, co-located with the 26th European Symposium on Research in Computer Security, ESORICS 2021, 8 October 2021 through 8 October 2021 ; Volume 13075 LNCS , 2021 , Pages 81-99 ; 03029743 (ISSN); 9783030918583 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-030-91859-0_5