Bit Encryption is Complete
Speaker: Abhi Shelat, , University of VA
Date: Friday, November 13 2009
Time: 10:30AM to 12:00PM
Location: 1st Floor, Microsoft Research NE, Camb.
Host: Silvio Micali, CSAIL, MIT
Contact: Be, 3-6098, imbe@mit.edu
Relevant URL: We show that an encryption scheme that encrypts only 1-bit at a time can be used to construct an encryption scheme that encrypts arbitrarily long messages.
This property is well-known for some weaker notions of secure encryption. However, for chosen-ciphertext secure (CCA2) encryption---i.e., the notion of encryption that is strong enough for the Internet---the question has remained open since the notion of CCA2 security was introduced by Rackoff and Simon in 1992.
The importance of this work is two-fold: we extend our understanding of encryption by establishing that bit-encryption is complete, and we introduce a novel technique that may help resolve remaining open questions about encryption.
Joint work with Steven Myers at Indiana.
See other events that are part of CIS/Microsoft Seminars 2009/2010
See other events happening in November 2009
