2016
DOI: 10.1007/s11128-016-1367-z
|View full text |Cite
|
Sign up to set email alerts
|

Novel classical post-processing for quantum key distribution-based quantum private query

Abstract: Existing classical post-processing (CPP) schemes for quantum key distribution (QKD)-based quantum private queries (QPQs) including the k N → N , N → N , and r M → N ones have been found imperfect in terms of communication efficiency and security. In this paper, we propose a novel CPP scheme for QKD-based QPQs. The proposed CPP scheme reduces the communication complexity and improves the security of QKD-based QPQ protocols largely. Furthermore, the proposed CPP scheme can provide a multi-bit query efficiently.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
7
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 41 publications
(7 citation statements)
references
References 27 publications
(18 reference statements)
0
7
0
Order By: Relevance
“…Step6: Next, we use a more advanced post-processing method to improve the security of the protocol [24]. After quantum key distribution, Bob and Alice will get an n-bit raw key, which we define as R. Bob knows every qubit information in R and Alice only knows a half of them, N represents the number of entries.…”
Section: Protocol Processmentioning
confidence: 99%
“…Step6: Next, we use a more advanced post-processing method to improve the security of the protocol [24]. After quantum key distribution, Bob and Alice will get an n-bit raw key, which we define as R. Bob knows every qubit information in R and Alice only knows a half of them, N represents the number of entries.…”
Section: Protocol Processmentioning
confidence: 99%
“…Existing works on QPQ mainly research from three aspects: research on the methods of oblivious key distribution [9], [10], [12]- [21], research on the classic post-processing (CPP) algorithms [20], [22]- [24] and research on the ways to stand against channel noise [21], [23], [25]. In the first aspect, Gao et al [9] and Yang et al [10] proposed flexible QPQ protocols, which use the thoughts of B92 protocol [11] to improve J-protocol.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, Gao et al [23] proposed an effective error-correction method which makes such QPQ more practical. Regarding the communication efficiency and security, Yang et al [24] presented a novel CPP scheme to reduce the communication complexity and improve the security. In terms of ways to stand against channel noise, Chan et al [21] proposed a fault-tolerant QPQ protocol in which a novel error-correction algorithm is used to cope with noisy channels, accompanied by a proof-ofconcept demonstration of the protocol over a deployed fiber.…”
Section: Introductionmentioning
confidence: 99%
“…The CPP algorithm of the oblivious key is of vital importance to the efficiency and security of QPDQ protocols. Some CPP algorithms have been proposed 8 25 26 . For example, J-protocol gave a kN → N method, that is, it transforms a raw key with length kN into an N -bit final key, which requires a communication complexity of Ο( N log N ) (here N is the total number of items in the database) 8 .…”
mentioning
confidence: 99%
“…To solve the linear correlation among the adjacent final bits, Yang et al . 26 proposed a nonlinear CPP scheme for QKD-based QPDQs.…”
mentioning
confidence: 99%