Threshold Password-Hardened Encryption Services

被引:11
作者
Brost, Julian [1 ]
Egger, Christoph [1 ]
Lai, Russell W. F. [1 ]
Schmid, Fritz [1 ]
Schroeder, Dominique [1 ]
Zoppelt, Markus [2 ]
机构
[1] Friedrich Alexander Univ, Erlangen, Germany
[2] Nuremberg Inst Technol, Nurnberg, Germany
来源
CCS '20: PROCEEDINGS OF THE 2020 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY | 2020年
关键词
IDENTIFICATION;
D O I
10.1145/3372297.3417266
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:409 / 424
页数:16
相关论文
共 18 条
[11]  
Karchmer M., 1993, Proceedings of the Eighth Annual Structure in Complexity Theory Conference (Cat. No.93CH3281-3), P102, DOI 10.1109/SCT.1993.336536
[12]  
Lai RWF, 2018, PROCEEDINGS OF THE 27TH USENIX SECURITY SYMPOSIUM, P1405
[13]  
Lai RWF, 2017, PROCEEDINGS OF THE 26TH USENIX SECURITY SYMPOSIUM (USENIX SECURITY '17), P899
[14]  
PCI Security Standards Council, 2016, PCI DSS V3 2
[15]   Efficient Cryptographic Password Hardening Services from Partially Oblivious Commitments [J].
Schneider, Jonas ;
Fleischhacker, Nils ;
Schroeder, Dominique ;
Backes, Michael .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :1192-1203
[16]  
SCHNORR CP, 1990, LECT NOTES COMPUT SC, V435, P239
[17]   HOW TO SHARE A SECRET [J].
SHAMIR, A .
COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613
[18]  
Steven John, 2016, PASSWORD STORAGE CHE