An Improved Robust Fuzzy Extractor

OpenBU

Show simple item record

dc.contributor.author Kanukurth, Bhavana en_US
dc.date.accessioned 2011-10-20T04:51:06Z
dc.date.available 2011-10-20T04:51:06Z
dc.date.issued 2009 en_US
dc.identifier.uri http://hdl.handle.net/2144/1716
dc.description.abstract We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W' to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were defined by Dodis et al. in Crypto 2006 [6] to be noninteractive, i.e., only one message P, which can be modified by an unbounded adversary, can pass from one party to the other. This allows them to be used by a single party at different points in time (e.g., for key recovery or biometric authentication), but also presents an additional challenge: what if R is used, and thus possibly observed by the adversary, before the adversary has a chance to modify P. Fuzzy extractors secure against such a strong attack are called post-application robust. We construct a fuzzy extractor with post-application robustness that extracts a shared secret key of up to (2m−n)/2 bits (depending on error-tolerance and security parameters), where n is the bit-length and m is the entropy of W . The previously best known result, also of Dodis et al., [6] extracted up to (2m − n)/3 bits (depending on the same parameters). en_US
dc.language.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-2008-023 en_US
dc.title An Improved Robust Fuzzy Extractor en_US
dc.type Technical Report en_US
etd.degree.name Master of Arts
etd.degree.level masters
etd.degree.discipline Computer Science
etd.degree.grantor Boston University

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Advanced Search

Browse

Deposit Materials