Advertisement

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters

  • Roi Inbar
  • Eran Omri
  • Benny Pinkas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11035)

Abstract

In private set intersection (PSI), a set of parties, each holding a private data set, wish to compute the intersection over all data sets in a manner that guarantees both correctness and privacy. This secure computation task is of great importance and usability in many different real-life scenarios. Much research was dedicated to the construction of PSI-tailored concretely efficient protocols for the case of two-party PSI. The case of many parties has been given much less attention, despite probably being a more realistic setting for most applications.

In this work, we propose a new concretely efficient, highly scalable, secure computation protocol for multiparty PSI. Our protocol is an extension of the two-party PSI protocol of Dong et al. [ACM CCS’13] and uses the garbled Bloom filter primitive introduced therein. There are two main variants to our protocol. The first construction provides semi-honest security. The second construction provides (the slightly weaker) augmented semi-honest security, and is substantially more efficient. Furthermore, in the augmented semi-honest protocol all heavy computations can be performed ahead of time, in an offline phase, before the parties ever learn their inputs. This results in an online phase that requires only short interaction. Moreover, in the online phase, interactions are performed over a star topology network. All our constructions tolerate any number of corruptions.

We implemented our protocols and incorporated several optimization techniques. These techniques allow the running time of the protocol to be comparable to that of the two party protocol of Dong et al. and scale linearly with the number of parties. We ran extensive experiments to compare our protocol with the two-party protocol and to demonstrate the effect of the different optimizations.

Keywords

Multiparty computation Private set intersection Concrete efficiency Garbled Bloom filters 

References

  1. 1.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1–10 (1988)Google Scholar
  2. 2.
    Bertsekas, D.P., Özveren, C., Stamoulis, G.D., Tseng, P., Tsitsiklis, J.N.: Optimal communication algorithms for hypercubes. J. Parallel Distrib. Comput. 11(4), 263–275 (1991)CrossRefGoogle Scholar
  3. 3.
    Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)CrossRefGoogle Scholar
  4. 4.
    Canetti, R.: Security and composition of multiparty cryptographic protocols. J. CRYPTOLOGY 13(1), 143–202 (2000)MathSciNetCrossRefGoogle Scholar
  5. 5.
    De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143–159. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-14577-3_13CrossRefGoogle Scholar
  6. 6.
    Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: The ACM Conference on Computer and Communications Security, CCS 2013, pp. 789–800. ACM (2013)Google Scholar
  7. 7.
    Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-24676-3_1CrossRefGoogle Scholar
  8. 8.
    Freedman, M.J., Hazay, C., Nissim, K., Pinkas, B.: Efficient set intersection with simulation-based security. J. Cryptol. 29(1), 115–155 (2016)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Goldreich, O.: Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press, Cambridge (2004)CrossRefGoogle Scholar
  10. 10.
    Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC19, pp. 218–229 (1987)Google Scholar
  11. 11.
    Hazay, C., Venkitasubramaniam, M.: Scalable multi-party private set-intersection. In: Fehr, S. (ed.) PKC 2017 Part I. LNCS, vol. 10174, pp. 175–203. Springer, Heidelberg (2017).  https://doi.org/10.1007/978-3-662-54365-8_8CrossRefGoogle Scholar
  12. 12.
    Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145–161. Springer, Heidelberg (2003).  https://doi.org/10.1007/978-3-540-45146-4_9CrossRefGoogle Scholar
  13. 13.
    Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 577–594. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-00457-5_34CrossRefzbMATHGoogle Scholar
  14. 14.
    Jayachandran, P.: Murmur hash algorithm (2014). https://github.com/prasanthj/hasher. Accessed 6 Oct 2017
  15. 15.
    Jayachandran, P.: xxHash hash algorithm (2014). https://github.com/prasanthj/hasher. Accessed 6 Oct 2017
  16. 16.
    Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013 Part II. LNCS, vol. 8043, pp. 54–70. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-40084-1_4CrossRefGoogle Scholar
  17. 17.
    Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24–28 October 2016, pp. 818–829 (2016)Google Scholar
  18. 18.
    Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., Trieu, N.: Practical multi-party private set intersection from symmetric-key techniques. In: The ACM Conference on Computer and Communications Security, CCS 2017 (2017)Google Scholar
  19. 19.
    Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: Proceedings of the 23rd USENIX Security Symposium, pp. 797–812. USENIX Association (2014)Google Scholar
  20. 20.
    Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. Cryptology ePrint Archive, Report 2016/930 (2016)Google Scholar
  21. 21.
    Rindal, P., Rosulek, M.: Faster malicious 2-party secure computation with online/offline dual execution. In: 25th USENIX Security Symposium, USENIX Security, pp. 297–314. USENIX Association (2016)Google Scholar
  22. 22.
    IUCC Unit: Cyber Research, Experimentation and Test Environment (2017). https://createlab.iucc.ac.il/. Acessed 16 Oct 2017
  23. 23.
    Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23th Annual Symposium on Foundations of Computer Science (FOCS), pp. 160–164 (1982)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceAriel UniversityArielIsrael
  2. 2.Department of Computer ScienceBar-Ilan UniversityRamat GanIsrael

Personalised recommendations