Streaming and Unbalanced PSI from Function Secret Sharing

Samuel Dittmer; Yuval Ishai; Steve Lu; Rafail Ostrovsky; Mohamed Elsabagh; Nikolaos Kiourtis; Brian Schulte; Angelos Stavrou

doi:10.1007/978-3-031-14791-3_25

Streaming and Unbalanced PSI from Function Secret Sharing

Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

Private Set Intersection (PSI) is one of the most useful and well-studied instances of secure computation, with many variants and applications. In this work, we present new solutions to PSI and a weighted variant in which the output is the sum of the weights of keywords in the intersection. Our protocols apply to the semi-honest, two-server model and are optimized for the unbalanced case, where one of the sets is much larger than the other, and for a dynamic streaming setting, in which sets can evolve over time. Our protocols make use of Function Secret Sharing (FSS) to aggregate numerical payloads associated with the intersection while minimizing interaction and computational overhead. They avoid the use of public-key cryptography, giving simple and concretely efficient protocols for unbalanced PSI. In the dynamic setting, we use queuing theory to eliminate leakage with minimal overhead while ensuring low wait times, giving efficient streaming unbalanced PSI.

Original language	English
Title of host publication	Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings
Editors	Clemente Galdi, Stanislaw Jarecki
Pages	564-587
Number of pages	24
DOIs	https://doi.org/10.1007/978-3-031-14791-3_25
State	Published - 2022
Event	13th International Conference on Security and Cryptography for Networks, SCN 2022 - Amalfi, Italy Duration: 12 Sep 2022 → 14 Sep 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13409 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference on Security and Cryptography for Networks, SCN 2022
Country/Territory	Italy
City	Amalfi
Period	12/09/22 → 14/09/22

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-031-14791-3_25

Cite this

Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R., Elsabagh, M., Kiourtis, N., Schulte, B., & Stavrou, A. (2022). Streaming and Unbalanced PSI from Function Secret Sharing. In C. Galdi, & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 564-587). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13409 LNCS). https://doi.org/10.1007/978-3-031-14791-3_25

Dittmer, Samuel ; Ishai, Yuval ; Lu, Steve et al. / Streaming and Unbalanced PSI from Function Secret Sharing. Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings. editor / Clemente Galdi ; Stanislaw Jarecki. 2022. pp. 564-587 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1caa36af60cd4dd4b806d85dc78c7ab4,

title = "Streaming and Unbalanced PSI from Function Secret Sharing",

abstract = "Private Set Intersection (PSI) is one of the most useful and well-studied instances of secure computation, with many variants and applications. In this work, we present new solutions to PSI and a weighted variant in which the output is the sum of the weights of keywords in the intersection. Our protocols apply to the semi-honest, two-server model and are optimized for the unbalanced case, where one of the sets is much larger than the other, and for a dynamic streaming setting, in which sets can evolve over time. Our protocols make use of Function Secret Sharing (FSS) to aggregate numerical payloads associated with the intersection while minimizing interaction and computational overhead. They avoid the use of public-key cryptography, giving simple and concretely efficient protocols for unbalanced PSI. In the dynamic setting, we use queuing theory to eliminate leakage with minimal overhead while ensuring low wait times, giving efficient streaming unbalanced PSI.",

author = "Samuel Dittmer and Yuval Ishai and Steve Lu and Rafail Ostrovsky and Mohamed Elsabagh and Nikolaos Kiourtis and Brian Schulte and Angelos Stavrou",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 13th International Conference on Security and Cryptography for Networks, SCN 2022 ; Conference date: 12-09-2022 Through 14-09-2022",

year = "2022",

doi = "10.1007/978-3-031-14791-3_25",

language = "אנגלית",

isbn = "9783031147906",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "564--587",

editor = "Clemente Galdi and Stanislaw Jarecki",

booktitle = "Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings",

}

Dittmer, S, Ishai, Y, Lu, S, Ostrovsky, R, Elsabagh, M, Kiourtis, N, Schulte, B & Stavrou, A 2022, Streaming and Unbalanced PSI from Function Secret Sharing. in C Galdi & S Jarecki (eds), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13409 LNCS, pp. 564-587, 13th International Conference on Security and Cryptography for Networks, SCN 2022, Amalfi, Italy, 12/09/22. https://doi.org/10.1007/978-3-031-14791-3_25

Streaming and Unbalanced PSI from Function Secret Sharing. / Dittmer, Samuel; Ishai, Yuval; Lu, Steve et al.
Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings. ed. / Clemente Galdi; Stanislaw Jarecki. 2022. p. 564-587 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13409 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Streaming and Unbalanced PSI from Function Secret Sharing

AU - Dittmer, Samuel

AU - Ishai, Yuval

AU - Lu, Steve

AU - Ostrovsky, Rafail

AU - Elsabagh, Mohamed

AU - Kiourtis, Nikolaos

AU - Schulte, Brian

AU - Stavrou, Angelos

PY - 2022

Y1 - 2022

N2 - Private Set Intersection (PSI) is one of the most useful and well-studied instances of secure computation, with many variants and applications. In this work, we present new solutions to PSI and a weighted variant in which the output is the sum of the weights of keywords in the intersection. Our protocols apply to the semi-honest, two-server model and are optimized for the unbalanced case, where one of the sets is much larger than the other, and for a dynamic streaming setting, in which sets can evolve over time. Our protocols make use of Function Secret Sharing (FSS) to aggregate numerical payloads associated with the intersection while minimizing interaction and computational overhead. They avoid the use of public-key cryptography, giving simple and concretely efficient protocols for unbalanced PSI. In the dynamic setting, we use queuing theory to eliminate leakage with minimal overhead while ensuring low wait times, giving efficient streaming unbalanced PSI.

AB - Private Set Intersection (PSI) is one of the most useful and well-studied instances of secure computation, with many variants and applications. In this work, we present new solutions to PSI and a weighted variant in which the output is the sum of the weights of keywords in the intersection. Our protocols apply to the semi-honest, two-server model and are optimized for the unbalanced case, where one of the sets is much larger than the other, and for a dynamic streaming setting, in which sets can evolve over time. Our protocols make use of Function Secret Sharing (FSS) to aggregate numerical payloads associated with the intersection while minimizing interaction and computational overhead. They avoid the use of public-key cryptography, giving simple and concretely efficient protocols for unbalanced PSI. In the dynamic setting, we use queuing theory to eliminate leakage with minimal overhead while ensuring low wait times, giving efficient streaming unbalanced PSI.

UR - http://www.scopus.com/inward/record.url?scp=85138004896&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-14791-3_25

DO - 10.1007/978-3-031-14791-3_25

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85138004896

SN - 9783031147906

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 564

EP - 587

BT - Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings

A2 - Galdi, Clemente

A2 - Jarecki, Stanislaw

T2 - 13th International Conference on Security and Cryptography for Networks, SCN 2022

Y2 - 12 September 2022 through 14 September 2022

ER -

Dittmer S, Ishai Y, Lu S, Ostrovsky R, Elsabagh M, Kiourtis N et al. Streaming and Unbalanced PSI from Function Secret Sharing. In Galdi C, Jarecki S, editors, Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings. 2022. p. 564-587. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-14791-3_25