Abstract

This paper proposes two quantum privacy query protocols. In the single vector sub-privacy query of protocol 1, it is proposed for the first time to distinguish different measurement results by publishing 2 bits of classic information. In the protocol, the database Bob selects the Z base and the Bell base to measure the particles sent by Alice according to the key value of the encrypted database and publishes 2 bits of classic information based on the measurement results. The user Alice infers the key value of the encrypted database through these two pieces of classic information. In the two-way quantum privacy query of protocol 2, the database Bob measures the particles sent back by Alice, converts the measurement result into a key value of length 3, and prepares a particle that is the same as the measurement result and sends it back to Alice. Alice returns the measurement of particles can infer a set of data encryption keys, and the length of each key is 3 bits. Users in the two protocols proposed in the article can obtain the query key with a probability of 1/4. As the key length increases, the number of query bits in protocol 2 decreases, but the probability of execution failure increases. But protocol 2 has a higher quantum efficiency. Both protocols can guarantee the privacy of users and databases.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call