Colloquium Details

Practically Efficient Secrecy Preserving Proofs of Correctness of Computations, and Financial Cryptography

Speaker: Michael O. Rabin, Professor of Computer Science, Harvard University and Google Research

Location: Warren Weaver Hall 1302

Date: February 20, 2009, 11:30 a.m.

Host: Mehryar Mohri


We present a highly efficient method for proving correctness of computations while preserving secrecy of all input and intermediate values.This is done in an Evaluator-Prover model which can also be realized by a secure processor. Applications include secure auctions, purchasing, and share black pools. The presentation will be self-contained and accessible. Joint work with Rocco Servedio and Chris Thorpe.


In-person attendance only available to those with active NYU ID cards. All individuals must show the Daily Screener green pass in order to gain entry to the building.

How to Subscribe