Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications

@article{Rabin2007HighlyES,
  title={Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications},
  author={Michael O. Rabin and Rocco A. Servedio and Christopher Thorpe},
  journal={22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
  year={2007},
  pages={63-76}
}
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. 
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…