Tight exponential evaluation for universal composablity with privacy amplification and its applications

Details Tight exponential evaluation for universal composablity with privacy amplification and its applications Tight exponential evaluation for universal composablity with privacy amplification and its applications

2010-10-07

arxiv.org/abs/1010.1358v4

Computer Science

Information Theory

Several errors are fixed. The title is slightly changed. The topic and protocol are similar to those in arXiv:0904.0308. Howev

Scientific paper

We adopt the universal composablity as Eve's distinguishability in secret key generation from a common random number between two distinct players without communication. Under this secrecy criterion, using the Renyi entropy of order 1+s for s in [0,1], we derive a new upper bound of Eve's distinguishability under the application of the universal2 hash functions. It is also shown that this bound gives the tight exponential rate of decrease in the case of independent and identical distributions. The result is applied to the wire-tap channel model and to secret key generation (distillation) by public discussion.

Affiliated with

Also associated with

No associations

Rating

Tight exponential evaluation for universal composablity with privacy amplification and its applications 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 Tight exponential evaluation for universal composablity with privacy amplification and its applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight exponential evaluation for universal composablity with privacy amplification and its applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509027