We present a highly efficient method for proving correctness of computations while preserving secrecy of the input values. This is done in an Evaluator-Prover model which can also be realized by a secure processor. We describe an application to secure auctions.
Citation:
Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe, "Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications," lics, pp.63-76, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007