20
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Coding with Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap Analysis

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          This study examines the use of nonsystematic channel codes to obtain secure transmissions over the additive white Gaussian noise (AWGN) wire-tap channel. Unlike the previous approaches, we propose to implement nonsystematic coded transmission by scrambling the information bits, and characterize the bit error rate of scrambled transmissions through theoretical arguments and numerical simulations. We have focused on some examples of Bose-Chaudhuri-Hocquenghem (BCH) and low-density parity-check (LDPC) codes to estimate the security gap, which we have used as a measure of physical layer security, in addition to the bit error rate. Based on a number of numerical examples, we found that such a transmission technique can outperform alternative solutions. In fact, when an eavesdropper (Eve) has a worse channel than the authorized user (Bob), the security gap required to reach a given level of security is very small. The amount of degradation of Eve's channel with respect to Bob's that is needed to achieve sufficient security can be further reduced by implementing scrambling and descrambling operations on blocks of frames, rather than on single frames. While Eve's channel has a quality equal to or better than that of Bob's channel, we have shown that the use of a hybrid automatic repeat-request (HARQ) protocol with authentication still allows achieving a sufficient level of security. Finally, the secrecy performance of some practical schemes has also been measured in terms of the equivocation rate about the message at the eavesdropper and compared with that of ideal codes.

          Related collections

          Most cited references13

          • Record: found
          • Abstract: not found
          • Article: not found

          The capacity of low-density parity-check codes under message-passing decoding

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Iterative decoding of binary block and convolutional codes

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

                Bookmark

                Author and article information

                Journal
                29 August 2013
                Article
                10.1109/TIFS.2012.2187515
                1308.6437
                bcdbe325-a431-4440-9492-c26dc198ea09

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                IEEE Transactions on Information Forensics & Security, ISSN 1556-6013, Vol. 7, No. 3, pp. 883-894, June 2012
                29 pages, 10 figures
                cs.IT math.IT

                Comments

                Comment on this article