Invited Paper: Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications (at LICS 2007)

Authors: Michael O. Rabin Rocco A. Servedio Christopher Thorpe

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.

BibTeX

  @InProceedings{RabinServedioThorpe-HighlyEfficientSecr,
    author = 	 {Michael O. Rabin and Rocco A. Servedio and Christopher Thorpe},
    title = 	 {Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications},
    booktitle =  {Proceedings of the Twenty-Second Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
    year =	 {2007},
    month =	 {July}, 
    pages =      {63--76},
    location =   {Wroclaw, Poland}, 
    note =       {Invited Talk},
    publisher =	 {IEEE Computer Society Press}
  }