Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT

被引:15
|
作者
Aviram, Nimrod [1 ]
Gellert, Kai [2 ]
Jager, Tibor [2 ]
机构
[1] Tel Aviv Univ, Tel Aviv, Israel
[2] Paderborn Univ, Paderborn, Germany
关键词
D O I
10.1007/978-3-030-17656-3_5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The TLS 1.3 0-RTT mode enables a client reconnecting to a server to send encrypted application-layer data in "0-RTT" ("zero round-trip time"), without the need for a prior interactive handshake. This fundamentally requires the server to reconstruct the previous session's encryption secrets upon receipt of the client's first message. The standard techniques to achieve this are Session Caches or, alternatively, Session Tickets. The former provides forward security and resistance against replay attacks, but requires a large amount of server-side storage. The latter requires negligible storage, but provides no forward security and is known to be vulnerable to replay attacks. In this paper, we first formally define session resumption protocols as an abstract perspective on mechanisms like Session Caches and Session Tickets. We give a new generic construction that provably provides forward security and replay resilience, based on puncturable pseudorandom functions (PPRFs). This construction can immediately be used in TLS 1.3 0-RTT and deployed unilaterally by servers, without requiring any changes to clients or the protocol. We then describe two new constructions of PPRFs, which are particularly suitable for use for forward-secure and replay-resilient session resumption in TLS 1.3. The first construction is based on the strong RSA assumption. Compared to standard Session Caches, for "128-bit security" it reduces the required server storage by a factor of almost 20, when instantiated in a way such that key derivation and puncturing together are cheaper on average than one full exponentiation in an RSA group. Hence, a 1 GB Session Cache can be replaced with only about 51 MBs of storage, which significantly reduces the amount of secure memory required. For larger security parameters or in exchange for more expensive computations, even larger storage reductions are achieved. The second construction combines a standard binary tree PPRF with a new "domain extension" technique. For a reasonable choice of parameters, this reduces the required storage by a factor of up to 5 compared to a standard Session Cache. It employs only symmetric cryptography, is suitable for high-traffic scenarios, and can serve thousands of tickets per second.
引用
收藏
页码:117 / 150
页数:34
相关论文
共 13 条
  • [1] Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT
    Aviram, Nimrod
    Gellert, Kai
    Jager, Tibor
    JOURNAL OF CRYPTOLOGY, 2021, 34 (03)
  • [2] Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT
    Nimrod Aviram
    Kai Gellert
    Tibor Jager
    Journal of Cryptology, 2021, 34
  • [3] Automated Analysis and Verification of TLS 1.3: 0-RTT, Resumption and Delayed Authentication
    Cremers, Cas
    Horvat, Marko
    Scott, Sam
    van der Merwe, Thyla
    2016 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2016, : 470 - 485
  • [4] TLS Guard for TLS 1.3 zero round-trip time (0-RTT) in a distributed environment
    Abdelhafez, M. E.
    Ramadass, Sureswaran
    Abdelwahab, Mustafa
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2023, 35 (10)
  • [5] Optimizing 0-RTT Key Exchange with Full Forward Security
    Goeth, Christian
    Ramacher, Sebastian
    Slamanig, Daniel
    Striecks, Christoph
    Tairi, Erkan
    Zikulnig, Alexander
    PROCEEDINGS OF THE 2023 CLOUD COMPUTING SECURITY WORKSHOP, CCSW 2023, 2023, : 55 - 68
  • [6] Delay Measurement of 0-RTT Transport Layer Security (TLS) Handshake Protocol
    Goncharskyi, Danylo
    Kim, Sung Yong
    Serhrouchni, Ahmed
    Gu, Pengwenlong
    Khatoun, Rida
    Hachem, Joel
    2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), 2022, : 1450 - 1454
  • [7] 0-RTT Key Exchange with Full Forward Secrecy
    Guenther, Felix
    Hale, Britta
    Jager, Tibor
    Lauer, Sebastian
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT III, 2017, 10212 : 519 - 548
  • [8] Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
    Derler, David
    Jager, Tibor
    Slamanig, Daniel
    Striecks, Christoph
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT III, 2018, 10822 : 425 - 455
  • [9] Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
    Derler, David
    Gellert, Kai
    Jager, Tibor
    Slamanig, Daniel
    Striecks, Christoph
    JOURNAL OF CRYPTOLOGY, 2021, 34 (02)
  • [10] Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
    David Derler
    Kai Gellert
    Tibor Jager
    Daniel Slamanig
    Christoph Striecks
    Journal of Cryptology, 2021, 34