Highly Efficient Secrecy-Preserving Proofs of Correctness of
Computations and Applications.
M.
Rabin and
R. Servedio and
C. Thorpe.
22nd IEEE Symposium on Logic in Computer Science (LICS),
2007, pp. 63--76.
Abstract:
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.
pdf of journal version
Back to
main papers page