The Effect of Length on Key Fingerprint Verification Security and Usability

被引:0
作者
Turner, Dan
Shahandashti, Siamak F. [1 ]
Petrie, Helen [1 ]
机构
[1] Univ York, York, N Yorkshire, England
来源
18TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY & SECURITY, ARES 2023 | 2023年
关键词
Key fingerprint verification; Device pairing; Out-of-band channel; Authentication; End-to-end encryption; Secure messaging; Signal safety number; WhatsApp security code; Usability; Security;
D O I
10.1145/3600160.3600187
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In applications such as end-to-end encrypted instant messaging, secure email, and device pairing, users need to compare key fingerprints to detect impersonation and adversary-in-the-middle attacks. Key fingerprints are usually computed as truncated hashes of each party's view of the channel keys, encoded as an alphanumeric or numeric string, and compared out-of-band, e.g. manually, to detect any inconsistencies. Previous work has extensively studied the usability of various verification strategies and encoding formats, however, the exact effect of key fingerprint length on the security and usability of key fingerprint verification has not been rigorously investigated. We present a 162-participant study on the effect of numeric key fingerprint length on comparison time and error rate. While the results confirm some widely-held intuitions such as general comparison times and errors increasing significantly with length, a closer look reveals interesting nuances. The significant rise in comparison time only occurs when highly similar fingerprints are compared, and comparison time remains relatively constant otherwise. On errors, our results clearly distinguish between security non-critical errors that remain low irrespective of length and security critical errors that significantly rise, especially at higher fingerprint lengths. A noteworthy implication of this latter result is that Signal /WhatsApp key fingerprints provide a considerably lower level of security than usually assumed.
引用
收藏
页数:23
相关论文
共 25 条
  • [1] akwizgran, 2014, Basic English: Encode random bitstrings as pseudo-random poems
  • [2] [Anonymous], 2020, OpenSSH Release Notes
  • [3] Brands S., 1994, LECT NOTES COMPUTER, V765, P344, DOI [10.1007/3-540-48285-7_30, DOI 10.1007/3-540-48285-7_30]
  • [4] Copeland M., 1999, The GNU Privacy Handbook
  • [5] Dechand S, 2016, PROCEEDINGS OF THE 25TH USENIX SECURITY SYMPOSIUM, P193
  • [6] Farb Michael, 2013, P 19 ANN INT C MOBIL, P417
  • [7] Goodrich M.T., 2006, Distributed Computing Systems, P10
  • [8] Gutmann Peter., 2011, Login, V36, P35
  • [9] Can Johnny Finally Encrypt? Evaluating E2E-Encryption in Popular IM Applications
    Herzberg, Amir
    Leibowitz, Hemi
    [J]. 6TH WORKSHOP ON SOCIO-TECHNICAL ASPECTS IN SECURITY AND TRUST (STAST 2016), 2016, : 17 - 28
  • [10] Huima Antti, 2000, Network Working Group Internet Draft