TY - GEN
T1 - Fair private set intersection with a semi-trusted arbiter
AU - Dong, Changyu
AU - Chen, Liqun
AU - Camenisch, Jan
AU - Russello, Giovanni
N1 - This is a pre-print of an article accepted to 27th Annual IFIP WG 11.3 Conference. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39256-6_9
PY - 2013
Y1 - 2013
N2 - A private set intersection (PSI) protocol allows two parties to compute the intersection of their input sets privately. Most of the previous PSI protocols only output the result to one party and the other party gets nothing from running the protocols. However, a mutual PSI protocol in which both parties can get the output is highly desirable in many applications. A major obstacle in designing a mutual PSI protocol is how to ensure fairness. In this paper we present the first fair mutual PSI protocol which is efficient and secure. Fairness of the protocol is obtained in an optimistic fashion, i.e. by using an offline third party arbiter. In contrast to many optimistic protocols which require a fully trusted arbiter, in our protocol the arbiter is only required to be semi-trusted, in the sense that we consider it to be a potential threat to both parties' privacy but believe it will follow the protocol. The arbiter can resolve disputes without knowing any private information belongs to the two parties. This feature is appealing for a PSI protocol in which privacy may be of ultimate importance.
AB - A private set intersection (PSI) protocol allows two parties to compute the intersection of their input sets privately. Most of the previous PSI protocols only output the result to one party and the other party gets nothing from running the protocols. However, a mutual PSI protocol in which both parties can get the output is highly desirable in many applications. A major obstacle in designing a mutual PSI protocol is how to ensure fairness. In this paper we present the first fair mutual PSI protocol which is efficient and secure. Fairness of the protocol is obtained in an optimistic fashion, i.e. by using an offline third party arbiter. In contrast to many optimistic protocols which require a fully trusted arbiter, in our protocol the arbiter is only required to be semi-trusted, in the sense that we consider it to be a potential threat to both parties' privacy but believe it will follow the protocol. The arbiter can resolve disputes without knowing any private information belongs to the two parties. This feature is appealing for a PSI protocol in which privacy may be of ultimate importance.
KW - data encryption
KW - communication networks
KW - private set intersection
UR - http://www.scopus.com/inward/record.url?scp=84881161658&partnerID=8YFLogxK
UR - http://eprint.iacr.org/2012/252
U2 - 10.1007/978-3-642-39256-6_9
DO - 10.1007/978-3-642-39256-6_9
M3 - Conference contribution book
VL - 7964
T3 - Lecture Notes in Computer Science
SP - 128
EP - 144
BT - Data and Applications Security and Privacy XXVII
A2 - Wang, Lingyu
A2 - Shafiq, Basit
PB - Springer
ER -