Dense Parity Check Based Secrecy Sharing in Wireless Communications
暂无分享,去创建一个
[1] Ueli Maurer,et al. Secret-key agreement over unauthenticated public channels III: Privacy amplification , 2003, IEEE Trans. Inf. Theory.
[2] Ueli Maurer,et al. Unconditional Security Against Memory-Bounded Adversaries , 1997, CRYPTO.
[3] Miguel R. D. Rodrigues,et al. Secrecy Capacity of Wireless Channels , 2006, 2006 IEEE International Symposium on Information Theory.
[4] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[5] U. Maurer,et al. Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.
[6] Ueli Maurer,et al. Privacy amplification secure against an adversary with selectable knowledge , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[7] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[8] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[9] Ueli Maurer,et al. Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result , 2003, IEEE Trans. Inf. Theory.
[10] W.S. Hodgkiss,et al. Indoor Spatial Correlation Measurements at 2.4 GHz , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..
[11] Matthieu R. Bloch,et al. Wireless Information-Theoretic Security - Part I: Theoretical Aspects , 2006, ArXiv.