USENIX Security2024Top-tier venue
Secure Account Recovery for a Privacy-Preserving Web Service
Ryan Little, Lucy Qin, Mayank Varia
Abstract
If a web service is so secure that it does not even knowand does not want to know-the identity and contact info of its users, can it still offer account recovery if a user forgets their password? This paper is the culmination of the authors' work to design a cryptographic protocol for account recovery for use by a prominent secure matching system: a web-based service that allows survivors of sexual misconduct to become aware of other survivors harmed by the same perpetrator. In such a system, the list of account-holders must be safeguarded, even against the service provider itself. In this work, we design an account recovery system that, on the surface, appears to follow the typical workflow: the user types in their email address, receives an email containing a one-time link, and answers some security questions. Behind the scenes, the defining feature of our recovery system is that the service provider can perform email-based account validation without knowing, or being able to learn, a list of users' email addresses. Our construction uses standardized cryptography for most components, and it has been deployed in production at the secure matching system. As a building block toward our main construction, we design a new cryptographic primitive that may be of independent interest: an oblivious pseudorandom function that can either have a fully-private input or a partially-public input, and that reaches the same output either way. This primitive allows us to perform online rate limiting for account recovery attempts, without imposing a bound on the creation of new accounts. We provide an open-source implementation of this primitive and provide evaluation results showing that the end-to-end interaction time takes 8.4-60.4 ms in fully-private input mode and 3.1-41.2 ms in partially-public input mode. Content Warning: This paper discusses, at a high level, the issue of sexual assault on college campuses, particularly in Section 1. From Section 3 onward, the paper is more focused on the technical design of the account recovery protocol.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f259c760-3ba7-4fb6-9bb5-b7e709ea418aBuilds on16
- Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-Order ExecutionJo Van Bulck, Marina Minkin, Ofir Weisse, Daniel Genkin et al.USENIX Security 2018 · 1,175 citations
- Sanctum: Minimal Hardware Extensions for Strong Software IsolationVictor Costan, Ilia A. Lebedev, Srinivas DevadasUSENIX Security 2016 · 649 citations
- SoK: Understanding the Prevailing Security Vulnerabilities in TrustZone-assisted TEE SystemsDavid Cerdeira, Nuno Santos, Pedro Fonseca, Sandro PintoS&P 2020 · 231 citations
- Trauma-Informed Computing: Towards Safer Technology Experiences for AllJanet X. Chen, Allison McDonald, Yixin Zou, Emily Tseng et al.CHI 2022 · 163 citations
- Protecting accounts from credential stuffing with password breach alertingKurt Thomas, Jennifer Pullman, Kevin Yeo, Ananth Raghunathan et al.USENIX Security 2019 · 154 citations
Related papers
- A Fast and Simple Partially Oblivious PRF, with ApplicationsNirvan Tyagi, Sofía Celi, Thomas Ristenpart, Nick Sullivan et al.EUROCRYPT 2022 · 28 citations
- Efficient Cryptographic Password Hardening Services from Partially Oblivious CommitmentsJonas Schneider, Nils Fleischhacker, Dominique Schröder, Michael BackesCCS 2016 · 30 citations
- BeaverDam: A Post-Quantum Threshold Key Recovery Protocol from a One-Time Threshold Oblivious Random FunctionBenedikt Auerbach, Shuichi Katsumata, Kaoru Takemure, Ida TuckerCCS 2026
- Efficient Batched Oblivious PRF with Applications to Private Set IntersectionVladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni TrieuCCS 2016 · 429 citations
- The 2Hash OPRF Framework and Efficient Post-quantum InstantiationsWard Beullens, Lucas Dodgson, Sebastian H. Faller, Julia HesseEUROCRYPT 2025 · 14 citations
