Professional Documents
Culture Documents
Lamport'S Hash (I)
Lamport'S Hash (I)
Lamports Hash, EKE, SPEKE, PDM Server B authenticates user A A has only a password and As workstation has no private key Secure against eavesdropping and attacks on Bs database
B (password)
x = hash
n
Initially B knows n and hash (password) On receipt of x, it hashes x and compares result to hash (password) n If equal, B replaces hash (password), n with x, n-1
EKE (II)
share weak secret W = f (password) A, EW (g mod p) EW (gb mod p, C1) K = g mod p EK (C , C )
1 2 ab a
EK (C2 )
SRP Details
A computes W from password B stores g W mod p and associates with A g and p are fixed for the system a and b are chosen by A, B respectively challenges c1 and c2 are chosen by A, B respectively B additionally chooses a 32-bit number u SRP is documented in RFC 2945 and is common in IETF protocols
mod p, u, c1
B