„Threshold Password-Hardened Encryption Services“ Accepted at ACM CCS 2020

Symbolic picture for the article. The link opens the image in a large view.

The paper „Threshold Password-Hardened Encryption Services“ by Julian Brost in cooperation with Christoph Egger, Russell Lai, Fritz Schmid, Dominique Schröder und Markus Zoppelt has been accepted at ACM CCS 220. The paper contains the findings of Julian Brost’s master thesis.

Below you will find the abstract of the paper.

Password-hardened encryption (PHE) was introduced by Lai et al. at USENIX 2018 and immediately productized by VirgilSecurity. PHE is a password-based key derivation protocol that involves an oblivious external crypto service for key derivation. The security of PHE protects against offline brute-force attacks, even when the attacker is given the entire database. Furthermore, the crypto service neither learns the derived key nor the password. PHE supports key-rotation meaning that both the server and crypto service can update their keys without involving the user. While PHE significantly strengthens data security, it introduces a single point of failure because key-derivation always requires access to the crypto service. In this work, we address this issue and simultaneously increase security by introducing threshold password-hardened encryption. Our formalization of this primitive revealed shortcomings of the original PHE definition that we also address in this work. Following the spirit of prior works, we give a simple and efficient construction using lightweight tools only. We also implement our construction and evaluate its efficiency. Our experiments confirm the practical efficiency of our scheme and show that it is more efficient than common memory-hard functions, such as scrypt. From a practical perspective this means that threshold PHE can be used as an alternative to scrypt for password protection and key-derivation, offering better security in terms of offline brute force attacks.