loading...
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications
Wroclaw, Poland July 10-July 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2007.2422nd Annual IEEE Symposium on Logic i ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Michael O. Rabin, Harvard University, USA
Rocco A. Servedio, Columbia University, USA
Christopher Thorpe, Harvard University, USA
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
Usage of this product signifies your acceptance of the Terms of Use.