loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications
Wroclaw, Poland
July 10-July 14
ISBN: 0-7695-2908-9
ASCII Text
x 
 
Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe, "Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications," Logic in Computer Science, Symposium on, pp. 63-76, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2007.24,
author = {Michael O. Rabin and Rocco A. Servedio and Christopher Thorpe},
title = {Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2007},
issn = {1043-6871},
pages = {63-76},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2007.24},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications
SN - 1043-6871
SP63
EP76
A1 - Michael O. Rabin,
A1 - Rocco A. Servedio,
A1 - Christopher Thorpe,
PY - 2007
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
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.