The following pages link to (Q4638058):
Displaying 11 items.
- User-aware provably secure protocols for browser-based mutual authentication (Q843365) (← links)
- A new distribution-sensitive secure sketch and popularity-proportional hashing (Q1675227) (← links)
- When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack (Q1676238) (← links)
- Practical human-machine identification over insecure channels (Q1970332) (← links)
- On the implications of Zipf's law in passwords (Q2165466) (← links)
- Naturally Rehearsing Passwords (Q2867165) (← links)
- Mobile Authentication (Q2907528) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- (Q4638058) (← links)
- Password hardening based on keystroke dynamics (Q4707224) (← links)
- Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two (Q5300959) (← links)
