scientific article; zbMATH DE number 1848309
From MaRDI portal
Publication:4785503
zbMath1005.68843MaRDI QIDQ4785503
Christian Cachin, Frank Petzold, Victor Shoup, Klaus Kursawe
Publication date: 25 February 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computing methodologies and applications (68U99) Distributed systems (68M14)
Related Items (17)
The consensus number of a cryptocurrency ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Wendy grows up: more order fairness ⋮ Quick order fairness ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Communication complexity of Byzantine agreement, revisited ⋮ On the Validity of Consensus ⋮ Byzantine-tolerant causal broadcast ⋮ Efficient Simultaneous Broadcast ⋮ On Optimal Probabilistic Asynchronous Byzantine Agreement ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Order-fairness for Byzantine consensus ⋮ Making Byzantine consensus live
This page was built for publication:
