Secret-Sharing LDPC Codes for the BPSK-Constrained Gaussian Wiretap Channel

Wong, Chan Wong; Wong, T.F.; Shea, John M.

doi:10.1109/tifs.2011.2139208

Cited by 39 publications

(29 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, as reconciliation of continuous variables is not needed, it can be effectively implemented through standard soft decoding techniques of a binary code in an additive white Gaussian noise (AWGN) channel with binary input. For instance, [23] employs fixed LDPC codes with syndrome transmission on the public feedback channel.…”

Section: Practical Solutionmentioning

confidence: 99%

“…Indeed, LDPC codes are state-of-the-art error correcting codes, characterized by soft decoding algorithms able to approach the unconstrained channel capacity, with limited complexity. They have al- ready found several applications in physical-layer security, either as codes for near-optimal information reconciliation in secret-key agreement schemes [8,9,23], or as codes for secure communication over wiretap channels [3,14]. In order to assess the merit of the practical solution we also consider as performance metric the security gap defined as the ratio between the legitimate and eavesdropper signal to noise ratio (SNR) which allows reliable decoding for the legitimate receiver, while keeping the eavesdropper bit error rate (BER) and frame error rate (FER) sufficiently close to 0.5 and 1, respectively.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Low-power secret-key agreement over OFDM

Renna

Laurenti

Tomasin

et al. 2013

Proceedings of the 2nd ACM Workshop on Hot Topics on Wireless Network Security and Privacy

View full text Add to dashboard Cite

Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available

show abstract

Section: Practical Solutionmentioning

confidence: 99%

mentioning

confidence: 99%

Low-power secret-key agreement over OFDM

Renna

Laurenti

Tomasin

et al. 2013

Proceedings of the 2nd ACM Workshop on Hot Topics on Wireless Network Security and Privacy

View full text Add to dashboard Cite

show abstract

“…LDPC for the Gaussian wiretap channel was suggested in [23], as well as in [24] to suggest secret sharing schemes. LDPCs were also used to allow strong secrecy over a binary erasure channel in [25].…”

Section: Secret Key Agreement Network and Practical Schemesmentioning

confidence: 99%

Wiretap channel with causal state information and secure rate-limited feedback

Cohen

2013

2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and the legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate R f .We derive upper and lower bounds on the secrecy capacity and show that, when the channel to the eavesdropper is degraded, the bounds are tight and the secrecy capacity is completely characterised.The capacity achieving scheme is based on Wyner, Csiszár and Körner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. The upper bound is more involved and requires a non-trivial recursive lemma extending previous results in the literature to include both state and feedback. We conclude the paper by showing that a few interesting known results can be seen as special cases of the above, especially the case where the state information is available only at the decoder, and the suggested scheme achieves the secrecy capacity without a source of randomness at the decoder.

show abstract

“…Recently, the Gaussian wiretap channel with constrained/finite inputs has attracted increasing research attention [4][5][6][7][8]. The closed-form expression of the secrecy capacity of the Gaussian wiretap channel with continuous input signal was given in [9].…”

Section: Introductionmentioning

confidence: 99%

On the Binary Input Gaussian Wiretap Channel with/without Output Quantization

Chen

Vinck

2017

Entropy

View full text Add to dashboard Cite

Abstract:In this paper, we investigate the effect of output quantization on the secrecy capacity of the binary-input Gaussian wiretap channel. As a result, a closed-form expression with infinite summation terms of the secrecy capacity of the binary-input Gaussian wiretap channel is derived for the case when both the legitimate receiver and the eavesdropper have unquantized outputs. In particular, computable tight upper and lower bounds on the secrecy capacity are obtained. Theoretically, we prove that when the legitimate receiver has unquantized outputs while the eavesdropper has binary quantized outputs, the secrecy capacity is larger than that when both the legitimate receiver and the eavesdropper have unquantized outputs or both have binary quantized outputs. Further, numerical results show that in the low signal-to-noise ratio (SNR) (of the main channel) region, the secrecy capacity of the binary input Gaussian wiretap channel when both the legitimate receiver and the eavesdropper have unquantized outputs is larger than the capacity when both the legitimate receiver and the eavesdropper have binary quantized outputs; as the SNR increases, the secrecy capacity when both the legitimate receiver and the eavesdropper have binary quantized outputs tends to overtake.

show abstract

Secret-Sharing LDPC Codes for the BPSK-Constrained Gaussian Wiretap Channel

Cited by 39 publications

References 35 publications

Low-power secret-key agreement over OFDM

Low-power secret-key agreement over OFDM

Wiretap channel with causal state information and secure rate-limited feedback

On the Binary Input Gaussian Wiretap Channel with/without Output Quantization

Contact Info

Product

Resources

About