Title :
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications
Author :
Rabin, Michael O. ; Servedio, Rocco A. ; Thorpe, Christopher
Author_Institution :
Harvard Univ., Cambridge
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.
Keywords :
cryptography; evaluator-prover model; highly efficient secrecy-preserving proofs; secure processor; zero knowledge proofs; Circuits; Computer applications; Computer science; Cryptography; Galois fields; Logic; Nominations and elections; Protocols; Security; Voting;
Conference_Titel :
Logic in Computer Science, 2007. LICS 2007. 22nd Annual IEEE Symposium on
Conference_Location :
Wroclaw
Print_ISBN :
0-7695-2908-9
DOI :
10.1109/LICS.2007.24
