Cryptology ePrint Archive: Report 2020/758

Verifiable state machines: Proofs that untrusted services operate correctly

Srinath Setty and 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.

Category / Keywords: cryptographic protocols / verifiable state machines, SNARKs, zero-knowledge

Original Publication (with minor differences): ACM SIGOPS Operating Systems Review
DOI:
10.1145/3421473.3421479

Date: received 20 Jun 2020, last revised 2 Sep 2020

Contact author: srinath at microsoft com

Available format(s): PDF | BibTeX Citation

Note: Fix typos

Version: 20200902:163149 (All versions of this report)

Short URL: ia.cr/2020/758


[ Cryptology ePrint archive ]