Semantic security for the wiretap channel

Duration: 58 mins 18 secs

Share this media item:

Embed this media item:

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

Choose size:

About this item

Available Formats

About this item

Description:	Tessaro, S (Massachusetts Institute of Technology) Thursday 12 April 2012, 16:00-17:00


Created:	2012-04-23 16:33
Collection:	Semantics and Syntax: A Legacy of Alan Turing
Publisher:	Isaac Newton Institute
Copyright:	Tessaro, S
Language:	eng (English)


Abstract:	The wiretap channel is a setting where one aims to provide information-theoretic privacy of communicated data based solely on the assumption that the channel from sender to adversary is “noisier” than the channel from sender to receiver. The central quest in this area has been secure schemes of optimal rate but decades of work have provided only non constructive proofs of existence of such schemes for a notion of security that from the cryptographic perspective is weak. We define and prove equivalent two strong security metrics, one based on semantic security and the other on entropy. We then provide a new scheme that achieves these strong security goals in polynomial time with optimal rate, thereby not only solving the central open problem in this area but delivering even more in terms of security. This is joint work with Mihir Bellare and Alexander Vardy (UCSD).

Abstract:

The wiretap channel is a setting where one aims to provide information-theoretic privacy of communicated data based solely on the assumption that the channel from sender to adversary is “noisier” than the channel from sender to receiver. The central quest in this area has been secure schemes of optimal rate but decades of work have provided only non constructive proofs of existence of such schemes for a notion of security that from the cryptographic perspective is weak. We define and prove equivalent two strong security metrics, one based on semantic security and the other on entropy. We then provide a new scheme that achieves these strong security goals in polynomial time with optimal rate, thereby not only solving the central open problem in this area but delivering even more in terms of security. This is joint work with Mihir Bellare and Alexander Vardy (UCSD).

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.84 Mbits/sec	808.52 MB	View	Download
WebM	640x360	669.48 kbits/sec	285.95 MB	View	Download
Flash Video	484x272	568.88 kbits/sec	242.91 MB	View	Download
iPod Video	480x270	506.23 kbits/sec	216.23 MB	View	Download
MP3	44100 Hz	125.02 kbits/sec	53.26 MB	Listen	Download
Auto *	(Allows browser to choose a format it supports)