Adding time to a logic of authentication
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Timestamps in key distribution protocols
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Efficient network authentication protocols: lower bounds and optimal implementations
Distributed Computing
| Hi-index | 0.00 |
This paper clarifies straight replays which are one of replay attacks but have been somewhat misunderstood. There are various kinds of replay attacks on authentication protocols but most of the formal methods are not capable of detecting them because a replayed message may have appropriate data and structure for the protocols. [1] classified them and proposed their taxonomy that is useful for readily determining the effectiveness of some replay countermeasures and the appropriateness of analysis techniques for replays. [1] urges that any kinds of replay attacks are classified in the taxonomy. Among those classified attacks, however, straight replay attacks are ambiguous to be distinguished from forced delays which are really not regarded as replays.