An efficient quantum scheme for Private Set Intersection

Shi, Ronghua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

doi:10.1007/s11128-015-1165-z

Cited by 40 publications

(24 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3. Any type of deviation of Alice in steps 12,13,14,15,16,17 and 18 such as avoiding error checking, operating U swap and U cnot improperly or conveying wrong values of t and q t to Bob will lead her to wrong values of the functionality. So she should have no incentive to deviate in those rounds of the protocol Π.…”

Section: Atmentioning

confidence: 99%

“…In this regard, we like to point out that the procedure described in [12,13] to detect measure and resend attack by Bob, requires a more detailed analysis and certain revision. In [12], to detect the attack, the author inserted l − 1 decoy states encoded as 1 √ 2 (|0 + |j i ), where j i ∈ Z * N .…”

mentioning

confidence: 99%

“…Each j i is represented by log 2 N bits. In [13], the same type of encoding is exploited to mask the set elements of the client's set. In both the papers, it is commented that if Bob tries to measure those states, he will introduce noise in the channel which can be detected by Alice by measuring the states in { 1 √ 2 (|0 + |j i ), 1 √ 2 (|0 − |j i )} basis.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Quantum secure two-party computation for set intersection with rational players

Maitra

2018

Quantum Inf Process

View full text Add to dashboard Cite

Recently, Shi et al. (Phys. Rev. A, 2015) proposed Quantum Oblivious Set Member Decision Protocol (QOSMDP) where two legitimate parties, namely Alice and Bob, play a game. Alice has a secret k and Bob has a set {k1, k2, · · · kn}. 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 (Quant. Inf. Process., 2016), 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 as well as correctness of the protocol are guaranteed.

show abstract

Section: Atmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Quantum secure two-party computation for set intersection with rational players

Maitra

2018

Quantum Inf Process

View full text Add to dashboard Cite

show abstract

“…However, in current phase-encoded QPQ protocols [4][5][6] as long as the returned system is in state…”

Section: Analysis Of Phase-encoded Qpqmentioning

confidence: 99%

“…In comparison with the original QPQ protocol [3], the phase-encoded QPQ protocol displays two prominent advantages: lower communication cost and better implementability. Due to its good properties, there are lots of important applications of phase-encoded QPQ especially in some privacy-preserving settings, such as oblivious setmember decision [5], private set intersection [6], secure data mining [7], and so on.…”

Section: Introductionmentioning

confidence: 99%

Comment on “Secure quantum private information retrieval using phase-encoded queries”

Shi

Zhong

et al. 2016

Phys. Rev. A

Self Cite

View full text Add to dashboard Cite

S. (2016). Comment on "secure quantum private information retrieval using phase-encoded queries". Physical Review A -Atomic, Molecular, and Optical Physics, 94 (6), 066301-1-066301-4.Comment on "secure quantum private information retrieval using phaseencoded queries" Abstract 2016 American Physical Society.In this Comment, we reexamine the security of phase-encoded quantum private query (QPQ). We find that the current phase-encoded QPQ protocols, including their applications, are vulnerable to a probabilistic entangle-and-measure attack performed by the owner of the database. Furthermore, we discuss how to overcome this security loophole and present an improved cheat-sensitive QPQ protocol without losing the good features of the original protocol. Comment on "Secure quantum private information retrieval using phase-encoded queries" In this Comment, we reexamine the security of phase-encoded quantum private query (QPQ). We find that the current phase-encoded QPQ protocols, including their applications, are vulnerable to a probabilistic entangle-and-measure attack performed by the owner of the database. Furthermore, we discuss how to overcome this security loophole and present an improved cheat-sensitive QPQ protocol without losing the good features of the original protocol.

show abstract

Three‐level quantum satellite communication framework and its applications

Zhu

Wang

et al. 2021

Satell Commun Network

View full text Add to dashboard Cite

Summary Quantum cryptography uses quantum natures to realize unconditional security without computational hard problems, which can achieve lots of significant applications of secure communication, multiparty secure computation, E‐commerce, and so on. Even it can get the free‐space optical communication with quantum channel. In this paper, we firstly proposed a three‐level quantum satellite communication framework that covers dozens of common solutions. Among the solutions, we select and give a quantum semi‐honest and semi‐quantum mutual authenticated key agreement scheme with three‐particle entangled states, which can provide secure service for cross‐realm traditional clients with quantum satellite and super nodes. More important, by the quantum satellite's helping, the quantum satellite and the two super nodes can authenticate each other, but the three nodes cannot get any information of the session key between the cross‐realm clients. The proposed scheme has the properties of completeness, information theoretic security, nonrepudiation, and unforgeability. Its information‐theoretic security is ensured by quantum indistinguishability mechanics. On the other hand, our scheme is more efficient than the similar schemes.

show abstract

An efficient quantum scheme for Private Set Intersection

Cited by 40 publications

References 23 publications

Quantum secure two-party computation for set intersection with rational players

Quantum secure two-party computation for set intersection with rational players

Comment on “Secure quantum private information retrieval using phase-encoded queries”

Three‐level quantum satellite communication framework and its applications

Contact Info

Product

Resources

About