A communication-efficient private matching scheme in Client–Server model

Zhang

2019

IEEE Access

Private Set Intersection Cardinality (PSI-CA) is to compute privately the cardinality of the intersection of two sets, and there are many practical applications of PSI-CA, e.g., data mining and data analysis with the privacy protection. The current classical protocols for PSI-CA could not resist the attacks of quantum computers. In this paper, we present a novel quantum protocol for PSI-CA based on the basic laws of quantum mechanics, which can resist well-known quantum attacks. This protocol utilizes single photons as quantum resources and only needs to apply simple single-photon operators and measurements. Therefore, it is more feasible to implement this protocol, compared with the related quantum protocols, which require entangled states and other complicated operators.

Section: Introductionmentioning

confidence: 99%

A Feasible Quantum Protocol for Private Set Intersection Cardinality

Zhang

2019

IEEE Access

“…The client will learn the intersection of the two sets and the server will learn nothing [1]. PSI is also known as Private Matching (PM) [2].…”

Section: Introductionmentioning

confidence: 99%

“…Because of its importance and wide applicability, many schemes for PSI and its variants have been proposed [1][2][3][10][11][12][13][14][15]. Among these schemes, the most efficient PSI scheme requires ( + ) costs in communication complexity, which increases linearly with both the client's set size, , and the server's set size, .…”

Section: Introductionmentioning

confidence: 99%

“…Generally speaking, the size of the server's set is larger than that of the client's set. In order to reduce the communication complexity further, Wu et al [2] presented an efficient PM scheme for very large , which requires ( 2 ) costs in communication complexity. As we know, quantum cryptography has the advantage of higher security than classical cryptography.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient quantum scheme for Private Set Intersection

Zhong

et al. 2015

Quantum Inf Process

Private Set Intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multiparty collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for Private Set Intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server's set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks. Abstract. Private set intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multi-party collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for private set intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server's set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks. Disciplines Engineering | Science and Technology Studies

“…But Alice does not want him to know which member it is. Oblivious Set-member Decision can be used to privately compute multi-party set intersection and union which are widely applied in some privacy-preserving and information-sharing settings 17 . In addition, there are also lots of practical applications of Oblivious Set-member Decision in fields of the identifiable or verifiable circumstances, such as anonymous authentication, electronic voting and electronic auction.…”

mentioning

confidence: 99%

Two Quantum Protocols for Oblivious Set-member Decision Problem

Zhong

et al. 2015

Sci Rep

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology.