Exponential decreasing rate of leaked information in universal random privacy amplification

IEEE Transactions on Information Theory

Volumn 57, Issue 6, 2011, Pages 3989-4001

  Hayashi, Masahito ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Exponential rate; nonasymptotic setting; secret key agreement; universal hash function; wire tap channel

Indexed keywords

EXPONENTIAL RATES; NONASYMPTOTIC SETTING; SECRET KEY AGREEMENT; UNIVERSAL HASH FUNCTION; WIRE-TAP CHANNEL;

ENTROPY; HASH FUNCTIONS; WIRE;

RANDOM NUMBER GENERATION;

EID: 79957636296     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2110950     Document Type: Article

References (22)

1. U. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, pp. 733-742, 1993.
2. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography part 1: Secret sharing," IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
3. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, May 1979.
4. L. Carter and M. Wegman, "Universal classes of hash functions," J. Comput. Syst. Sci., vol. 18, no. 2, pp. 143-154, 1979.
5. S. Amari and H. Nagaoka, Methods of Information Geometry. Oxford, U.K.: AMS & Oxford Univ. Press, 2000.
6. H. Krawczyk, in Proc. LFSR-Based Hashing and Authentication. Advances in Cryptology-CRYPTO'94, 1994, vol. 839, pp. 129-139, Lecture Notes in Computer Science, Springer-Verlag.
7. C. H. Bennett, G. Brassard, C. Crepeau, and U. M. Maurer, "Generalized privacy amplification," IEEE Trans. Inf. Theory, vol. 41, pp. 1915-1923, 1995.
8. M. Hayashi, "General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and its application to wire-tap channel," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562-1575, Apr. 2006.
9. P. Delsarte and P. Piret, "Algebraic constructions of Shannon codes for regular channels," IEEE Trans. Inf. Theory, vol. 28, no. 4, pp. 593-599, Apr. 1982. (Pubitemid 12525111)
10. A. D. Wyner, "The wire-tap channel," Bell. Syst. Tech. J., vol. 54, pp. 1355-1387, 1975.
11. I. Devetak, "The private classical information capacity and quantum information capacity of a quantum channel," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 44-55, Jan. 2005. (Pubitemid 40145986)
12. A. Winter, A. C. A. Nascimento, and H. Imai, "Commitment capacity of discrete memoryless channels," in Proc. 9th Cirencester Crypto and Coding Conf, Berlin, Germany, 2003, pp. 35-51, LNCS 2989, Springer, cs.CR/0304014 (2003).
13. R. G. Gallager, Information Theory and Reliable Communication. Hoboken, NJ: Wiley, 1968.
14. R. Renner, "Security of QuantumKey Distribution," Ph.D. dissertation, Dipl. Phys. ETH, Switzerland, 2005, arXiv:quantph/0512258.
15. J. Muramatsu, "Secret key agreement from correlated source outputs using low density parity check matrices," IEICE Trans. Fundam., vol. E89-A, no. 7, pp. 2036-2046, 2006. (Pubitemid 44290411)
16. R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification," in Proc. ASIACRYPT, 2005, vol. 3788, pp. 199-216, Lecture Notes in Computer Science, Springer-Verlag. (Pubitemid 43763476)
17. I. Csiszár, "Almost independence and secrecy capacity," Probl. Inf. Transm., vol. 32, no. 1, pp. 40-47, 1996.
18. M. Naito, S. Watanabe, R. Matsumoto, and T. Uyematsu, "Secret key agreement by soft-decision of signals in Gaussian Maurer's model," IEICE Trans. Fundam., vol. 92, no. 2, pp. 525-534, 2009.
19. R. Renner and S. Wolf, "Smooth Renyi entropy and applications," in Proc. Int. Symp. Information Theory, 2004, p. 233.
20. S. Watanabe, 2007, private communication.
21. R. Cannetti, "Universal composable security: A new paradigm for cryptographic protocols," in Proc. 42nd IEEE FOCS, Oct. 2001, pp. 136-145.
22. I. Csiszár and J. Körner, Information Theory: Coding Theorem for Discrete Memoryless Systems. New York: Academic, 1981.