Two distinct, rigorous views of cryptography have developed over the years, in two mostly separate communities. One of the views relies on a simple but effective formal approach; the other, on a detailed computational model that considers issues of complexity and probability. There is an uncomfortable and interesting gap between these two approaches to cryptography. In this talk, we discuss this gap and start to bridge it by providing a computational justification for a formal treatment of encryption.
Gates 498, 4/25/00, 4:15 PM