On the Linearization of Human Identification Protocols: Attacks based on Linear Algebra, Coding Theory and Lattices
Asghar, HJ, Steinfeld, R, Li, S, Kaafar, MA and Pieprzyk, J (2015) On the Linearization of Human Identification Protocols: Attacks based on Linear Algebra, Coding Theory and Lattices IEEE Transactions on Information Forensics and Security, 10, 8. pp. 1643-1655.
|
Text
IEEETIFS2015.pdf - ["content_typename_Accepted version (post-print)" not defined] Available under License : See the attached licence file. Download (3MB) | Preview |
|
|
Text (licence)
SRI_deposit_agreement.pdf Available under License : See the attached licence file. Download (33kB) | Preview |
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 paper, these protocols had no known upper bound on the number of allowable sessions per secret.
Item Type: | Article | ||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Divisions : | Faculty of Engineering and Physical Sciences > Computing Science | ||||||||||||||||||
Authors : |
|
||||||||||||||||||
Date : | 17 June 2015 | ||||||||||||||||||
DOI : | 10.1109/TIFS.2015.2421875 | ||||||||||||||||||
Related URLs : | |||||||||||||||||||
Additional Information : | Copyright 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. | ||||||||||||||||||
Depositing User : | Symplectic Elements | ||||||||||||||||||
Date Deposited : | 05 Aug 2015 13:45 | ||||||||||||||||||
Last Modified : | 31 Oct 2017 17:32 | ||||||||||||||||||
URI: | http://epubs.surrey.ac.uk/id/eprint/808042 |
Actions (login required)
![]() |
View Item |
Downloads
Downloads per month over past year