Thursday, March 30, 2006
4:15 pm
B17 Upson Hall

Computer Science
Spring 2006

Rafael Pass
Massachusetts Institute of Technology


Concurrency and the Security of Protocols

Cryptographic protocols have been developed for a variety of tasks, including electronic auctions, electronic voting systems, privacy preserving data mining and more. The Internet allows for the concurrent execution of cryptographic protocols. Such concurrency severely challenges their security.

In this talk we introduce a novel technique for transforming any "stand-alone'' secure protocol (i.e., one whose security is only guaranteed if executed in isolation) into one that is secure under concurrent executions. Contrary to previous results in the literature, this result is established without assuming ANY additional trust.

Rafael Pass is a Ph.D. candidate in the Department of Electrical Engineering and Computer Science at MIT, where he is a member of the Cryptography and Information Security Group. His research interests are in the field of Cryptography and its interplay with Computational Complexity (and Game Theory).