Highly efficient secrecy-preserving proofs of correctness of computations and applications

Michael O. Rabin*, Rocco A. Servedio, Christopher Thorpe

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 22nd Annual IEEE Symposiumon Logic in Computer Science, LICS 2007
Pages63-76
Number of pages14
DOIs
StatePublished - 2007
Externally publishedYes
Event22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007 - Wroclaw, Poland
Duration: 10 Jul 200714 Jul 2007

Publication series

NameProceedings - Symposium on Logic in Computer Science
ISSN (Print)1043-6871

Conference

Conference22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007
Country/TerritoryPoland
CityWroclaw
Period10/07/0714/07/07

Fingerprint

Dive into the research topics of 'Highly efficient secrecy-preserving proofs of correctness of computations and applications'. Together they form a unique fingerprint.

Cite this