We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Quantum secure two-party computation for set intersection with rational players.
- Authors
Maitra, Arpita
- Abstract
Recently, Shi et al. (Phys Rev A 92:022309, <xref>2015</xref>) proposed quantum oblivious set member decision protocol where two legitimate parties, namely Alice and Bob, play a game. Alice has a secret k, and Bob has a set {k1,k2,…kn}<inline-graphic></inline-graphic>. The game is designed towards testing if the secret k is a member of the set possessed by Bob without revealing the identity of k. The output of the game will be either “Yes” (bit 1) or “No” (bit 0) and is generated at Bob’s place. Bob does not know the identity of k, and Alice does not know any element of the set. In a subsequent work (Shi et al in Quant Inf Process 15:363-371, <xref>2016</xref>), the authors proposed a quantum scheme for private set intersection (PSI) where the client (Alice) gets the intersected elements with the help of a server (Bob) and the server knows nothing. In the present draft, we extended the game to compute the intersection of two computationally indistinguishable sets X and Y possessed by Alice and Bob, respectively. We consider Alice and Bob as rational players, i.e. they are neither “good” nor “bad”. They participate in the game towards maximizing their utilities. We prove that in this rational setting, the strategy profile ((cooperate, abort), (cooperate, abort)) is a strict Nash equilibrium. If ((cooperate, abort), (cooperate, abort)) is strict Nash, then fairness and correctness of the protocol are guaranteed.
- Subjects
NOISE; REASON; QUANTUM cryptography; DATING services; DATA mining
- Publication
Quantum Information Processing, 2018, Vol 17, Issue 8, p1
- ISSN
1570-0755
- Publication type
Article
- DOI
10.1007/s11128-018-1968-9