# Difference between revisions of "Quantization - Reliability versus Secrecy"

(Created page with "In real-world realizations, the digital representations of channel measurements are provided by virtually all digital receivers to a communication party, however, they are usu...") |
|||

Line 20: | Line 20: | ||

instead of Shannon entropy estimators widely known from information theoretical approaches. | instead of Shannon entropy estimators widely known from information theoretical approaches. | ||

Note that in several works | Note that in several works | ||

− | <ref>Gilles Brassard and Louis Salvail. Secret-key reconciliation by public discussion. In | + | <ref name="c29">Gilles Brassard and Louis Salvail. Secret-key reconciliation by public discussion. In |

Tor Helleseth, editor, Advances in Cryptology - EUROCRYPT ’93, Workshop on the | Tor Helleseth, editor, Advances in Cryptology - EUROCRYPT ’93, Workshop on the | ||

Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, | Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, | ||

1993, Proceedings, volume 765 of Lecture Notes in Computer Science, pages 410–423. | 1993, Proceedings, volume 765 of Lecture Notes in Computer Science, pages 410–423. | ||

Springer, 1993.</ref> | Springer, 1993.</ref> | ||

− | <ref>Junxing Zhang, Sneha Kumar Kasera, and Neal Patwari. Mobility assisted secret key | + | <ref name="c239">Junxing Zhang, Sneha Kumar Kasera, and Neal Patwari. Mobility assisted secret key |

generation using wireless link signatures. In INFOCOM 2010. 29th IEEE International | generation using wireless link signatures. In INFOCOM 2010. 29th IEEE International | ||

Conference on Computer Communications, Joint Conference of the IEEE Computer and | Conference on Computer Communications, Joint Conference of the IEEE Computer and | ||

Communications Societies, 15-19 March 2010, San Diego, CA, USA, pages 261–265. | Communications Societies, 15-19 March 2010, San Diego, CA, USA, pages 261–265. | ||

IEEE, 2010.</ref> | IEEE, 2010.</ref> | ||

− | <ref>Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam Smith. Fuzzy extractors: | + | <ref name="c51">Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam Smith. Fuzzy extractors: |

How to generate strong keys from biometrics and other noisy data. SIAM J. Comput., | How to generate strong keys from biometrics and other noisy data. SIAM J. Comput., | ||

38(1):97–139, 2008.</ref> | 38(1):97–139, 2008.</ref> | ||

Line 48: | Line 48: | ||

# randomness | # randomness | ||

As it has been pointed out in | As it has been pointed out in | ||

− | <ref>Suhas Mathur, Wade Trappe, Narayan B. Mandayam, Chunxuan Ye, and Alex Reznik. | + | <ref name="c132">Suhas Mathur, Wade Trappe, Narayan B. Mandayam, Chunxuan Ye, and Alex Reznik. |

Radio-telepathy: extracting a secret key from an unauthenticated wireless channel. In J. J. | Radio-telepathy: extracting a secret key from an unauthenticated wireless channel. In J. J. | ||

Garcia-Luna-Aceves, Raghupathy Sivakumar, and Peter Steenkiste, editors, Proceedings of the 14th Annual International Conference on Mobile Computing and Networking, MOBICOM | Garcia-Luna-Aceves, Raghupathy Sivakumar, and Peter Steenkiste, editors, Proceedings of the 14th Annual International Conference on Mobile Computing and Networking, MOBICOM | ||

2008, San Francisco, California, USA, September 14-19, 2008, pages 128–139. | 2008, San Francisco, California, USA, September 14-19, 2008, pages 128–139. | ||

ACM, 2008. formerly known as: mathur2008radio</ref> and | ACM, 2008. formerly known as: mathur2008radio</ref> and | ||

− | <ref>Suman Jana, Sriram Nandha Premnath, Mike Clark, Sneha Kumar Kasera, Neal Patwari, | + | <ref name="c103">Suman Jana, Sriram Nandha Premnath, Mike Clark, Sneha Kumar Kasera, Neal Patwari, |

and Srikanth V. Krishnamurthy. On the effectiveness of secret key extraction from | and Srikanth V. Krishnamurthy. On the effectiveness of secret key extraction from | ||

wireless signal strength in real environments. In Kang G. Shin, Yongguang Zhang, Rajive | wireless signal strength in real environments. In Kang G. Shin, Yongguang Zhang, Rajive | ||

Line 67: | Line 67: | ||

mismatches would increase the effort of reconciliation. As a consequence, robustness has been | mismatches would increase the effort of reconciliation. As a consequence, robustness has been | ||

considered to be a fundamental quality indication | considered to be a fundamental quality indication | ||

− | <ref | + | <ref name="c132"/> |

− | + | <ref name="c103"/> | |

− | + | <ref name="c148">Neal Patwari, Jessica Croft, Suman Jana, and Sneha Kumar Kasera. High-rate uncorrelated | |

− | |||

− | |||

− | <ref | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | <ref>Neal Patwari, Jessica Croft, Suman Jana, and Sneha Kumar Kasera. High-rate uncorrelated | ||

bit extraction for shared secret key generation from channel measurements. IEEE | bit extraction for shared secret key generation from channel measurements. IEEE | ||

Trans. Mob. Comput., 9(1):17–30, 2010.</ref> | Trans. Mob. Comput., 9(1):17–30, 2010.</ref> | ||

− | <ref>Babak Azimi-Sadjadi, Aggelos Kiayias, Alejandra Mercado, and B¨ulent Yener. Robust key | + | <ref name="c17">Babak Azimi-Sadjadi, Aggelos Kiayias, Alejandra Mercado, and B¨ulent Yener. Robust key |

generation from signal envelopes in wireless networks. In Peng Ning, Sabrina De Capitani | generation from signal envelopes in wireless networks. In Peng Ning, Sabrina De Capitani | ||

di Vimercati, and Paul F. Syverson, editors, Proceedings of the 2007 ACM Conference on | di Vimercati, and Paul F. Syverson, editors, Proceedings of the 2007 ACM Conference on | ||

Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October | Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October | ||

28-31, 2007, pages 401–410. ACM, 2007.</ref> | 28-31, 2007, pages 401–410. ACM, 2007.</ref> | ||

− | <ref>Qian Wang, Hai Su, Kui Ren, and Kwangjo Kim. Fast and scalable secret key generation | + | <ref name="c205">Qian Wang, Hai Su, Kui Ren, and Kwangjo Kim. Fast and scalable secret key generation |

exploiting channel phase randomness in wireless networks. In INFOCOM 2011. 30th | exploiting channel phase randomness in wireless networks. In INFOCOM 2011. 30th | ||

327 IEEE International Conference on Computer Communications, Joint Conference of the | 327 IEEE International Conference on Computer Communications, Joint Conference of the |

## Revision as of 12:48, 30 October 2017

In real-world realizations, the digital representations of channel measurements are provided by virtually all digital receivers to a communication party, however, they are usually not fully identical. The non-perfect reciprocity in measurement in addition with noise leads to errors in the bit vectors of the preliminary key material. To make the system more robust against nonperfect symmetric channels further quantization is applied. The idea is that, for example, fewer quantization stages or artifact-based profile selection and quantization makes the system more robust. In all recent works, channel profiles are further quantized into bit vectors to obtain the initial preliminary key material. The overall aim is to achieve with a high probability synchronized key material unknown to others. An important security question for a given attacker model and for a given quantization scheme is therefore: How robust is secure enough? This is in particular interesting because the presence of a passive eavesdropper is a fundamental part of the system model and must be considered. While for channel profiles the mutual information and secret-key rate are the metrics of choice, after quantization the metric BER simplifies the analyses. The BER between measurements of Alice and Bob represents the efficiency. The BER between measurements of Bob and Eve represents the security. Additionally to the distributed source coding problem, the amount of extracted (worst-case) bit-entropy is of importance. As a result, three features are of essential interest for designing new and analyzing previous schemes:

- BER between legitimate notes (for robustness)
- BER to a potential attacker in a defined vicinity (attacker model)
- the amount of bit-entropy/randomness (for security and efficiency)

All three features might be sufficiently addressable in a stationary scenario (providing a
stationary random process) using a single metric: the secrecy rate or a lower bound on secrecy
capacity. However, due to the fact that non-stationary environments are virtually always the
source of common entropy in relevant scenarios, we introduce blockwise evaluation strategies.
Furthermore, we introduce on-line entropy estimation using cryptographic approved mechanisms
instead of Shannon entropy estimators widely known from information theoretical approaches.
Note that in several works
^{[1]}
^{[2]}
^{[3]}
for detecting and correcting bit errors different information reconciliation approaches were presented. Reconciliation represents an alternative
and/or an extension to align the initial preliminary key material. However, the performance of
secure reconciliation schemes is also limited. To be precise, we analyze and discuss this fact in the page Information Reconciliation.

## Contents

## Related Work on Evaluation Methodologies of Quantization Schemes for CRKG

Over the last years, there have been a lot of inspiring publications in the field of channel based key generation. Especially the issue of finding an optimal quantization scheme has been extensively studied. As a result, many different approaches focusing on the improvement of individual performance aspects are available. In particular, three fundamental performance metrics have been identified in literature:

- Initial Key Generation Rate (IKGR)
- Bit Error Rate (BER),
- randomness

As it has been pointed out in
^{[4]} and
^{[5]}, usually there is a trade-off between these metrics.
This can be well demonstrated by applying the level-crossing scheme proposed in the first section mentioned above. The
authors use a guard band to decrease the BER, thus also decreasing the IKGR, since possibly
valuable information is dropped. In order to further decrease the mismatch probability, they
employ an excursion detection scheme by which sequences of equal symbols can be detected.
Hence, redundancy is reduced. However, a quantization resulting in high BER has always
been considered to be useless, since identical secret keys are required and a high number of
mismatches would increase the effort of reconciliation. As a consequence, robustness has been
considered to be a fundamental quality indication
^{[4]}
^{[5]}
^{[6]}
^{[7]}
^{[8]}.
A common evaluation strategy of the security (robustness versus security) for practiceoriented
CRKE schemes is based on channel measurements. In the past (extensive) channel
measurement campaigns have been performed with respect to legitimate participants and potential
passive adversaries, succeeded with an analysis of the goodness of the preliminary key
material applying off-line statistical tests
^{[9]}
^{[10]}
^{[11]}
^{[12]}
^{[13]}.
This analysis is suitable for environments with stationary statistics. However, such environments are hard to guarantee or to determine in practice.
Several prior works — our first approaches included — demonstrated a low probability of
success for potential passive attacks on quantization schemes based on individual experimental
measurements, e.g., by
^{[14]}
^{[15]}
^{[16]}
^{[17]}
^{[18]}
^{[19]}
^{[20]}
^{[21]}
^{[22]}. However, little attention has been paid to a secure CRKE scheme against active attackers. In particular, attackers who attack systems in low-entropy environments or attackers who have active control over the environment.
Jana and Premnath et al.
^{[23]}
^{[24]}
proposed the first analysis of different quantization
schemes introducing entropy estimations. The authors evaluated different schemes
^{[25]}
^{[26]}
^{[27]}
^{[28]}
^{[29]}.
They analyzed the statistical properties off-line by calculating the Shannon
entropy. As the entropy of the key material may decrease due to changes in the environment,
solely applying such estimations offline may not be sufficient for security applications.
A theoretical analysis of the BER vs. Pearson correlation behavior of several quantization
schemes
^{[30]}
^{[31]}
^{[32]}
^{[33]}
^{[34]}
was introduced by Guillaume et al. ^{[35]}.
This work extends those of
^{[36]}
^{[37]}
^{[38]}
by (1) analyzing the ’BER vs. Pearson correlation coefficient’ behavior of further recent practice-oriented protocols via simulation, (2) introducing a real-world-based evaluation strategy of 10 protocols, (3) demonstrating experimental validation of indoor channels decorrelation behavior, (4) introducing results of on-line entropy estimation for security level verification, and (5) demonstrating first results of key extraction efficiency using mutual information.

## Basis of Fair Comparison

The design and analysis of quantization schemes for CRKE are complex because the key material
is subject to both simultaneous reliability and secrecy constraints. Due to a trade-off between
the fundamental performance metrics IKGR, BER and randomness, optimizing a quantization
scheme for all these metrics is not trivial. Especially robustness, hence low BER, has been
commonly pursued when a quantization scheme is designed — as we will see later in this
chapter. However, tuning the quantization to robustness at all cost is heavily affecting the
system’s vulnerability to eavesdropping. In the following, we will present a way of evaluating a system’s reliability and secrecy constraints in a general manner.
Based on the source model, let us assume the channel measurements **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle h_{\beta\alpha}}**
and **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle h_{\alpha\beta}}**
are taken by two nodes **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \alpha}**
and **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \beta}**
, respectively. Since a communication channel is reciprocal, **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle h_{\beta\alpha}}**
and **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle h_{\alpha\beta}}**
are correlated. The degree of correlation can be measured by the Pearson correlation coefficient **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \rho_{\alpha\beta}}**
. During the key generation process, **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle h_{\beta\alpha}}**
and **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle h_{\alpha\beta}}**
are given into quantization blocks to generate binary sequences **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \gamma_\alpha}**
and **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \gamma_\beta}**
.
In order to evaluate the scheme’s robustness and security, we compute the BER between the
output of the quantizers of **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \alpha}**
and **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \beta}**
over the input correlation. The performance is evaluated using the IKGR as well as statistical testing such as online entropy estimation. Figure 6.1 // TODO ADD IMAGE
exemplary shows how the BER decreases with increasing correlation coefficient **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \rho}**
in case of two different quantization schemes. As can be seen, scheme 1 is less robust than scheme 2, since it causes more mismatches between the two sequences **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle y_\alpha}**
and **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle y_\beta}**
.
To evaluate every scheme’s performance, we use the BER, the IKGR. As a function of the
correlation coefficient, these metrics are a good basis for a robustness versus security evaluation.
Moreover, such representation helps to analyze drawbacks of half duplex transmission, since
the implied delay will reduce the measurements’ correlation. To evaluate potential statistical
defects, e.g., biasing, we evaluate NIST p-values and online entropy estimation.
Given a correlation coefficient **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \rho_0}**
measured in real environmental conditions, depending on the required maximum BER **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \rho_{b,req}}**
scheme 1 or scheme 2 can be chosen. However, considering a passive eavesdropper E, the channel measurements of two legitimate nodes A and B are possibly correlated to E’s observation. Thus, again we can use **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \rho_{\alpha\beta}}**
with **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \alpha, \beta \in \{A, B, E \}}**
as
a quantitive representation of the similarity between respective channel measurements. As a
consequence, the representation given in Figure 6.1 also holds for an attacker who is assumed to know the currently used quantization scheme. Obviously, a robust quantization technique with
low BER is also beneficial for an attacker. In case of quantization scheme 2, for a correlation
coefficient of **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \rho_0= 0.8}**
such an attacker’s bit sequence would disagree by only 6 %, while A’s and
B’s keys disagree by around 1.7 %. Considering that A and B still have to align all mismatches,
the attacker would have already known a significant amount of secret bits, making the key
generation process very inefficient.

## Blockwise evaluation: Pros and Cons

In the past, researchers (e.g.,
^{[39]}
^{[40]}
^{[41]}) have estimated the reciprocity of their gathered channel profiles using the Pearson correlation coefficient **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle \rho}**
. Therefore, for each measurement series
a corresponding correlation coefficient was provided. However, because one single correlation
value over a large measurement series (e.g., with 1 000 000 channel profiles) is not convincing, we evaluate channel profiles and quantization outputs blockwise. Please refer to Figure 6.2. for the illustration of an example. Blockwise evaluation gives us the ability to evaluate, for example, the reciprocity over time with a lower uncertainty (according to Heisenberg’s uncertainty relationship of communication engineering). This is advantageous since channel profiles may include static as well as dynamic sequences. Furthermore, most quantizations schemes are based on thresholds, which are based on statistical values, such as mean and variance. Dividing channel profiles into blocks increases the extracted entropy, because slow fading effects do not contribute predominately into the key material. Therefore, our metric of choice for practice oriented evaluation is blockwise.

// TODOOO IMAGE S.141

To achieve initial key material with a maximum of secret information concerning a passive
adversary, the BER between a potential eavesdropper and Alice or Bob should be 0.5. As an
example, we present a blockwise quantization output in Figure 6.3.
Next, we want to information-theoretically analyze the statistics such as entropy **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle H(X), H(Y ), and H(X, Y )}**
, mutual information **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle I(X; Y ) and I(X;Z)}**
, equivocation **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle H(X|Y)}**
, as well as irrelevance **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://api.formulasearchengine.com/wikimedia.org/v1/":): {\displaystyle H(Y|X)}**
. In the analysis of interest X represents the channel profiles and Y represents the output of the quantization scheme. As mentioned above, we utilize the kNNE of Kraskov et al. to estimate the statistics. However, the kNNE requires 4000 input sets ^{[42]}, which conflicts with the blockwise evaluation strategy.
Using blockwise quantization may result in an inconsistent mapping from identical input
values to different output values. The problem is explained using an example: for Q4 and an
estimator width of 8 the sample −54 gets inconsistently mapped to 2 and 3, whereas for Q8 it
is consistently mapped to 2.

## References

- ↑ Gilles Brassard and Louis Salvail. Secret-key reconciliation by public discussion. In Tor Helleseth, editor, Advances in Cryptology - EUROCRYPT ’93, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings, volume 765 of Lecture Notes in Computer Science, pages 410–423. Springer, 1993.
- ↑ Junxing Zhang, Sneha Kumar Kasera, and Neal Patwari. Mobility assisted secret key generation using wireless link signatures. In INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA, pages 261–265. IEEE, 2010.
- ↑ Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput., 38(1):97–139, 2008.
- ↑
^{4.0}^{4.1}Suhas Mathur, Wade Trappe, Narayan B. Mandayam, Chunxuan Ye, and Alex Reznik. Radio-telepathy: extracting a secret key from an unauthenticated wireless channel. In J. J. Garcia-Luna-Aceves, Raghupathy Sivakumar, and Peter Steenkiste, editors, Proceedings of the 14th Annual International Conference on Mobile Computing and Networking, MOBICOM 2008, San Francisco, California, USA, September 14-19, 2008, pages 128–139. ACM, 2008. formerly known as: mathur2008radio - ↑
^{5.0}^{5.1}Suman Jana, Sriram Nandha Premnath, Mike Clark, Sneha Kumar Kasera, Neal Patwari, and Srikanth V. Krishnamurthy. On the effectiveness of secret key extraction from wireless signal strength in real environments. In Kang G. Shin, Yongguang Zhang, Rajive Bagrodia, and Ramesh Govindan, editors, Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, MOBICOM 2009, Beijing, China, September 20-25, 2009, pages 321–332. ACM, 2009. - ↑ Neal Patwari, Jessica Croft, Suman Jana, and Sneha Kumar Kasera. High-rate uncorrelated bit extraction for shared secret key generation from channel measurements. IEEE Trans. Mob. Comput., 9(1):17–30, 2010.
- ↑ Babak Azimi-Sadjadi, Aggelos Kiayias, Alejandra Mercado, and B¨ulent Yener. Robust key generation from signal envelopes in wireless networks. In Peng Ning, Sabrina De Capitani di Vimercati, and Paul F. Syverson, editors, Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007, pages 401–410. ACM, 2007.
- ↑ Qian Wang, Hai Su, Kui Ren, and Kwangjo Kim. Fast and scalable secret key generation exploiting channel phase randomness in wireless networks. In INFOCOM 2011. 30th 327 IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 10-15 April 2011, Shanghai, China, pages 1422–1430. IEEE, 2011.
- ↑ 132
- ↑ 103
- ↑ 148
- ↑ 11
- ↑ 226
- ↑ 15
- ↑ 17
- ↑ 132
- ↑ 103
- ↑ 81
- ↑ 148
- ↑ 11
- ↑ 226
- ↑ 227
- ↑ 103
- ↑ 154
- ↑ 132
- ↑ 15
- ↑ 191
- ↑ 17
- ↑ 103
- ↑ 191
- ↑ 15
- ↑ 132
- ↑ 103
- ↑ 11
- ↑ 76
- ↑ 103
- ↑ 154
- ↑ 76
- ↑ 15
- ↑ 148
- ↑ 81
- ↑ 113