Secure rate-adaptive reconciliation

Details Secure rate-adaptive reconciliation Secure rate-adaptive reconciliation

2010-07-06

arxiv.org/abs/1007.0904v2

Computer Science

Information Theory

6 pages, 5 figures

Scientific paper

10.1109/ISITA.2010.5650099

We consider in this paper the problem of information reconciliation in the context of secret key agreement between two legitimate parties, Alice and Bob. Beginning the discussion with the secret key agreement model introduced by Ahlswede and Csisz\'ar, the channel-type model with wiretapper, we study a protocol based on error correcting codes. The protocol can be adapted to changes in the communication channel extending the original source. The efficiency of the reconciliation is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice's and Bob's sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216805