Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio

Jost, Daniel; Maurer, Ueli; Ribeiro, João

doi:10.1007/978-3-030-03807-6_13

Cited by 9 publications

(18 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So, the maximum achievable rate or key capacity can be defined using Eq. (1) given below; whose outcome is such a key which can be used to encipher long messages [44], [45].…”

Section: Secret Key Generation: Backgroundmentioning

confidence: 99%

Ephemeral Secrets: Multi-Party Secret Key Acquisition for Secure IEEE 802.11 Mobile Ad Hoc Communication

Bhatti

Saleem

2020

IEEE Access

View full text Add to dashboard Cite

Mobile ad hoc networks consist of wireless nodes and can be established quickly with minimal configuration and cost, because, they do not require any infrastructure in advance. Civil and military applications are using them extensively in emergency and mission-oriented scenarios respectively as multi-party communication systems. Whereas, the multi-party secret key acquisition is one of the acute issues in these low resource wireless ad hoc networks, especially, which are based on IEEE 802.11ah and IEEE 802.11ba (low power WiFi), IEEE 802.15.4(Zigbee), BLE, IEEE 802.15.6 (body-worn or wearable) devices. In this study, a novel low cost and robust approach has been proposed and tested to establish an identical secret key in a multiuser mobile ad hoc environment. We believe, it is one of the groundbreaking contributions toward establishing a cost-effective secret key acquisition solution with respect to memory, computation, and bandwidth. We have used Bloom-Filters to cope with these resource limitations of such wireless setups. The proposed approach has been tested using IEEE 802.11 adapters in a real environment, and we found it to be highly suitable for wireless resource-limited applications. INDEX TERMS Dynamic secret, ephemeral secrets, shared secret, wireless networks, bloom filter, mobile ad hoc networks.

show abstract

“…So, the maximum achievable rate or key capacity can be defined using Eq. (1) given below; whose outcome is such a key which can be used to encipher long messages [44], [45].…”

Section: Secret Key Generation: Backgroundmentioning

confidence: 99%

Ephemeral Secrets: Multi-Party Secret Key Acquisition for Secure IEEE 802.11 Mobile Ad Hoc Communication

Bhatti

Saleem

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…For example: Substituting a Byte, or Shifting a row, or Mixing columns, or Adding Round Key, etc... AES Algorithm is much more secure when compared to DES or 3DES [20]. There are many cryptography algorithms used to secure information divided in two groups, symmetric and asymmetric [21]. symmetric algorithms such as DES, 3DES, AES, and Asymmetric such as RSA, El Gamal and ECC [22].…”

Section: Concepts Used In Cryptographymentioning

confidence: 99%

Comparative Study of Cryptocurrency Algorithms: Coronavirus Towards Bitcoin’s Expansion

Mallouli¹,

Hellal²,

Alzahrani³

et al. 2020

Adv. sci. technol. eng. syst. j.

View full text Add to dashboard Cite

The widespread presence of Corona virus (COVID-19) is causing organizations and individuals major economics downsizing. The way this virus is transmitted from one individual to another is the real cause of the problem. For that, researchers in different fields started seriously looking for touch-less and contact-less exchange. Particularly in the finance world, cash transactions and key pad based transactions are becoming obsolete because they are some of the major causes of the spread of this virus (and other viruses and bacteria). Cryptocurrency could be one of the solutions to the above mentioned situation. This novel money is based on Blockchain technology, which is based on cryptography algorithms for the safety and the security of the transactions. This paper exhibits a comparative study of the asymmetric cryptography algorithms. This helps the user to best choose the most secure, safe and reliable method to encrypt/decrypt the transactions created in the Blockchain.

show abstract

“…The satellite setting with BSCs illustrates that twoway and multi-round public communication, unlike one-way public communication, allows to achieve a positive SK rate even when both Alice's and Bob's noisy observations of the satellite outputs have a lower quality than Eve's noisy observations. The conditions for this result to hold are that Eve's measurement channel should not be noiseless and Alice's and Bob's measurement channels should have positive channel capacities; see also [24,Section 1.4] for precise definitions.…”

Section: Introductionmentioning

confidence: 99%

“…Advantage distillation protocols aim to provide an information-theoretic advantage to the legitimate parties by selecting a subset of their observed symbols for which legitimate parties have an advantage over Eve. To focus on scenarios where advantage distillation is necessary to reliably agree on a SK, a metric called channel quality ratio is defined in [24] as the maximum of the ratio of the capacity of the Eve's BSC vs. the capacity of Alice's or Bob's BSC. For the satellite setting with BSCs, the SK capacity is shown to decrease quadratically in the channel quality ratio when it is sufficiently large, achieved by using the parity check protocol [24].…”

Section: Introductionmentioning

confidence: 99%

“…To focus on scenarios where advantage distillation is necessary to reliably agree on a SK, a metric called channel quality ratio is defined in [24] as the maximum of the ratio of the capacity of the Eve's BSC vs. the capacity of Alice's or Bob's BSC. For the satellite setting with BSCs, the SK capacity is shown to decrease quadratically in the channel quality ratio when it is sufficiently large, achieved by using the parity check protocol [24]. Furthermore, extensions of the satellite setting with BSCs to channels with binary phase shift keying (BPSK) modulated inputs and additive white Gaussian noise (AWGN) components are considered in [5], [28], the former of which proves a sufficient condition to achieve a positive SK rate and the latter proves that using soft information increases the achievable SK rate as compared to a BSC that can be obtained by applying a one-bit uniform quantization at Alice and Bob.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Effects of Quantization on the Multiple-Round Secret-Key Capacity

Günlü,

Maurer,

Ribeiro

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We consider the strong secret key (SK) agreement problem for the satellite communication setting, where a remote source (a satellite) chooses a common binary phase shift keying (BPSK) modulated input for three statistically independent additive white Gaussian noise (AWGN) channels whose outputs are observed by, respectively, two legitimate receivers (Alice and Bob) and an eavesdropper (Eve). Legitimate receivers have access to an authenticated, noiseless, two-way, and public communication link, so they can exchange multiple rounds of public messages to agree on a SK hidden from Eve. Without loss of essential generality, the noise variances for Alice's and Bob's measurement channels are both fixed to a value Q > 1, whereas the noise over Eve's measurement channel has a unit variance, so Q represents a channel quality ratio. The significant and not necessarily expected effect of quantizations at all receivers on the scaling of the SK capacity with respect to a sufficiently large and finite channel quality ratio Q is illustrated by showing 1) the achievability of a constant SK for any finite BPSK modulated satellite output by proposing a thresholding algorithm as an advantage distillation protocol for AWGN channels and 2) the converse (i.e., unachievability) bound for the case when all receivers apply a one-bit uniform quantizer to their noisy observations before SK agreement, for which the SK capacity is shown to decrease quadratically in Q. Our results prove that soft information increases not only the reliability and the achieved SK rate but also the scaling of the SK capacity at least quadratically in Q as compared to hard information.

show abstract

Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio

Cited by 9 publications

References 22 publications

Ephemeral Secrets: Multi-Party Secret Key Acquisition for Secure IEEE 802.11 Mobile Ad Hoc Communication

Ephemeral Secrets: Multi-Party Secret Key Acquisition for Secure IEEE 802.11 Mobile Ad Hoc Communication

Comparative Study of Cryptocurrency Algorithms: Coronavirus Towards Bitcoin’s Expansion

Effects of Quantization on the Multiple-Round Secret-Key Capacity

Contact Info

Product

Resources

About