Cryptology ePrint Archive: Report 2017/1111

Fuzzy Authenticated Key Exchange

Pierre-Alain Dupont and Julia Hesse and David Pointcheval and Leonid Reyzin and Sophia Yakoubov

Abstract: Consider key agreement by two parties who start out knowing a common secret (which we refer to as “pass-string”, a generalization of “password”), but face two complications: (1) the pass-string may come from a low-entropy distribution, and (2) the two parties’ copies of the pass-string may have some noise, and thus not match exactly. We provide the first efficient and general solutions to this problem that enable, for example, key agreement based on commonly used biometrics such as iris scans. The problem of key agreement with each of these complications individually has been well studied in literature. Key agreement from low-entropy shared pass-strings is achieved by password-authenticated key exchange (PAKE), and key agreement from noisy but high-entropy shared pass-strings is achieved by information-reconciliation protocols as long as the two secrets are “close enough.” However, the problem of key agreement from noisy low-entropy pass-strings has never been studied. We introduce (universally composable) fuzzy password-authenticated key exchange (fPAKE), which solves exactly this problem. fPAKE does not have any entropy requirements for the pass-strings, and enables secure key agreement as long as the two pass-strings are “close” for some notion of closeness. We also give two constructions. The first construction achieves our fPAKE definition for any (efficiently computable) notion of closeness, including those that could not be handled before even in the high-entropy setting. It uses Yao’s Garbled Circuits in a way that is only two times more costly than their use against semi-honest adversaries, but that guarantees security against malicious adversaries. The second construction is more efficient, but achieves our fPAKE definition only for pass-strings with low Hamming distance. It builds on very simple primitives: robust secret sharing and PAKE.

Category / Keywords: cryptographic protocols / Authenticated Key Exchange, PAKE, Hamming Distance, Error Correcting Codes, Yao’s Garbled Circuits

Date: received 14 Nov 2017

Contact author: sonka at bu edu

Available format(s): PDF | BibTeX Citation

Version: 20171120:150515 (All versions of this report)

Short URL: ia.cr/2017/1111

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]