2016 · 29 citations · 11 references
ComputingComputer ScienceCybersecurityAuthenticationComputer SecurityCryptographyAuthentication SecurityPassword AttacksPassword AuthenticationPassword SecurityPassword-based AuthenticationAuthentication AttacksAuthentication HardeningHuman Memorable PasswordsPassword Leak MitigationPseudorandom FunctionsRandom Oracle ModelSecurity Proofs
Password authentication still constitutes the most widespread authentication concept on the Internet today, but the human incapability to memorize safe passwords has left this concept vulnerable to various attacks ever since. Affected enterprises such as Facebook now strive to mitigate such attacks by involving external cryptographic services that harden passwords. Everspaugh et al.~provided the first comprehensive formal treatment of such a service, and proposed the Pythia PRF-Service as a cryptographically secure solution (Usenix Security'15). Pythia relies on a novel cryptographic primitive called partially oblivious pseudorandom functions and its security is proven under a strong new interactive assumption in the random oracle model.
11
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval, Jacques Stern · Journal of Cryptology · 2000 · 2.2K citations · Full text
Charm: a framework for rapidly prototyping cryptosystems
Joseph A. Akinyele, Christina Garman, Ian Miers et al. · Journal of Cryptographic Engineering · 2013 · 664 citations
The Internet Engineering Task Force
Mark Needleman · Serials Review · 2000 · 410 citations
Number-theoretic constructions of efficient pseudo-random functions
Moni Naor, Omer Reingold · 2002 · 353 citations
Delegatable pseudorandom functions and applications
Aggelos Kiayias, Stavros Papadopoulos, Nikos Triandopoulos et al. · 2013 · 348 citations