[Busec] reminder, group meeting in 15 minutes MCS137
goldbe at cs.bu.edu
Mon Dec 12 12:49:13 EST 2011
with Leo on information theoretic security and double chocolate
cookies from flour!
Information-Theoretic Key Agreement from Close Secrets: A Survey
Speaker: Leo Reyzin
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.
Computer Science, Boston University
More information about the Busec