When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack

DOI10.1515/jmc-2015-0059zbMath1372.94411OpenAlexW2758634049MaRDI QIDQ1676238

Mohamed Ali Kaafar, Hassan Jameel Asghar

Publication date: 6 November 2017

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2015-0059

zbMATH Keywords

cryptographyinformation theoryidentification protocolsinformation securityhuman identification protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Uses Software

• mpmath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can “Something You Know” Be Saved?
• A New Human Identification Protocol and Coppersmith’s Baby-Step Giant-Step Algorithm
• Human Identification Through Insecure Channel
• Advanced Lectures on Machine Learning
• Authenticating Pervasive Devices with Human Protocols
• How Far Can We Go Beyond Linear Cryptanalysis?
• Elements of Information Theory
• BehavioCog: An Observation Resistant Authentication Scheme

This page was built for publication: When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack