SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension

Pinkas, Benny; Rosulek, Mike; Trieu, Ni; Yanai, Avishay

doi:10.1007/978-3-030-26954-8_13

Cited by 127 publications

(114 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They compared the performance of several different protocols on the same platform and their protocol improves the operational efficiency of previous protocols. Pinkas et al [14] found a better balance between the communication and computational overhead of the two-party PSI protocol. In general, the protocol has the lower monetary cost than other protocols.…”

Section: A Related Workmentioning

confidence: 99%

Efficient Threshold Private Set Intersection

Zhang

Chang

2021

IEEE Access

View full text Add to dashboard Cite

Section: A Related Workmentioning

confidence: 99%

Efficient Threshold Private Set Intersection

Zhang

Chang

2021

IEEE Access

View full text Add to dashboard Cite

“…The most efficient private set intersection protocols today use advanced hashing techniques and can process millions of items in a few seconds. 23,31,32 Threshold cryptography. The aim of threshold cryptography is to enable a set of parties to carry out cryptographic operations, without any single party holding the secret key.…”

Section: Feasibility Of Mpcmentioning

confidence: 99%

Secure multiparty computation

Lindell

2020

Commun. ACM

102

View full text Add to dashboard Cite

show abstract

“…The receiver can freely choose which of the messages to learn while the sender does not obtain any information about the receiver's choice. A common way to perform a large number of OT executions with low amortized cost is through OT extension [24], which is often used to efficiently construct OPRF's for use in PSI [17,23,24]. 6.1.3 Multi-Party PSI Protocols.…”

Section: Private Set Intersectionmentioning

confidence: 99%

Practical Over-Threshold Multi-Party Private Set Intersection

Mahdavi

Humphries

Kacsmar

et al. 2020

Annual Computer Security Applications Conference

View full text Add to dashboard Cite

Two parties with private data sets can find shared elements using a Private Set Intersection (PSI) protocol without revealing any information beyond the intersection. Circuit PSI protocols privately compute an arbitrary function of the intersectionsuch as its cardinality, and are often employed in an unbalanced setting where one party has more data than the other. Existing protocols are either computationally inefficient or require extensive server-client communication on the order of the larger set. We introduce Practically Efficient PSI or PEPSI, a non-interactive solution where only the client sends its encrypted data. PEPSI can process an intersection of 1024 client items with a million server items in under a second, using less than 5 MB of communication. Our work is over 4 orders of magnitude faster than an existing non-interactive circuit PSI protocol and requires only 10% of the communication. It is also up to 20 times faster than the work of Ion et al., which computes a limited set of functions and has communication costs proportional to the larger set. Our work is the first to demonstrate that non-interactive circuit PSI can be practically applied in an unbalanced setting.

show abstract

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension

Cited by 127 publications

References 39 publications

Efficient Threshold Private Set Intersection

Efficient Threshold Private Set Intersection

Secure multiparty computation

Practical Over-Threshold Multi-Party Private Set Intersection

Contact Info

Product

Resources

About