Private Set Intersection (PSI) is a fundamental multi-party computation primitive used to secure many political, commercial, and social applications. PSI allows mistrustful parties to compute the intersection of their private sets without leaking additional information. PSI protocols has been largely ...
Private set intersection (PSI) enables two parties, each with a private set, to compute the intersection of their sets without revealing any information more than the intersection itself. Since its high practical value in threat detection, private contact discovery, sample alignment, and other scenar...
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many applications for online collaboration. We present protocols, based on the use of homomorphic encryption and balanced...
Client (C) defines a polynomial of degree k whose roots are his inputs x 1,…,x k Efficient Private Matching and Set Intersection:高效的私人匹配和交集 来自淘豆网www.taodocs.com转载请标明出处. 文档信息 页数:24 收藏数:0 顶次数:0 上传人:薄荷牛奶 文件大小:0 KB 时间:2016-04-17...
Our protocols for secure computing the set intersection... C Hazay,Y Lindell - 《Journal of Cryptology》 被引量: 423发表: 2010年 Computationally Secure Pattern Matching in the Presence of Malicious Adversaries Private pattern matching is an important problem that has many applications in the area...
Vole-PSI implements the protocols described inVOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLEandBlazing Fast PSI from Improved OKVS and Subfield VOLE. The library implements standardPrivate Set Intersection (PSI)along with a variant called Circuit PSI where the result is secret shared between...
(using state-of-the-art OT extension). We explore in detail our protocol’s application to semihonest secure private set intersection (PSI). The fastest state-of- the-art PSI protocol (Pinkas et al., Usenix 2015) is based on efficient OT extension. We observe that our OP...
We present a new circuit-based protocol for multi-party private set intersection (PSI) that allows m parties to compute the intersection of their datasets without revealing any additional information about the items outside the intersection. Building upon the two-party Sort-Compare-Shuffle (SCS) pr...
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many applications for online collaboration. We present protocols, based on the use of homomorphic encryption and balanced...
While there has been a lot of progress in designing efficient custom protocols for computing Private Set Intersection (PSI), there has been less research on using generic Multi-Party Computation (MPC) protocols for this task. However, there are many variants of the set intersection functionality ...