Robust Key Agreement Schemes

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper considers a key agreement problem in which two parties aim to agree on a key by exchanging messages in the presence of adversarial tampering. The aim of the adversary is to disrupt the key agreement process, but there are no secrecy constraints (i.e. we do not insist that the key is kept secret from the adversary). The main results of the paper are coding schemes and bounds on maximum key generation rates for this problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Robust Key Agreement Schemes 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 Robust Key Agreement Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Key Agreement Schemes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-12775

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.