PoW-Based Distributed Cryptography with No Trusted Setup

DOI10.1007/978-3-662-48000-7_19zbMath1352.94025OpenAlexW1169198579MaRDI QIDQ3457075

Stefan Dziembowski, Marcin Andrychowicz

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_19

zbMATH Keywords

distributed cryptographic protocolsProofs of Work (PoW)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Resource Burning for Permissionless Systems (Invited Paper) ⋮ Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Completeness theorems for adaptively secure broadcast ⋮ Bankrupting Sybil despite churn ⋮ Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era ⋮ Dynamic ad hoc clock synchronization ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era

Cites Work

• Transaction protection by beacons
• Byzantine agreement given partial broadcast
• Authenticated Algorithms for Byzantine Agreement
• Secure Multiparty Computation Goes Live
• The Byzantine Generals Problem
• Universally Composable Synchronous Computation
• Pebbling and Proofs of Work

This page was built for publication: PoW-Based Distributed Cryptography with No Trusted Setup