{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/1716"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/1716","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"An Improved Robust Fuzzy Extractor","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).","abstract_html":"We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W&#x27; 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).","abstract_has_math":false,"creators":["Kanukurth, Bhavana"],"institution":"Boston University Computer Science Department","degree_name":"Master of Arts","degree_level":"masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-11-18T20:12:32Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.citation","label":"Dc Identifier Citation","values":["Kanukurthi, Bhavana. \"An Improved Robust Fuzzy Extractor (MA Thesis)\", Technical Report BUCS-TR-2008-023, Computer Science Department, Boston University, September 12, 2008. [Available from: http://hdl.handle.net/2144/1716]"],"render_values":[{"text":"Kanukurthi, Bhavana. \"An Improved Robust Fuzzy Extractor (MA Thesis)\", Technical Report BUCS-TR-2008-023, Computer Science Department, Boston University, September 12, 2008. [Available from: http://hdl.handle.net/2144/1716]","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2144/1716","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/1716","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F1716","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Kanukurth, Bhavana"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-10-20T04:51:06Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-10-20T04:51:06Z"]},{"key":"dc:date.issued","label":"Date","values":["2009"]},{"key":"dc:publisher","label":"Institution","values":["Boston University Computer Science Department"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["BUCS Technical Reports;BUCS-TR-2008-023"]},{"key":"dc:type","label":"Dc Type","values":["Technical Report","Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.citation","label":"Dc Identifier Citation","values":["Kanukurthi, Bhavana. \"An Improved Robust Fuzzy Extractor (MA Thesis)\", Technical Report BUCS-TR-2008-023, Computer Science Department, Boston University, September 12, 2008. [Available from: http://hdl.handle.net/2144/1716]"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/1716"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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)."]},{"key":"dc:title","label":"Title","values":["An Improved Robust Fuzzy Extractor"]}]}],"canonical_facts":{"dc:creator":["Kanukurth, Bhavana"],"dc:date.accessioned":["2011-10-20T04:51:06Z"],"dc:date.available":["2011-10-20T04:51:06Z"],"dc:date.issued":["2009"],"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)."],"dc:identifier.citation":["Kanukurthi, Bhavana. \"An Improved Robust Fuzzy Extractor (MA Thesis)\", Technical Report BUCS-TR-2008-023, Computer Science Department, Boston University, September 12, 2008. [Available from: http://hdl.handle.net/2144/1716]"],"dc:identifier.uri":["https://hdl.handle.net/2144/1716"],"dc:language.iso":["en_US"],"dc:publisher":["Boston University Computer Science Department"],"dc:relation.ispartofseries":["BUCS Technical Reports;BUCS-TR-2008-023"],"dc:title":["An Improved Robust Fuzzy Extractor"],"dc:type":["Technical Report","Thesis/Dissertation"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Arts"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-18T20:12:32Z"}