Adaptively Secure Broadcast
From MaRDI portal
Publication:3563851
DOI10.1007/978-3-642-13190-5_24zbMath1280.94067OpenAlexW2140376574MaRDI QIDQ3563851
Publication date: 1 June 2010
Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_24
Related Items (15)
Adaptively Secure Coin-Flipping, Revisited ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Completeness theorems for adaptively secure broadcast ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications ⋮ Adaptive security of multi-party protocols, revisited ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
This page was built for publication: Adaptively Secure Broadcast
