Sciweavers

STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 8 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
ASIACRYPT
2006
Springer
13 years 8 months ago
Secure Sketch for Biometric Templates
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...
Qiming Li, Yagiz Sutcu, Nasir D. Memon
EUROCRYPT
2009
Springer
14 years 5 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin