``Precise Cryptography'' by Rafael Pass
Speaker: Rafael Pass , Cornell University
Date: October 5 2007
Time: 10:30AM to 12:00PM
Location: 32-G449
Contact: Be Blackburn, 3-6098, imbe@mit.edu
The seminal work of Goldwasser, Micali and Rackoff put forward a
computational approach to knowledge in interactive systems, providing
the foundation of modern Cryptography. Their notion, and its
refinement by Goldriech, Micali and Wigderson, bounds the knowledge of
a player in terms of his *potential* computational power, technically
defined as its worst-case running-time. We put forward a stronger
notion that precisely bounds the knowledge gained by a player in an
interaction in terms of the *actual* computation it has performed in
that *particular* interaction.
Our approach---which is exemplified in the contexts of zero-knowledge
proofs, proofs of knowledge, encryption and secure computation----not
only remains valid even if P= NP, but is most meaningful when modeling
knowledge of computationally easy properties.
See other events that are part of Cryptography and Information Security Seminars 2007/2008
See other events happening in October 2007
