Cryptology ePrint Archive: Report 2014/767
Algebraic Attacks on Human Identification Protocols
Hassan Jameel Asghar and Ron Steinfeld and Shujun Li and Mohamed Ali Kaafar and Josef Pieprzyk
Abstract: Human identification protocols are challenge-response protocols that rely on human computational ability to reply to random challenges from the server based on a public function of a shared secret and the challenge to authenticate the human user. One security criterion for a human identification protocol is the number of challenge-response pairs the adversary needs to observe before it can deduce the secret. In order to increase this number, protocol designers have tried to construct protocols that cannot be represented as a system of linear equations or congruences. In this paper, we take a closer look at different ways from algebra, lattices and coding theory to obtain the secret from a system of linear congruences. We then show two examples of human identification protocols from literature that can be transformed into a system of linear congruences. The resulting attack limits the number of authentication sessions these protocols can be used before secret renewal. Prior to this work, these protocols had no known upper bound on the number of allowable sessions per secret.
Category / Keywords: Human identification protocols, linear system of congruences, learning with errors
Date: received 29 Sep 2014, last revised 12 Jul 2016
Contact author: hassan jameel at gmail com
Available format(s): PDF | BibTeX Citation
Note: There were some errors in Section 6, which are now corrected in Appendix D of the revised paper.
Version: 20160712:234912 (All versions of this report)
Short URL: ia.cr/2014/767
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]