When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack
Cryptographic identification protocols enable a prover to prove its identity to a verifier. A subclass of such protocols are shared-secret challenge-response identification protocols in which the prover and the verifier share the same secret and the prover has to respond to a series of challenges fr...
Main Authors: | Asghar Hassan Jameel, Kaafar Mohamed Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2017-10-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2015-0059 |
Similar Items
-
On the security of joint signature and encryption revisited
by: Nandi Mridul, et al.
Published: (2016-12-01) -
Towards efficient private distributed computation on unbounded input streams
by: Dolev Shlomi, et al.
Published: (2015-06-01) -
Efficiency of SIDH-based signatures (yes, SIDH)
by: Ghantous Wissam, et al.
Published: (2024-03-01) -
Persistent asymmetric password-based key exchange
by: Jiang Shaoquan
Published: (2014-02-01) -
A secure anonymous proxy signcryption scheme
by: Saraswat Vishal, et al.
Published: (2017-06-01)