This HTML5 document contains 23 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n16http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n15http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Private_set_intersection
rdfs:label
Private set intersection
rdfs:comment
Private set intersection is a secure multiparty computation cryptographic technique that allows two parties holding sets to compare encrypted versions of these sets in order to compute the intersection. In this scenario, neither party reveals anything to the counterparty except for the elements in the intersection. Other variants of this exist, such as the server-client scenario, in which only the client learns the intersection of her set with the set of the server, without the server learning intersection of his set with the clients.
dbp:name
Private set intersection
foaf:depiction
n15:Example_PSI_diagram_depicting_basic_security_requirements.png
dcterms:subject
dbc:Cryptography dbc:Hashing
dbo:wikiPageID
61292261
dbo:wikiPageRevisionID
1081416156
dbo:wikiPageWikiLink
dbr:Homomorphic_encryption dbc:Cryptography dbr:Secure_multiparty_computation dbc:Hashing n16:Example_PSI_diagram_depicting_basic_security_requirements.png
owl:sameAs
wikidata:Q85846987 n13:C3be4
dbp:wikiPageUsesTemplate
dbt:Infobox_encryption_method dbt:Crypto-stub
dbo:thumbnail
n15:Example_PSI_diagram_depicting_basic_security_requirements.png?width=300
dbo:abstract
Private set intersection is a secure multiparty computation cryptographic technique that allows two parties holding sets to compare encrypted versions of these sets in order to compute the intersection. In this scenario, neither party reveals anything to the counterparty except for the elements in the intersection. Other variants of this exist, such as the server-client scenario, in which only the client learns the intersection of her set with the set of the server, without the server learning intersection of his set with the clients. For the comparison of data sets by cryptographic hashes on a small and predictable domain, precautions should be taken to prevent dictionary attacks. Apple uses this technique in Password Monitoring. It has proposed using the technology for its announced Expanded Protections for Children In general, PSI protocols can be categorized into two broad categories: (1) traditional PSI and (2) delegated PSI. In the traditional PSI category, the data owners interact directly with each other and need to have a copy of their set at the time of the computation, e.g., . In the delegated PSI the computation of PSI and/or the storage of sets can be delegated to a third-party server (that is itself might be a passive or active adversary). The delegated PSI category can be further divided into two classes: (a) those that support one-off delegation, and (b) those that support repeated delegation. The PSI protocols that support one-off delegation require the data owner to re-encode its data and send the encoded data to the server for each computation, e.g., . Those that support repeated delegation allow the data owners to upload their (encrypted) data to the server only once, and then re-use it many times for each computation carried out but the server, e.g., Recently, researchers have proposed a variant of PSI protocol (in both traditional and delegated categories) that support data update, e.g., , . This type of PSI protocol lets data owners insert/delete set elements into/from their data with low overheads and in a privacy-preserving manner.
dbp:relatedTo
dbr:Homomorphic_encryption
prov:wasDerivedFrom
wikipedia-en:Private_set_intersection?oldid=1081416156&ns=0
dbo:wikiPageLength
5723
foaf:isPrimaryTopicOf
wikipedia-en:Private_set_intersection