搜索结果: 1-10 共查到“军队指挥学 Optimistic”相关记录10条 . 查询时间(0.087 秒)
Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness
Distributed computing blockchains consensus protocols
2019/3/13
Synchronous solutions for building Byzantine Fault Tolerance (BFT) replication can be safe when < 1/2 of the replicas fail. Assuming ΔΔ is an upper bound on the time for messages to arrive, these solu...
Mixing Networks are protocols that allow a set of senders to send messages anonymously. Such protocols are fundamental building blocks to achieve privacy in a variety of applications, such as anonymou...
Thunderella: Blockchains with Optimistic Instant Confirmation
blockchains optimistic responsiveness
2017/9/25
State machine replication, or “consensus”, is a central abstraction for distributed systems where a set of nodes seek to agree on an ever-growing, linearly-ordered log. In this paper, we propose a pra...
Framework for Analyzing Optimistic Fair Exchange with Distributed Arbiters
Framework Analyzing Optimistic Fair Exchange Distributed Arbiters
2009/6/11
We nominate Alptekin K¨upc¸ ¨u for the Best Student Paper Award
Abstract
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has
something that Bob ...
Usable Optimistic Fair Exchange
Optimistic Fair Exchange sacrificing performance digital files
2009/6/9
Fairly exchanging digital content is an everyday problem. It has been shown that fair
exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a trusted
party, it i...
Optimistic Asynchronous Atomic Broadcast
Asynchronous Consensus Byzantine Faults Atomic Broadcast
2009/4/16
This paper presents a new protocol for atomic broadcast in an asynchronous network with a
maximal number of Byzantine failures. It guarantees both safety and liveness without making
any timing assum...
Constructing Optimistic Fair Exchange Protocols from Committed Signatures
Committed signature scheme optimistic fair exchange protocols strong RSA assumption
2009/4/9
In PODC 2003, Park et al. [32] first introduce a connection
between fair exchange and sequential two-party multi-signature scheme
and provide a novel method of constructing fair exchange protocol by...
Breaking and Repairing Optimistic Fair Exchange from PODC 2003
Optimistic Fair Exchange PODC multisignature schemes
2009/4/9
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair
exchange, based on RSA signatures. We show that their protocol is totally breakable already in the registration...
Efficient and Optimistic Fair Exchanges Based on Standard RSA with Provable Security
Efficient and Optimistic Fair Exchanges Standard RSA Provable Security
2009/4/3
Efficient and Optimistic Fair Exchanges Based on Standard RSA with Provable Security.
Optimistic Fair Exchange in a Multi-user Setting
Optimistic Fair Exchange Multi-user Setting
2008/8/28
This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees ...