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 条
  • [1] PASTA: PASsword-based Threshold Authentication
    Agrawal, Shashank
    Miao, Peihan
    Mohassel, Payman
    Mukherjee, Pratyay
    [J]. PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 2042 - 2059
  • [2] Charm: a framework for rapidly prototyping cryptosystems
    Akinyele, Joseph A.
    Garman, Christina
    Miers, Ian
    Pagano, Matthew W.
    Rushanan, Michael
    Green, Matthew
    Rubin, Aviel D.
    [J]. JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (02) : 111 - 128
  • [3] Allec Muffet, 2015, FACEBOOK PASSWORD HA
  • [4] Alon N., 1995, Algorithms - ESA '95. Third Annual European Symposium. Proceedings, P523
  • [5] Bagherzandi A, 2011, PROCEEDINGS OF THE 18TH ACM CONFERENCE ON COMPUTER & COMMUNICATIONS SECURITY (CCS 11), P433
  • [6] Argon2: new generation of memory-hard functions for password hashing and other applications
    Biryukov, Alex
    Dinu, Daniel
    Khovratovich, Dmitry
    [J]. 1ST IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY, 2016, : 292 - 302
  • [7] A PUBLIC KEY CRYPTOSYSTEM AND A SIGNATURE SCHEME BASED ON DISCRETE LOGARITHMS
    ELGAMAL, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) : 469 - 472
  • [8] Everspaugh A, 2015, PROCEEDINGS OF THE 24TH USENIX SECURITY SYMPOSIUM, P547
  • [9] Farshim P, 2013, LECT NOTES COMPUT SC, V7778, P352, DOI 10.1007/978-3-642-36362-7_22
  • [10] HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS
    FIAT, A
    SHAMIR, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 : 186 - 194