Skip to main content

Hyper-Encryption and Ever Lasting Secrets

Michael Rabin ( Harvard University )
Modern encryption is based on unproven assumptions concerning the intractability of certain computational tasks. We present a novel encryption method and prove its security against an adversary with unlimited computing power. The encryption remains secure even if the adversary mounts an adaptive attack and later on obtains the secret decryption key. Hence the property of ever lasting secrecy. We shall also discuss general cryptographic issues. The presentation is self contained and accessible to non-experts.

Speaker bio

Michael O. Rabin is T.J. Watson Sr. Professor of Computer Science at Harvard University. His research interests include complexity of computations, efficient algorithms, randomized algorithms, DNA computing, parallel and distributed computations, and computer security. He is also interested in bringing traditional mathematical tools to bear on computer science problems of foundational as well as of practical significance.

He obtained his M.Sc. in Mathematics from the Hebrew University and his Ph.D. from Princeton University. In 1992 he was H. Saville Fellow at Merton College, Oxford. His honors include the A. M. Turing Award, the Israel Prize in C.S., the Rothschild Prize in Mathematics, membership in the US National Academy of Sciences, the Israel Academy of Sciences and Humanities, the French Academy of Sciences as well as several honorary doctorates.

Share this: