PoW-based distributed cryptography with no trusted setup

DOI10.1007/978-3-662-48000-7_19MaRDI QIDQ3457075zbMATH OpenOpenAlexFDO

Authors Marcin Andrychowicz, Stefan Dziembowski

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)

Recommendations

• Bootstrapping the blockchain, with applications to consensus and fast PKI setup
• Indistinguishable proofs of work or knowledge
• The Bitcoin Backbone Protocol: Analysis and Applications
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
• Random oracles in constantipole

Cites work

• Authenticated Algorithms for Byzantine Agreement
• Byzantine agreement given partial broadcast
• Pebbling and Proofs of Work
• Secure multiparty computation goes live
• The Byzantine Generals Problem
• Transaction protection by beacons
• Universally composable synchronous computation

Cited in

(18)

• Bootstrapping the blockchain, with applications to consensus and fast PKI setup
• Dynamic ad hoc clock synchronization
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
• Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
• Scalable zero knowledge with no trusted setup
• Bankrupting Sybil despite churn
• Resource Burning for Permissionless Systems (Invited Paper)
• Bootstrapping Public Blockchains Without a Trusted Setup
• 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
• Bitcoin as a Transaction Ledger: A Composable Treatment
• Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
• Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
• Proof-of-work-based consensus in expected-constant time
• Round efficient Byzantine agreement from VDFs
• Efficient agreement over Byzantine gossip
• The bitcoin backbone protocol: analysis and applications

This page was built for publication: PoW-based distributed cryptography with no trusted setup

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457075)