CIS Seminar - Ran Canetti
Speaker: Ran Canetti , IBM, TJ Watson/MIT
Date: February 8 2008
Time: 10:30AM to 12:00PM
Location: G449 Patil/Kiva
Contact: Be Blackburn, 3-6098, firstname.lastname@example.org
A desirable goal for cryptographic protocols is to guarantee security
when the protocol is composed with other protocol instances.
Universally Composable (UC) security provides this guarantee in a
strong sense: A UC-secure protocol maintains its security properties
even when composed concurrently with an unbounded number of instances
of arbitrary protocols. However, many interesting cryptographic tasks
are provably impossible to realize with UC security, unless some
trusted set-up is assumed.
We review the basic impossibility results and examine a number of
quite different trust models that were recently demonstrated to
suffice for constructing UC-secure protocols that realize practically
any cryptographic task.
(This is a re-run of a talk given at Asiacrypt 2007.)
See other events that are part of Cryptography and Information Security Seminars 2007/2008
See other events happening in February 2008