Verifiable state machines

Q3 Computer Science

Operating Systems Review (ACM) Pub Date : 2020-08-31 DOI:10.1145/3421473.3421479

Srinath T. V. Setty, Sebastian Angel, Jonathan Lee

引用次数: 6

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.

查看原文本刊更多论文

可验证状态机

本文描述了在实现可验证状态机方面的最新进展，这是一种使不受信任的服务能够提供其正确操作的加密证明的原语。该原语的应用范围从证明分布式和并发云服务的正确操作到通过在不信任的情况下利用廉价的链下计算来降低区块链交易成本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Operating Systems Review (ACM) Computer Science-Computer Networks and Communications

CiteScore

2.80

自引率

0.00%

发文量

期刊介绍： Operating Systems Review (OSR) is a publication of the ACM Special Interest Group on Operating Systems (SIGOPS), whose scope of interest includes: computer operating systems and architecture for multiprogramming, multiprocessing, and time sharing; resource management; evaluation and simulation; reliability, integrity, and security of data; communications among computing processors; and computer system modeling and analysis.