Paper 2022/268

Efficient Schemes for Committing Authenticated Encryption

Mihir Bellare and Viet Tung Hoang

Abstract

This paper provides efficient authenticated-encryption (AE) schemes in which a ciphertext is a commitment to the key. These are extended, at minimal additional cost, to schemes where the ciphertext is a commitment to all encryption inputs, meaning key, nonce, associated data and message. Our primary schemes are modifications of GCM (for basic, unique-nonce AE security) and AES-GCM-SIV (for misuse-resistant AE security) and add both forms of commitment without any increase in ciphertext size. We also give more generic, but somewhat more costly, solutions.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
A major revision of an IACR publication in EUROCRYPT 2022
Keywords
Symmetric EncryptionAuthenticated EncryptionGCMPRFHash Functioncommitment
Contact author(s)
mihir @ eng ucsd edu
tvhoang @ cs fsu edu
History
2022-05-11: last of 2 revisions
2022-03-02: received
See all versions
Short URL
https://ia.cr/2022/268
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/268,
      author = {Mihir Bellare and Viet Tung Hoang},
      title = {Efficient Schemes for Committing Authenticated Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2022/268},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/268}},
      url = {https://eprint.iacr.org/2022/268}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.