Efficient protocols secure against guessing and replay attacks

Cryptographic nonce Replay attack Session key
DOI: 10.1109/icccn.1995.540108 Publication Date: 2002-11-19T18:50:15Z
ABSTRACT
To establish secure network communications, a common practice requires that users authenticate one another and temporary session key based on their passwords. Since often use passwords are easy to remember, attackers can correctly guess the simply by searching through relatively small space of "weak" In this paper, we present new set efficient protocols communications while protecting from any feasible guessing replay attacks. Our avoid timestamps altogether minimize nonces (random numbers). We examine some attacks existing protocols, show how our be against such apply both peer-to-peer multicast communications.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (15)
CITATIONS (9)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....