Compositionality of game-based secure key-exchange

57 mins 36 secs, 341.91 MB, WebM 640x360, 29.97 fps, 44100 Hz, 810.46 kbits/sec

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/1246847/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	Warinschi, B (Bristol) Tuesday 10 April 2012, 13:30-14:30


Created:	2012-04-23 12:54
Collection:	Semantics and Syntax: A Legacy of Alan Turing
Publisher:	Isaac Newton Institute
Copyright:	Warinschi, B
Language:	eng (English)


Abstract:	In this talk I will present two approaches towards modular security proofs for the composition of key exchange protocols with arbitrary other cryptographic tasks. While the two approaches differ in their scope and applicability they both rely on game-based security security and avoids the idiosyncrasies of simulation-based definitions. As an application, I will discuss how the results can be applied to proving the security of the Transport Layer Security protocol.

Abstract:

In this talk I will present two approaches towards modular security proofs for the composition of key exchange protocols with arbitrary other cryptographic tasks. While the two approaches differ in their scope and applicability they both rely on game-based security security and avoids the idiosyncrasies of simulation-based definitions. As an application, I will discuss how the results can be applied to proving the security of the Transport Layer Security protocol.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.84 Mbits/sec	798.90 MB	View	Download
WebM *	640x360	810.46 kbits/sec	341.91 MB	View	Download
Flash Video	484x272	568.61 kbits/sec	239.88 MB	View	Download
iPod Video	480x270	506.14 kbits/sec	213.53 MB	View	Download
MP3	44100 Hz	125.02 kbits/sec	52.61 MB	Listen	Download
Auto	(Allows browser to choose a format it supports)