Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Britton Quist

dblp:10/7086 · also Britton T. Quist · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Cryptographic primitives and cryptanalysis · 50%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.212013
Optimal Channel Estimation in Beamformed Systems for Common-Randomness-Based Secret Key Establishment · IEEE Trans. Inf. Forensics Secur. 2013
Cryptographic protocols and secure computation › key exchange
secret key agreement
0.212013
Optimal Channel Estimation in Beamformed Systems for Common-Randomness-Based Secret Key Establishment · IEEE Trans. Inf. Forensics Secur. 2013
Cryptographic primitives and cryptanalysis › key generation
wireless key establishment
0.212013
Optimal Channel Estimation in Beamformed Systems for Common-Randomness-Based Secret Key Establishment · IEEE Trans. Inf. Forensics Secur. 2013
Physical-layer communications
MIMO
0.012013
Optimal Channel Estimation in Beamformed Systems for Common-Randomness-Based Secret Key Establishment · IEEE Trans. Inf. Forensics Secur. 2013
Physical-layer communications › signal processing for communications › array signal processing
spatial covariance
0.012013
Optimal Channel Estimation in Beamformed Systems for Common-Randomness-Based Secret Key Establishment · IEEE Trans. Inf. Forensics Secur. 2013

Methods — techniques the papers use, named apart from their topics

stochastic geometry · 0.3convex optimization · 0.3
YearPublicationVenuePosition
2015 Maximization of the Channel-Based Key Establishment Rate in MIMO Systems
abstract
Keys for symmetric encryption can be established by generating key bits from the mutually-observed randomness present within estimates of a reciprocal wireless channel. We consider this approach for key establishment in multiple-input multiple-output (MIMO) systems and provide a channel estimation strategy that increases the key rate, or the mutual information between the channel estimates at the two nodes. The technique applies MIMO transmit and receive beamformers derived from the eigenvectors of the covariance matrix and then iteratively optimizes the power allocated to each transmit beamformer. Simulation results demonstrate the iterative behavior and the achieved performance of the proposed algorithm.
Britton Quist, Michael A. Jensen
IEEE Trans. Wirel. Commun.1
2013 Optimal Channel Estimation in Beamformed Systems for Common-Randomness-Based Secret Key Establishment
abstract
Establishing secret keys from the commonly-observed randomness of reciprocal wireless propagation channels has recently received considerable attention. We consider such key establishment between two multiantenna nodes that use beamforming for communication, showing that the upper bound on the number of key bits that can be generated from the channel observations can be maximized by properly probing the channel. Specifically, we demonstrate that the eigenvectors of the channel spatial covariance matrix should be used as beamformer weights during channel estimation and we optimize the energy allocated to channel estimation for each beamformer weight under a total energy constraint. Finally, by assuming that the channel covariance is separable, we illustrate implementation of the technique for practical beamforming systems and more advanced signal models that incorporate antenna mutual coupling.
Britton Quist, Michael A. Jensen
IEEE Trans. Inf. Forensics Secur.1
2013 Maximizing the Secret Key Rate for Informed Radios under Different Channel Conditions
abstract
The performance of techniques for establishing secret encryption keys from the reciprocal electromagnetic propagation between two wireless radios is generally measured by comparing the number of key bits generated to the key rate, or the information theoretic bound on the number of key bits that can be determined for a single independent channel estimate. While typically this bound is computed by assuming that the radios have no information regarding the channel, recent work has demonstrated an approach for computing this bound for nodes using beamformed antenna arrays that know the spatial covariance of a wide-sense stationary channel. Since this bound does not directly indicate how to perform practical channel estimation to obtain estimates that can achieve the bound, the prior work demonstrates an approximation that indicates a practical channel estimation procedure while yielding a mutual information near that of the key rate in rich multipath fading environments. This paper demonstrates appreciable degradation in the mutual information achieved using this approximation when the channel includes a line-of-sight component and proposes a modified approximation technique that performs well over a broad range of propagation conditions.
Britton Quist, Michael A. Jensen
IEEE Trans. Wirel. Commun.1