Skip to content

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

215 views

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Provides tight bounds for GCM multi-user security under nonce randomization. Research paper teaching cryptographic analysis and authenticated encryption security.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of ACM CCS 2018