Labeled PSI from Fully Homomorphic Encryption with Malicious Security Article Swipe
Hao Chen
,
Zhicong Huang
,
Kim Laine
,
Peter Rindal
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1145/3243734.3243836
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1145/3243734.3243836
Private Set Intersection (PSI) allows two parties, the sender and the receiver, to compute the intersection of their private sets without revealing extra information to each other. We are interested in the unbalanced PSI setting, where (1) the receiver's set is significantly smaller than the sender's, and (2) the receiver (with the smaller set) has a low-power device. Also, in a Labeled PSI setting, the sender holds a label per each item in its set, and the receiver obtains the labels from the items in the intersection. We build upon the unbalanced PSI protocol of Chen, Laine, and Rindal (CCS 2017) in several ways: we add efficient support for arbitrary length items, we construct and implement an unbalanced Labeled PSI protocol with small communication complexity, and also strengthen the security model using Oblivious Pseudo-Random Function (OPRF) in a pre-processing phase. Our protocols outperform previous ones: for an intersection of 220 and 512 size sets of arbitrary length items our protocol has a total online running time of just 1 second (single thread), and a total communication cost of 4 MB. For a larger example, an intersection of 228 and 1024 size sets of arbitrary length items has an online running time of 12 seconds (multi-threaded), with less than 18 MB of total communication.
Related Topics
Concepts
Communication source
Homomorphic encryption
Computer science
Intersection (aeronautics)
Theoretical computer science
Set (abstract data type)
Encryption
Protocol (science)
Oblivious transfer
Communication complexity
Computer network
Algorithm
Cryptography
Alternative medicine
Aerospace engineering
Programming language
Medicine
Pathology
Engineering
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1145/3243734.3243836
- OA Status
- green
- Cited By
- 153
- References
- 49
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2889629344
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2889629344Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1145/3243734.3243836Digital Object Identifier
- Title
-
Labeled PSI from Fully Homomorphic Encryption with Malicious SecurityWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-10-15Full publication date if available
- Authors
-
Hao Chen, Zhicong Huang, Kim Laine, Peter RindalList of authors in order
- Landing page
-
https://doi.org/10.1145/3243734.3243836Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://infoscience.epfl.ch/record/266758Direct OA link when available
- Concepts
-
Communication source, Homomorphic encryption, Computer science, Intersection (aeronautics), Theoretical computer science, Set (abstract data type), Encryption, Protocol (science), Oblivious transfer, Communication complexity, Computer network, Algorithm, Cryptography, Alternative medicine, Aerospace engineering, Programming language, Medicine, Pathology, EngineeringTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
153Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 29, 2024: 35, 2023: 35, 2022: 20, 2021: 15Per-year citation counts (last 5 years)
- References (count)
-
49Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2889629344 |
|---|---|
| doi | https://doi.org/10.1145/3243734.3243836 |
| ids.doi | https://doi.org/10.1145/3243734.3243836 |
| ids.mag | 2889629344 |
| ids.openalex | https://openalex.org/W2889629344 |
| fwci | 6.75112361 |
| type | article |
| title | Labeled PSI from Fully Homomorphic Encryption with Malicious Security |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 1237 |
| biblio.first_page | 1223 |
| topics[0].id | https://openalex.org/T10237 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Cryptography and Data Security |
| topics[1].id | https://openalex.org/T10764 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9947999715805054 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Privacy-Preserving Technologies in Data |
| topics[2].id | https://openalex.org/T10720 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9944999814033508 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1703 |
| topics[2].subfield.display_name | Computational Theory and Mathematics |
| topics[2].display_name | Complexity and Algorithms in Graphs |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C198104137 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8940733671188354 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q974688 |
| concepts[0].display_name | Communication source |
| concepts[1].id | https://openalex.org/C158338273 |
| concepts[1].level | 3 |
| concepts[1].score | 0.8589063882827759 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q2154943 |
| concepts[1].display_name | Homomorphic encryption |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.7312960624694824 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C64543145 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6450050473213196 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q162942 |
| concepts[3].display_name | Intersection (aeronautics) |
| concepts[4].id | https://openalex.org/C80444323 |
| concepts[4].level | 1 |
| concepts[4].score | 0.49231255054473877 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[4].display_name | Theoretical computer science |
| concepts[5].id | https://openalex.org/C177264268 |
| concepts[5].level | 2 |
| concepts[5].score | 0.48865392804145813 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[5].display_name | Set (abstract data type) |
| concepts[6].id | https://openalex.org/C148730421 |
| concepts[6].level | 2 |
| concepts[6].score | 0.47992879152297974 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q141090 |
| concepts[6].display_name | Encryption |
| concepts[7].id | https://openalex.org/C2780385302 |
| concepts[7].level | 3 |
| concepts[7].score | 0.46829336881637573 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q367158 |
| concepts[7].display_name | Protocol (science) |
| concepts[8].id | https://openalex.org/C53076038 |
| concepts[8].level | 3 |
| concepts[8].score | 0.46279358863830566 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q2915383 |
| concepts[8].display_name | Oblivious transfer |
| concepts[9].id | https://openalex.org/C179145077 |
| concepts[9].level | 2 |
| concepts[9].score | 0.4467169940471649 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q5154130 |
| concepts[9].display_name | Communication complexity |
| concepts[10].id | https://openalex.org/C31258907 |
| concepts[10].level | 1 |
| concepts[10].score | 0.3670569062232971 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[10].display_name | Computer network |
| concepts[11].id | https://openalex.org/C11413529 |
| concepts[11].level | 1 |
| concepts[11].score | 0.34607023000717163 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[11].display_name | Algorithm |
| concepts[12].id | https://openalex.org/C178489894 |
| concepts[12].level | 2 |
| concepts[12].score | 0.31683149933815 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q8789 |
| concepts[12].display_name | Cryptography |
| concepts[13].id | https://openalex.org/C204787440 |
| concepts[13].level | 2 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q188504 |
| concepts[13].display_name | Alternative medicine |
| concepts[14].id | https://openalex.org/C146978453 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q3798668 |
| concepts[14].display_name | Aerospace engineering |
| concepts[15].id | https://openalex.org/C199360897 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[15].display_name | Programming language |
| concepts[16].id | https://openalex.org/C71924100 |
| concepts[16].level | 0 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q11190 |
| concepts[16].display_name | Medicine |
| concepts[17].id | https://openalex.org/C142724271 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q7208 |
| concepts[17].display_name | Pathology |
| concepts[18].id | https://openalex.org/C127413603 |
| concepts[18].level | 0 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[18].display_name | Engineering |
| keywords[0].id | https://openalex.org/keywords/communication-source |
| keywords[0].score | 0.8940733671188354 |
| keywords[0].display_name | Communication source |
| keywords[1].id | https://openalex.org/keywords/homomorphic-encryption |
| keywords[1].score | 0.8589063882827759 |
| keywords[1].display_name | Homomorphic encryption |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.7312960624694824 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/intersection |
| keywords[3].score | 0.6450050473213196 |
| keywords[3].display_name | Intersection (aeronautics) |
| keywords[4].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[4].score | 0.49231255054473877 |
| keywords[4].display_name | Theoretical computer science |
| keywords[5].id | https://openalex.org/keywords/set |
| keywords[5].score | 0.48865392804145813 |
| keywords[5].display_name | Set (abstract data type) |
| keywords[6].id | https://openalex.org/keywords/encryption |
| keywords[6].score | 0.47992879152297974 |
| keywords[6].display_name | Encryption |
| keywords[7].id | https://openalex.org/keywords/protocol |
| keywords[7].score | 0.46829336881637573 |
| keywords[7].display_name | Protocol (science) |
| keywords[8].id | https://openalex.org/keywords/oblivious-transfer |
| keywords[8].score | 0.46279358863830566 |
| keywords[8].display_name | Oblivious transfer |
| keywords[9].id | https://openalex.org/keywords/communication-complexity |
| keywords[9].score | 0.4467169940471649 |
| keywords[9].display_name | Communication complexity |
| keywords[10].id | https://openalex.org/keywords/computer-network |
| keywords[10].score | 0.3670569062232971 |
| keywords[10].display_name | Computer network |
| keywords[11].id | https://openalex.org/keywords/algorithm |
| keywords[11].score | 0.34607023000717163 |
| keywords[11].display_name | Algorithm |
| keywords[12].id | https://openalex.org/keywords/cryptography |
| keywords[12].score | 0.31683149933815 |
| keywords[12].display_name | Cryptography |
| language | en |
| locations[0].id | doi:10.1145/3243734.3243836 |
| locations[0].is_oa | False |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security |
| locations[0].landing_page_url | https://doi.org/10.1145/3243734.3243836 |
| locations[1].id | pmh:oai:infoscience.epfl.ch:266758 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400487 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | Infoscience (Ecole Polytechnique Fédérale de Lausanne) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | cc-by-nc-nd |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | conference proceedings |
| locations[1].license_id | https://openalex.org/licenses/cc-by-nc-nd |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | WoS |
| locations[1].landing_page_url | http://infoscience.epfl.ch/record/266758 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5100353665 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-4457-6231 |
| authorships[0].author.display_name | Hao Chen |
| authorships[0].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I1290206253 |
| authorships[0].affiliations[0].raw_affiliation_string | Microsoft Research, Redmond, WA, USA |
| authorships[0].institutions[0].id | https://openalex.org/I1290206253 |
| authorships[0].institutions[0].ror | https://ror.org/00d0nc645 |
| authorships[0].institutions[0].type | company |
| authorships[0].institutions[0].lineage | https://openalex.org/I1290206253 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | Microsoft (United States) |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Hao Chen |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Microsoft Research, Redmond, WA, USA |
| authorships[1].author.id | https://openalex.org/A5063170074 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-1338-611X |
| authorships[1].author.display_name | Zhicong Huang |
| authorships[1].countries | CH |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I5124864 |
| authorships[1].affiliations[0].raw_affiliation_string | École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland |
| authorships[1].institutions[0].id | https://openalex.org/I5124864 |
| authorships[1].institutions[0].ror | https://ror.org/02s376052 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I2799323385, https://openalex.org/I5124864 |
| authorships[1].institutions[0].country_code | CH |
| authorships[1].institutions[0].display_name | École Polytechnique Fédérale de Lausanne |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Zhicong Huang |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland |
| authorships[2].author.id | https://openalex.org/A5012602812 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-9087-5913 |
| authorships[2].author.display_name | Kim Laine |
| authorships[2].countries | US |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I1290206253 |
| authorships[2].affiliations[0].raw_affiliation_string | Microsoft Research, Redmond, WA, USA |
| authorships[2].institutions[0].id | https://openalex.org/I1290206253 |
| authorships[2].institutions[0].ror | https://ror.org/00d0nc645 |
| authorships[2].institutions[0].type | company |
| authorships[2].institutions[0].lineage | https://openalex.org/I1290206253 |
| authorships[2].institutions[0].country_code | US |
| authorships[2].institutions[0].display_name | Microsoft (United States) |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Kim Laine |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Microsoft Research, Redmond, WA, USA |
| authorships[3].author.id | https://openalex.org/A5070581119 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-2402-7411 |
| authorships[3].author.display_name | Peter Rindal |
| authorships[3].countries | US |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I131249849 |
| authorships[3].affiliations[0].raw_affiliation_string | Oregon State University, Corvallis, OR, USA |
| authorships[3].institutions[0].id | https://openalex.org/I131249849 |
| authorships[3].institutions[0].ror | https://ror.org/00ysfqy60 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I131249849 |
| authorships[3].institutions[0].country_code | US |
| authorships[3].institutions[0].display_name | Oregon State University |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Peter Rindal |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Oregon State University, Corvallis, OR, USA |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://infoscience.epfl.ch/record/266758 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Labeled PSI from Fully Homomorphic Encryption with Malicious Security |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10237 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Cryptography and Data Security |
| related_works | https://openalex.org/W2014378761, https://openalex.org/W2383547808, https://openalex.org/W2949203817, https://openalex.org/W3029821189, https://openalex.org/W3114935130, https://openalex.org/W4362456836, https://openalex.org/W2385140399, https://openalex.org/W1595648337, https://openalex.org/W2776085435, https://openalex.org/W1564326043 |
| cited_by_count | 153 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 29 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 35 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 35 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 20 |
| counts_by_year[4].year | 2021 |
| counts_by_year[4].cited_by_count | 15 |
| counts_by_year[5].year | 2020 |
| counts_by_year[5].cited_by_count | 13 |
| counts_by_year[6].year | 2019 |
| counts_by_year[6].cited_by_count | 6 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:infoscience.epfl.ch:266758 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400487 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Infoscience (Ecole Polytechnique Fédérale de Lausanne) |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | cc-by-nc-nd |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | conference proceedings |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by-nc-nd |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | WoS |
| best_oa_location.landing_page_url | http://infoscience.epfl.ch/record/266758 |
| primary_location.id | doi:10.1145/3243734.3243836 |
| primary_location.is_oa | False |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security |
| primary_location.landing_page_url | https://doi.org/10.1145/3243734.3243836 |
| publication_date | 2018-10-15 |
| publication_year | 2018 |
| referenced_works | https://openalex.org/W2883089683, https://openalex.org/W2087135382, https://openalex.org/W36213310, https://openalex.org/W2226167778, https://openalex.org/W2152926062, https://openalex.org/W1979120705, https://openalex.org/W2766393794, https://openalex.org/W2768174108, https://openalex.org/W2285574614, https://openalex.org/W2188435228, https://openalex.org/W2284068942, https://openalex.org/W2554750353, https://openalex.org/W2114021497, https://openalex.org/W2460519802, https://openalex.org/W1889757464, https://openalex.org/W2031533839, https://openalex.org/W2401959250, https://openalex.org/W2212846837, https://openalex.org/W2295445672, https://openalex.org/W2765239305, https://openalex.org/W2535199873, https://openalex.org/W2026179596, https://openalex.org/W2058355460, https://openalex.org/W2170405424, https://openalex.org/W2795178974, https://openalex.org/W2782492233, https://openalex.org/W2971142338, https://openalex.org/W2767079258, https://openalex.org/W1966731635, https://openalex.org/W1992282993, https://openalex.org/W2183863591, https://openalex.org/W28930810, https://openalex.org/W56544557, https://openalex.org/W2753539753, https://openalex.org/W2527617455, https://openalex.org/W1494049356, https://openalex.org/W2887461714, https://openalex.org/W3028867652, https://openalex.org/W2350778671, https://openalex.org/W1544695791, https://openalex.org/W2811088584, https://openalex.org/W2157100124, https://openalex.org/W2199845262, https://openalex.org/W1497727960, https://openalex.org/W2534639771, https://openalex.org/W1577229502, https://openalex.org/W2951328429, https://openalex.org/W2569238585, https://openalex.org/W236632755 |
| referenced_works_count | 49 |
| abstract_inverted_index.1 | 168 |
| abstract_inverted_index.4 | 178 |
| abstract_inverted_index.a | 55, 60, 67, 137, 161, 173, 181 |
| abstract_inverted_index.12 | 202 |
| abstract_inverted_index.18 | 208 |
| abstract_inverted_index.MB | 209 |
| abstract_inverted_index.We | 27, 87 |
| abstract_inverted_index.an | 116, 146, 184, 197 |
| abstract_inverted_index.in | 30, 59, 72, 84, 101, 136 |
| abstract_inverted_index.is | 40 |
| abstract_inverted_index.of | 16, 94, 148, 154, 166, 177, 186, 192, 201, 210 |
| abstract_inverted_index.to | 12, 24 |
| abstract_inverted_index.we | 104, 112 |
| abstract_inverted_index.(1) | 36 |
| abstract_inverted_index.(2) | 47 |
| abstract_inverted_index.220 | 149 |
| abstract_inverted_index.228 | 187 |
| abstract_inverted_index.512 | 151 |
| abstract_inverted_index.For | 180 |
| abstract_inverted_index.MB. | 179 |
| abstract_inverted_index.Our | 140 |
| abstract_inverted_index.PSI | 33, 62, 92, 119 |
| abstract_inverted_index.Set | 1 |
| abstract_inverted_index.add | 105 |
| abstract_inverted_index.and | 9, 46, 75, 97, 114, 125, 150, 172, 188 |
| abstract_inverted_index.are | 28 |
| abstract_inverted_index.for | 108, 145 |
| abstract_inverted_index.has | 54, 160, 196 |
| abstract_inverted_index.its | 73 |
| abstract_inverted_index.our | 158 |
| abstract_inverted_index.per | 69 |
| abstract_inverted_index.set | 39 |
| abstract_inverted_index.the | 7, 10, 14, 31, 37, 44, 48, 51, 64, 76, 79, 82, 85, 90, 128 |
| abstract_inverted_index.two | 5 |
| abstract_inverted_index.(CCS | 99 |
| abstract_inverted_index.1024 | 189 |
| abstract_inverted_index.also | 126 |
| abstract_inverted_index.cost | 176 |
| abstract_inverted_index.each | 25, 70 |
| abstract_inverted_index.from | 81 |
| abstract_inverted_index.item | 71 |
| abstract_inverted_index.just | 167 |
| abstract_inverted_index.less | 206 |
| abstract_inverted_index.set) | 53 |
| abstract_inverted_index.set, | 74 |
| abstract_inverted_index.sets | 19, 153, 191 |
| abstract_inverted_index.size | 152, 190 |
| abstract_inverted_index.than | 43, 207 |
| abstract_inverted_index.time | 165, 200 |
| abstract_inverted_index.upon | 89 |
| abstract_inverted_index.with | 121, 205 |
| abstract_inverted_index.(PSI) | 3 |
| abstract_inverted_index.(with | 50 |
| abstract_inverted_index.2017) | 100 |
| abstract_inverted_index.Also, | 58 |
| abstract_inverted_index.Chen, | 95 |
| abstract_inverted_index.build | 88 |
| abstract_inverted_index.extra | 22 |
| abstract_inverted_index.holds | 66 |
| abstract_inverted_index.items | 83, 157, 195 |
| abstract_inverted_index.label | 68 |
| abstract_inverted_index.model | 130 |
| abstract_inverted_index.ones: | 144 |
| abstract_inverted_index.small | 122 |
| abstract_inverted_index.their | 17 |
| abstract_inverted_index.total | 162, 174, 211 |
| abstract_inverted_index.using | 131 |
| abstract_inverted_index.ways: | 103 |
| abstract_inverted_index.where | 35 |
| abstract_inverted_index.(OPRF) | 135 |
| abstract_inverted_index.Laine, | 96 |
| abstract_inverted_index.Rindal | 98 |
| abstract_inverted_index.allows | 4 |
| abstract_inverted_index.items, | 111 |
| abstract_inverted_index.labels | 80 |
| abstract_inverted_index.larger | 182 |
| abstract_inverted_index.length | 110, 156, 194 |
| abstract_inverted_index.online | 163, 198 |
| abstract_inverted_index.other. | 26 |
| abstract_inverted_index.phase. | 139 |
| abstract_inverted_index.second | 169 |
| abstract_inverted_index.sender | 8, 65 |
| abstract_inverted_index.(single | 170 |
| abstract_inverted_index.Labeled | 61, 118 |
| abstract_inverted_index.Private | 0 |
| abstract_inverted_index.compute | 13 |
| abstract_inverted_index.device. | 57 |
| abstract_inverted_index.obtains | 78 |
| abstract_inverted_index.private | 18 |
| abstract_inverted_index.running | 164, 199 |
| abstract_inverted_index.seconds | 203 |
| abstract_inverted_index.several | 102 |
| abstract_inverted_index.smaller | 42, 52 |
| abstract_inverted_index.support | 107 |
| abstract_inverted_index.without | 20 |
| abstract_inverted_index.Function | 134 |
| abstract_inverted_index.example, | 183 |
| abstract_inverted_index.parties, | 6 |
| abstract_inverted_index.previous | 143 |
| abstract_inverted_index.protocol | 93, 120, 159 |
| abstract_inverted_index.receiver | 49, 77 |
| abstract_inverted_index.security | 129 |
| abstract_inverted_index.setting, | 34, 63 |
| abstract_inverted_index.thread), | 171 |
| abstract_inverted_index.Oblivious | 132 |
| abstract_inverted_index.arbitrary | 109, 155, 193 |
| abstract_inverted_index.construct | 113 |
| abstract_inverted_index.efficient | 106 |
| abstract_inverted_index.implement | 115 |
| abstract_inverted_index.low-power | 56 |
| abstract_inverted_index.protocols | 141 |
| abstract_inverted_index.receiver, | 11 |
| abstract_inverted_index.revealing | 21 |
| abstract_inverted_index.sender's, | 45 |
| abstract_inverted_index.interested | 29 |
| abstract_inverted_index.outperform | 142 |
| abstract_inverted_index.receiver's | 38 |
| abstract_inverted_index.strengthen | 127 |
| abstract_inverted_index.unbalanced | 32, 91, 117 |
| abstract_inverted_index.complexity, | 124 |
| abstract_inverted_index.information | 23 |
| abstract_inverted_index.Intersection | 2 |
| abstract_inverted_index.intersection | 15, 147, 185 |
| abstract_inverted_index.Pseudo-Random | 133 |
| abstract_inverted_index.communication | 123, 175 |
| abstract_inverted_index.intersection. | 86 |
| abstract_inverted_index.significantly | 41 |
| abstract_inverted_index.communication. | 212 |
| abstract_inverted_index.pre-processing | 138 |
| abstract_inverted_index.(multi-threaded), | 204 |
| cited_by_percentile_year.max | 100 |
| cited_by_percentile_year.min | 98 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.75 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile.value | 0.96697884 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |