Paper 2020/758

Verifiable state machines: Proofs that untrusted services operate correctly

Srinath Setty, Sebastian Angel, and Jonathan Lee

Abstract

This article describes recent progress in realizing verifiable state machines, a primitive that enables untrusted services to provide cryptographic proofs that they operate correctly. Applications of this primitive range from proving the correct operation of distributed and concurrent cloud services to reducing blockchain transaction costs by leveraging inexpensive off-chain computation without trust.

Note: Fix typos

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. MINOR revision.ACM SIGOPS Operating Systems Review
DOI
10.1145/3421473.3421479
Keywords
verifiable state machinesSNARKszero-knowledge
Contact author(s)
srinath @ microsoft com
History
2020-09-02: revised
2020-06-21: received
See all versions
Short URL
https://ia.cr/2020/758
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/758,
      author = {Srinath Setty and Sebastian Angel and Jonathan Lee},
      title = {Verifiable state machines: Proofs that untrusted services operate correctly},
      howpublished = {Cryptology ePrint Archive, Paper 2020/758},
      year = {2020},
      doi = {10.1145/3421473.3421479},
      note = {\url{https://eprint.iacr.org/2020/758}},
      url = {https://eprint.iacr.org/2020/758}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.