Exponential decreasing rate of leaked information in universal random privacy amplification

Details Exponential decreasing rate of leaked information in universal random privacy amplification Exponential decreasing rate of leaked information in universal random privacy amplification

2009-04-02

arxiv.org/abs/0904.0308v5

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 6, JUNE 2011, 3989-4001

Computer Science

Information Theory

The organization is a little changed. This version is the same as the published version

Scientific paper

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 et al(1995)'s bound based on the R\'enyi entropy of order 2 because the bound obtained here uses the R\'enyi entropy of order $1+s$ for $s \in [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(2006)'s exponent. For the additive case, the bound obtained here is better. The result is applied to secret key agreement by public discussion.

Affiliated with

Also associated with

No associations

Rating

Exponential decreasing rate of leaked information in universal random privacy amplification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exponential decreasing rate of leaked information in universal random privacy amplification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential decreasing rate of leaked information in universal random privacy amplification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63464