Limits of Provable Security from Standard Assumptions
Speaker: Rafael Pass , Cornell U.
Date: October 14 2011
Time: 10:30AM to 12:00PM
Location: 32-G449 Patil/Kiva
Host: Silvio Micali, CSAIL, MIT
Contact: Be Blackburn, 3-6098, imbe@mit.edu
Relevant URL: We show that the security of some well-known cryptographic
protocols, primitives and assumptions (e.g., the Schnorr
identification scheme, commitments secure under adaptive selective
decommitment, the one-more discrete logarithm assumption) cannot
be based on any standard intractability assumption using a Turing
(i.e., black-box) reduction. This result holds even if the protocol
makes non-black-box use of the underlying assumption.
See other events that are part of CIS Seminars 2011/2012
See other events happening in October 2011
