skip to main content
10.1145/3133956.3133992acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation

Published: 30 October 2017 Publication History
  • Get Citation Alerts
  • Abstract

    Block cipher modes of operation provide a way to securely encrypt using a block cipher. The main factors in analyzing modes of operation are the \emph{level of security} achieved (chosen-plaintext security, authenticated encryption, nonce-misuse resistance, and so on) and \textit{performance}. When measuring the security level of a mode of operation, it does not suffice to consider asymptotics, and a concrete analysis is necessary. This is especially the case today, when encryption rates can be very high, and so birthday bounds may be approached or even reached. In this paper, we show that key-derivation at every encryption significantly improves the security bounds in many cases. We present a new key-derivation method that utilizes a \emph{truncated block cipher}, and show that this is far better than standard block-cipher based key derivation. We prove that by using our key derivation method, we obtain greatly improved bounds for many modes of operation, with a result that the lifetime of a key can be significantly extended. We demonstrate this for AES-CTR (CPA-security), AES-GCM (authenticated encryption) and AES-GCM-SIV (nonce-misuse resistance). Finally, we demonstrate that when using modern hardware with AES instructions (AES-NI), the performance penalty of deriving keys at each encryption is insignificant for most uses.

    References

    [1]
    BoringSSL, https://boringssl.googlesource.com/boringssl/
    [2]
    RFC5077: Transport Layer Security (TLS) Session Resumption without Server-Side State, https://tools.ietf.org/html/rfc5077#section-4
    [3]
    A. Abdalla and M. Bellare. Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques. In textitASIACRYPT 2000, Springer (LNCS 1976), pages 546--559, 2000.
    [4]
    E. Barker and J. Kelsey. Recommendation for Random Number Generation Using Deterministic Random Bit Generators, NIST Special Publication 800--90A.http://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800--90Ar1.pdf
    [5]
    K. Bhargavan and G. Leurent. On the Practical (In-)Security of 64-bit Block Ciphers: Collision Attacks on HTTP over TLS and OpenVPN. In ACM CCS, pages 456--467, 2016.
    [6]
    E. Biham. How to decrypt or even substitute DES-encrypted messages in $2^28$ steps. Information Processing Letters, 84(3):117--124, 2002.
    [7]
    H. Bock, A. Zauner, S. Devlin, J. Somorovsky and P. Jovanovic.Nonce-Disrespecting Adversaries: Practical Forgery Attacks on GCM in TLS. In the 10th USENIX Workshop on Offensive Technologies (WOOT 16), 2016.
    [8]
    W. Dai, V.T. Hoang and S. Tessaro.Information-Theoretic Indistinguishability via the Chi-Squared Method. In textitCRYPTO 2017, Springer (LNCS 10403), pages 497--523, 2017.
    [9]
    M. Dworkin. Recommendation for Block Cipher Modes of Operation:Galois/Counter Mode (GCM) for Confidentiality and Authentication. textitFederalInformation Processing Standard Publication FIPS 800--38D, 2006.http://csrc.nist.gov/publications/nistpubs/800--38D/SP-800--38D.pdf
    [10]
    S. Gilboa and S. Gueron. How many queries are needed to distinguish a truncated random permutation from a random function?, Journal of Cryptology (2017).
    [11]
    S. Gilboa and S. Gueron. The Advantage of Truncated Permutations. Manuscript, 2016. https://arxiv.org/abs/1610.02518.
    [12]
    S. Gueron, Y. Lindell. GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte. textit22nd ACM CCS, pages 109--119, 2015.
    [13]
    S. Gueron, A. Langley, Y. Lindell.AES-GCM-SIV: Specification and Analysis,Cryptology ePrint Archive, Report 2 017/168, 2017. http://eprint.iacr.org/2017/168.
    [14]
    S. Gueron, A. Langley, Y. Lindell. https://tools.ietf.org/html/draft-irtf-cfrg-gcmsiv
    [15]
    S. Gueron, Y. Lindell, A. Nof and B. Pinkas. Fast Garbling of Circuits Under Standard Assumptions. 22nd ACM CCS, pages 567--578, 2015.
    [16]
    .A. McGrew and J. ViegaThe Galois/Counter Mode of Operation (GCM). http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/gcm/gcm-spec.pdf
    [17]
    .A. McGrew and J. ViegaThe Security and Performance of the Galois/Counter Mode (GCM) of Operation. In textitINDOCRYPT 2004, Springer (LNCS 3348), pages 343--355, 2004.
    [18]
    N. Mouha, A. Luykx. Multi-key Security: The Even-Mansour Construction Revisited. Advances in Cryptology -- CRYPTO 2015, Proceedings Part I, pp. 209--223 (2015).
    [19]
    QUIC, a multiplexed stream transport over UDP. https://www.chromium.org/quic.
    [20]
    . Rogaway and T. Shrimpton. Deterministic Authenticated Encryption: A Provable-Security Treatment of the Key-Wrap Problem. In EUROCRYPT 2006, Springer (LNCS 4004), pages 373--390, 2006.
    [21]
    A. J. Stam, Distance between sampling with and without replacement, Statist. Neerlandica 32 (1978), no. 2, 81--91.
    [22]
    K. Suzuki, D. Tonien, K. Kurosawa and K. Toyota. Birthday Paradox for Multi-collisions. Proceedings of the textit9th International Conference on Information Security and Cryptology, Springer (LNCS 4296), pages 29--40, 2006.

    Cited By

    View all

    Index Terms

    1. Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
      October 2017
      2682 pages
      ISBN:9781450349468
      DOI:10.1145/3133956
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 30 October 2017

      Permissions

      Request permissions for this article.

      Check for updates

      Badges

      • Best Paper

      Author Tags

      1. aes-gcm-siv
      2. block ciphers
      3. key derivation
      4. modes of operation

      Qualifiers

      • Research-article

      Data Availability

      Funding Sources

      Conference

      CCS '17
      Sponsor:

      Acceptance Rates

      CCS '17 Paper Acceptance Rate 151 of 836 submissions, 18%;
      Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

      Upcoming Conference

      CCS '24
      ACM SIGSAC Conference on Computer and Communications Security
      October 14 - 18, 2024
      Salt Lake City , UT , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)35
      • Downloads (Last 6 weeks)3

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media