Explore a rigorous analysis of guessing curves for probabilistic password models in this 15-minute IEEE conference talk. Delve into the concept of Confident Monte Carlo as presented by researchers from Purdue University. Learn about the innovative approach to analyzing password security and its implications for cybersecurity practices. Gain insights into how this method can provide more accurate assessments of password strength and vulnerability to guessing attacks. Understand the potential applications of this research in improving password policies and enhancing overall system security.
Confident Monte Carlo - Rigorous Analysis of Guessing Curves for Probabilistic Password Models
Overview
Syllabus
Confident Monte Carlo: Rigorous Analysis of Guessing Curves for Probabilistic Password Models
Taught by
IEEE Symposium on Security and Privacy
Tags
Related Courses
-
Beyond Credential Stuffing - Password Similarity Models Using Neural Networks
-
Fast, Lean, and Accurate - Modeling Password Guessability Using Neural Networks
-
Reasoning Analytically About Password Cracking Software
-
The Effect of Constraints on the Number of Viable Permutations of Passwords
-
Precise Detection of Kernel Data Races with Probabilistic Lockset Analysis
-
OSPREY - Recovery of Variable and Data Structure via Probabilistic Analysis for Stripped Binary
