Formalizing delayed adaptive corruptions and the security of flooding networks

DOI10.1007/978-3-031-15979-4_14zbMath1515.68087OpenAlexW4312321278MaRDI QIDQ6104341

Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen

Publication date: 28 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL: https://eprint.iacr.org/2022/010

zbMATH Keywords

peer-to-peer networksuniversal composabilityblockchainadaptive adversariescorruption modelsflooding networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Network protocols (68M12) Computer security (68M25)

Related Items (2)

Practical provably secure flooding for blockchains ⋮ Completeness theorems for adaptively secure broadcast

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• The Bitcoin backbone protocol with chains of variable difficulty
• Bitcoin as a transaction ledger: a composable treatment
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• TARDIS: a foundation of time-lock puzzles in UC
• Universal composition with global subroutines: capturing global setup within plain UC
• Adaptively secure broadcast, revisited
• The Bitcoin Backbone Protocol: Analysis and Applications
• The Hidden Graph Model
• Universally Composable Security with Global Setup
• Universally Composable Synchronous Computation
• Universally Composable Security
• Communication Complexity of Byzantine Agreement, Revisited
• Analysis of the Blockchain Protocol in Asynchronous Networks
• Fair and Robust Multi-party Computation Using a Global Transaction Ledger

This page was built for publication: Formalizing delayed adaptive corruptions and the security of flooding networks