2018
DOI: 10.1109/tcomm.2018.2814607
|View full text |Cite
|
Sign up to set email alerts
|

High-Agreement Uncorrelated Secret Key Generation Based on Principal Component Analysis Preprocessing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
59
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1
1

Relationship

3
6

Authors

Journals

citations
Cited by 108 publications
(59 citation statements)
references
References 33 publications
0
59
0
Order By: Relevance
“…A practical key generation protocol was proposed in 1995 [53] and in 1996 [54]. There have been extensive interests on theoretical exploration [55], [56], modelling [57]- [61] and protocol design [62]- [65]. Thanks to the rapid development of the semiconductor industry and wireless technologies, wireless applications have become pervasive and lead to fruitful key generation prototyping and ultimately to its practical exploration.…”
Section: Key Generationmentioning
confidence: 99%
“…A practical key generation protocol was proposed in 1995 [53] and in 1996 [54]. There have been extensive interests on theoretical exploration [55], [56], modelling [57]- [61] and protocol design [62]- [65]. Thanks to the rapid development of the semiconductor industry and wireless technologies, wireless applications have become pervasive and lead to fruitful key generation prototyping and ultimately to its practical exploration.…”
Section: Key Generationmentioning
confidence: 99%
“…Denote the channel characteristics estimated during T for the user u ∈ {A, B, E} as H u with length L H , where A, B, and E represent Alice, Bob, and Eve, respectively. Secondly, the user u maps the input values from H u into output values in a bit sequence set through quantization, e.g., channel quantization with guardband (CQG) used in [20]. The quantized bit sequence is represented as Q u with length L Q .…”
Section: Secret Key Generation Processmentioning
confidence: 99%
“…Until now, there has existed unavoidable bit disagreements between Q A and Q B , caused by time delay in TDD systems, hardware differences, and noise [21]. Although some preprocessing approaches, e.g, principal component analysis (PCA) [20], are applied, the bit disagreements are not fully eliminated. However, even a bit difference in a secret key will trigger an avalanche effect, leading to complete decryption failure.…”
Section: Secret Key Generation Processmentioning
confidence: 99%
“…The contribution of principal component analysis is also investigated in [53] where theory and Monte Carlo simulations agreed on considering PCA a better pre-processing method than discrete cosine transform (DCT) and wavelet transform (WT), regarding its ability to achieve a higher generation rate. Authors also extended their previous work [50] by contrasting two versions of PCA 640 based on private and common eigenvectors.…”
Section: Accepted Manuscriptmentioning
confidence: 99%