Wed. Nov. 7, 2007 - Michael O. Rabin: Highly Efficient Zero Knowledge Proofs and Practical Secure and Secrecy Preserving Auctions
The Center for Research on Computation and Society continues its weekly lunch seminar:
CRCS Privacy and Security Lunch Seminar
Date: Wednesday, 7 November 2007
Time: 12:00pm-1:00pm (Lunch Provided)
Place: Maxwell Dworkin119
Speaker: Michael O. Rabin, Harvard University Thomas J. Watson, Sr. Professor of Computer Science
Topic: Highly Efficient Zero Knowledge Proofs and Practical Secure and Secrecy Preserving Auctions
Abstract:
We consider a new model of an Evaluator
Prover who receives input values from parties
P_1, …, P_n, performs a computation on these values
and publishes the result together
with a ZKP of its correctness. The efficiency is achieved
by working directly with input numbers rather than at the bit/circuit
level. It achieves a hundred-fold efficiency improvement
over methods employing homomorphic encryptions.
Classical ZKPs can be made a special case as n =0. Applications
include practical secure and secrecy preserving auctions. Presentation will be self contained.
Joint work with Rocco Servidio and Chris Thorpe.
Are you looking for mp3 music and downloads? Try buy mp3 website, fast downloads, more than 2M tracks available, cheap prices.