GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing eprint.iacr.org — The Multi-User Security of Authenticated Encryption: AES-GCM in TLS 1.3 Paper 2016/564The Multi-User Security of Authenticated Encryption: AES-GCM in TLS 1.3Mihir Bellare and Bjoern Tackmann AbstractWe initiate the study of multi-user (mu) security of authenticated encryption (AE) schemes as a way to rigorously formulate, and answer, questions about the "randomized nonce" mechanism proposed for the use of the AE scheme GCM in TLS 1.3. We (1) Give definitions of mu ind (indistinguishability) and mu kr (key recovery) security for AE (2) Characterize the intent of nonce randomization as being improved mu security as a defense against mass surveillance (3) Cast the method as a (new) AE scheme RGCM (4) Analyze and compare the mu security of both GCM and RGCM in the model where the underlying block cipher is ideal, showing that the mu security of the latter is indeed superior in many practical contexts to that of the former, and (5) Propose an alternative AE scheme XGCM having the same efficiency as RGCM but better mu security and a more simple and modular design. Note: Added numerical comparison between the schemes. Expanded and corrected the proof of RGCM security. Metadata
BibTeX @misc{cryptoeprint:2016/564,
author = {Mihir Bellare and Bjoern Tackmann},
title = {The Multi-User Security of Authenticated Encryption: {AES}-{GCM} in {TLS} 1.3},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/564},
year = {2016},
url = {https://eprint.iacr.org/2016/564}
}
|
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |