Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era

DOI10.1007/978-3-030-45724-2_5zbMath1502.94034OpenAlexW3023319856MaRDI QIDQ2119009

Giorgos Panagiotakos, Rafail M. Ostrovsky, Vassilis Zikas, Juan A. Garay, Aggelos Kiayias

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_5

zbMATH Keywords

multi-party computationresource-restricted cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

A rational protocol treatment of 51\% attacks ⋮ Permissionless consensus in the resource model ⋮ Permissionless clock synchronization with public setup ⋮ Completeness theorems for adaptively secure broadcast ⋮ Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications ⋮ On the power of an honest majority in three-party computation without broadcast

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resource fairness and composability of cryptographic protocols
• Easy impossibility proofs for distributed consensus problems
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Bitcoin as a transaction ledger: a composable treatment
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Security and composition of multiparty cryptographic protocols
• Characterization of Secure Multiparty Computation Without Broadcast
• The Bitcoin Backbone Protocol: Analysis and Applications
• Authenticated Algorithms for Byzantine Agreement
• PoW-Based Distributed Cryptography with No Trusted Setup
• Adaptively Secure Broadcast
• Universally Composable Security with Global Setup
• The Byzantine Generals Problem
• Universally Composable Synchronous Computation
• Unconditional Byzantine agreement for any number of faulty processors
• Analysis of the Blockchain Protocol in Asynchronous Networks

This page was built for publication: Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era