Low-density random matrices for secret key extraction
暂无分享,去创建一个
[1] Ueli Maurer,et al. Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.
[2] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[3] Gheorghe Paun,et al. Current Trends in Theoretical Computer Science: The Challenge of the New Century , 2004 .
[4] John C Howell,et al. Large-alphabet quantum key distribution using energy-time entangled bipartite States. , 2007, Physical review letters.
[5] L. Fortnow,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[6] Rudolf Ahlswede,et al. Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.
[7] Viktor K. Prasanna,et al. Sparse Matrix-Vector multiplication on FPGAs , 2005, FPGA '05.
[8] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[9] R. A. McDonald,et al. Noiseless Coding of Correlated Information Sources , 1973 .
[10] A. Tajima,et al. High-Speed Quantum Key Distribution System for 1-Mbps Real-Time Key Generation , 2012, IEEE Journal of Quantum Electronics.
[11] Gilles Brassard,et al. Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..
[12] Siyao Guo,et al. Sparse extractor families for all the entropy , 2012, ITCS '13.
[13] U. Maurer,et al. Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.
[14] Renato Renner,et al. Smooth Renyi entropy and applications , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[15] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.