YoVDO

The Multi-User Security of GCM, Revisited - Tight Bounds for Nonce Randomization

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Cryptography Courses Encryption Algorithms Courses

Course Description

Overview

Explore the multi-user security of GCM, the most widely used dedicated AE mode, in this 21-minute conference talk. Delve into new concrete security bounds that improve upon previous work by examining the impact of nonce re-use across users and re-keying. Analyze the refined parameterization of adversarial resources, investigate tight bounds for nonce randomization, and compare the findings with existing research. Gain insights into proving bounds and understand the implications for the security of GCM in multi-user environments.

Syllabus

Introduction
Multiuser Security
Nonce Counters
Tight Bounds
rekeying
proving bounds
comparing bounds
conclusion


Taught by

Association for Computing Machinery (ACM)

Related Courses

Applied Cryptography
University of Virginia via Udacity
Cryptography II
Stanford University via Coursera
Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera
Cryptography I
Stanford University via Coursera
Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera