Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography - MaRDI portal

Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography

From MaRDI portal
Publication:2501710

DOI10.1007/s00145-005-0318-0zbMath1097.68559OpenAlexW2106004025MaRDI QIDQ2501710

Klaus Kursawe, Christian Cachin, Victor Shoup

Publication date: 12 September 2006

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-005-0318-0




Related Items (20)

Adaptively secure distributed PRFs from LWERound-optimal Byzantine agreementSynchronous consensus with optimal asynchronous fallback guaranteesCompressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold SignaturesConstant-Round Asynchronous Multi-Party Computation Based on One-Way FunctionsReaching consensus for asynchronous distributed key generationQuantum detectable Byzantine agreement for distributed data trust management in blockchainExpected linear round synchronization: the missing link for linear Byzantine SMRBuilding blocks of sharding blockchain systems: concepts, approaches, and open problemsOn the complexity of asynchronous agreement against powerful adversaries\textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generationAlmost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilienceRound-efficient Byzantine agreement and multi-party computation with asynchronous fallbackRevising the Membrane Computing Model for Byzantine AgreementRandomization can be a healer: consensus with dynamic omission failuresP systems and the Byzantine agreementStrong \((n, t, n)\) verifiable secret sharing schemeOn Optimal Probabilistic Asynchronous Byzantine AgreementOn expected constant-round protocols for Byzantine agreementAdaptively secure distributed PRFs from \(\mathsf{LWE}\)




This page was built for publication: Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography