Information-Theoretic Key Agreement from Close Secrets: A Survey.

Leonid Reyzin
Boston University
Computer Science

Suppose Alice and Bob start with values w and w', respectively, that are close according to some metric and are partially secret from the adversary. They want to agree on a key that is completely secret, without using any computational assumptions. This problem has been studied for over 25 years and has multiple applications, from quantum key agreement to user authentication to hardware security. The talk surveys some of the work in this area.

Presentation (PowerPoint File)

Back to Mathematics of Information-Theoretic Cryptography