Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
Author:
Top Cited Papers
- 23 May 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 57 (6) , 3989-4001
Abstract
We derive a new upper bound for Eve's information in secret key generation from a common random number without communication. This bound improves on Bennett 's bound based on the Rényi entropy of order 2 because the bound obtained here uses the Rényi entropy of order 1+ s for s ∈ [0,1]. This bound is applied to a wire-tap channel. Then, we derive an exponential upper bound for Eve's information. Our exponent is compared with Hayashi 's exponent. For the additive case, the bound obtained here is better. The result is applied to secret key agreement by public discussion.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's ModelIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009
- Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check MatricesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
- General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channelIEEE Transactions on Information Theory, 2006
- The Private Classical Capacity and Quantum Capacity of a Quantum ChannelIEEE Transactions on Information Theory, 2005
- Smooth renyi entropy and applications2004
- Commitment Capacity of Discrete Memoryless Channels2003
- Generalized privacy amplificationIEEE Transactions on Information Theory, 1995
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- The Wire-Tap ChannelBell System Technical Journal, 1975