• Corpus ID: 2799802

Keys through ARQ

@article{Latif2009KeysTA,
  title={Keys through ARQ},
  author={Mohamed Abdel Latif and Ahmed Sultan and Hesham El Gamal},
  journal={ArXiv},
  year={2009},
  volume={abs/0908.0014}
}
This paper develops a novel framework for sharing secret keys using the well-known Automatic Repeat reQuest (ARQ) protocol. The proposed key sharing protocol does not assume any prior knowledge about the channel state information (CSI), but, harnesses the available opportunistic secrecy gains using only the one bit feedback, in the form of ACK/NACK. The distribution of key bits among multiple ARQ epochs, in our approach, allows for mitigating the secrecy outage phenomenon observed in earlier… 
View PDF on arXiv
1 Citations

One Citation

ARQ secrecy over correlated fading channels

A novel role of “dumb antennas” in overcoming the negative impact of spatial correlation, on the achievable secrecy rates, is unveiled and an adaptive rate allocation policy is developed which achieves higher secrecy rates by exploiting the channel temporal correlation.

References

SHOWING 1-10 OF 16 REFERENCES

On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels

This paper defines the connection outage and secrecy outage probabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link and demonstrates the benefits of HARQ protocols to throughput and secrecy.

On the Secrecy Capacity of Fading Channels

The positive impact of fading on the secrecy capacity is revealed and the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels is established.

Applications of LDPC Codes to the Wiretap Channel

This correspondence provides an alternative view of the proof for secrecy capacity of wire tap channels and shows how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel, and shows that it is possible to construct linear-time decodable secrecy codes based on low-density parity-check codes that achieve secrecy.

On the Achievable Secrecy Throughput of Block Fading Channels with No Channel State Information at Transmitter

We study the block fading wire-tap channel, where a transmitter sends confidential messages to a legitimate receiver over a block fading channel in the presence of an eavesdropper, which listens to…

On achieving capacity on the wire tap channel using LDPC codes

This paper shows the connection between the decoding threshold of the code and its security against eavesdropping, and gives practical code constructions for some special cases of the wire tap channel that achieve the secrecy capacity as defined by Wyner.

LDPC-based secret key agreement over the Gaussian wiretap channel

This paper investigates a practical secret key agreement protocol over the Gaussian wire-tap channel. The protocol is based on an efficient information reconciliation method which allows two parties…

The wire-tap channel

  • A. Wyner
  • Computer Science
    The Bell System Technical Journal
  • 1975
This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.

Wire-tap channel II

The optimal trade-offs among the parameters K, N, and μ and the intruder's uncertainty H (H is the "conditional entropy" of the data given the μ intercepted channel bits) were found and a system exists with H ≈ K − l.

Opportunistic beamforming using dumb antennas

This paper proposes a scheme that induces random fading when the environment has little scattering and/or the fading is slow, and focuses on the downlink of a cellular system.

Elements of Information Theory

The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.