메뉴 건너뛰기




Volumn 6, Issue 3 PART 1, 2011, Pages 551-564

Secret-sharing LDPC codes for the BPSK-constrained Gaussian wiretap channel

Author keywords

Gaussian wiretap channel; information reconciliation; low density parity check (LDPC) codes; physical layer security; secret key agreement

Indexed keywords

INFORMATION RECONCILIATION; LOW-DENSITY PARITY-CHECK CODES; PHYSICAL-LAYER SECURITY; SECRET KEY AGREEMENT; WIRETAP CHANNEL;

EID: 80051774472     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2011.2139208     Document Type: Article
Times cited : (37)

References (30)
  • 1
    • 0016562514 scopus 로고
    • The wire-tap channel
    • Oct
    • A. Wyner, "The wire-tap channel", Bell Syst. Tech. J., vol. 54, pp. 1355-1387, Oct. 1975.
    • (1975) Bell Syst. Tech. J. , vol.54 , pp. 1355-1387
    • Wyner, A.1
  • 2
    • 0017973511 scopus 로고
    • Broadcast channels with confidential messages
    • May
    • I. Csiszar and J. Korner, "Broadcast channels with confidential messages", IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, May 1978.
    • (1978) IEEE Trans. Inf. Theory , vol.IT-24 , Issue.3 , pp. 339-348
    • Csiszar, I.1    Korner, J.2
  • 4
    • 0021595510 scopus 로고
    • Wire-tap channel II
    • Dec
    • L. Ozarow and A. D. Wyner, "Wire-tap channel II", Bell Syst. Tech. J., vol. 63, no. 10, pp. 2135-2157, Dec. 1984.
    • (1984) Bell Syst. Tech. J. , vol.63 , Issue.10 , pp. 2135-2157
    • Ozarow, L.1    Wyner, A.D.2
  • 9
    • 67650099990 scopus 로고    scopus 로고
    • Channel polarization: A method for contructing capacityachieving codes for symmetric binary-input memoryless channels
    • Jul
    • E. Arikan, "Channel polarization: A method for contructing capacityachieving codes for symmetric binary-input memoryless channels", IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.7 , pp. 3051-3073
    • Arikan, E.1
  • 10
    • 0027599802 scopus 로고
    • Secret key agreement by public discussion from common information
    • May
    • U. M. Maurer, "Secret key agreement by public discussion from common information", IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.3 , pp. 733-742
    • Maurer, U.M.1
  • 11
    • 0027629488 scopus 로고
    • Common randomness in information theory and cryptography. I. Secret sharing
    • Jul
    • R. Ahlswede and I. Csiszar, "Common randomness in information theory and cryptography. I. Secret sharing", IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.4 , pp. 1121-1132
    • Ahlswede, R.1    Csiszar, I.2
  • 14
    • 1442337635 scopus 로고    scopus 로고
    • Reconciliation of a quantumdistributed Gaussian key
    • Feb
    • G. Van Assche, J. Cardinal, and N. Cerf, "Reconciliation of a quantumdistributed Gaussian key", IEEE Trans. Inf. Theory, vol. 50, no. 2, pp. 394-400, Feb. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.2 , pp. 394-400
    • Van Assche, G.1    Cardinal, J.2    Cerf, N.3
  • 15
    • 33747886952 scopus 로고    scopus 로고
    • Secret key agreement from correlated source outputs using low density parity check matrices
    • DOI 10.1093/ietfec/e89-a.7.2036
    • J. Muramatsu, "Secret key agreement from correlated source outputs using low density parity check matrices", IEICE Trans. Fundamentals Electron., Commun., Comput. Sci., vol. E89-A, pp. 2036-2046, Jul. 2006. (Pubitemid 44290411)
    • (2006) IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , vol.E89-A , Issue.7 , pp. 2036-2046
    • Muramatsu, J.1
  • 16
    • 39049156464 scopus 로고    scopus 로고
    • Extracting secrecy from jointly Gaussian random variables
    • DOI 10.1109/ISIT.2006.262101, 4036441, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
    • C. Ye, A. Reznik, and Y. Shah, "Extracting secrecy from jointly Gaussian random variables", in Proc. IEEE Int. Symp. Inform. Theory (ISIT 2006), Jul. 2006, pp. 2593-2597. (Pubitemid 351244572)
    • (2006) IEEE International Symposium on Information Theory - Proceedings , pp. 2593-2597
    • Ye, C.1    Reznik, A.2    Shah, Y.3
  • 22
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • DOI 10.1109/18.910577, PII S0018944801007374
    • T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding", IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001. (Pubitemid 32318092)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.2 , pp. 599-618
    • Richardson, T.J.1    Urbanke, R.L.2
  • 23
    • 0019608335 scopus 로고
    • Recursive approach to low complexity codes
    • R. Tanner, "A recursive approach to low complexity codes", IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981. (Pubitemid 12446960)
    • (1981) IEEE Transactions on Information Theory , vol.IT-27 , Issue.5 , pp. 533-547
    • Tanner R.Michael1
  • 24
    • 0036810616 scopus 로고    scopus 로고
    • Compression of binary sources with side information at the decoder using LDPC codes
    • DOI 10.1109/LCOMM.2002.804244
    • A. Liveris, Z. Xiong, and C. Georghiades, "Compression of binary sources with side information at the decoder using LDPC codes", IEEE Commun. Lett., vol. 6, no. 10, pp. 440-442, Oct. 2002. (Pubitemid 35359477)
    • (2002) IEEE Communications Letters , vol.6 , Issue.10 , pp. 440-442
    • Liveris, A.D.1    Xiong, Z.2    Georghiades, C.N.3
  • 25
    • 0035504686 scopus 로고    scopus 로고
    • Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
    • DOI 10.1109/18.959254, PII S0018944801085868
    • G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes", IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001. (Pubitemid 33053477)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.7 , pp. 2696-2710
    • Miller, G.1    Burshtein, D.2
  • 26
    • 1842481669 scopus 로고    scopus 로고
    • On the application of LDPC codes to arbitrary discrete-memoryless channels
    • Mar
    • A. Bennatan and D. Burshtein, "On the application of LDPC codes to arbitrary discrete-memoryless channels", IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 417-438, Mar. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.3 , pp. 417-438
    • Bennatan, A.1    Burshtein, D.2
  • 27
    • 0035246320 scopus 로고    scopus 로고
    • Efficient encoding of low-density parity-check codes
    • DOI 10.1109/18.910579, PII S0018944801007398
    • T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes", IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001. (Pubitemid 32318094)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.2 , pp. 638-656
    • Richardson, T.J.1    Urbanke, R.L.2
  • 28
    • 0035248618 scopus 로고    scopus 로고
    • On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
    • DOI 10.1109/4234.905935, PII S1089779801021226
    • S. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit", IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001. (Pubitemid 32286625)
    • (2001) IEEE Communications Letters , vol.5 , Issue.2 , pp. 58-60
    • Chung, S.-Y.1    David Forney Jr., G.2    Richardson, T.J.3    Urbanke, R.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.