Shielded computations in smart contracts overcoming forks

DOI10.1007/978-3-662-64322-8_4zbMath1491.91164OpenAlexW3210043073MaRDI QIDQ2145367

Vincenzo Botta, Daniele Friolo, Ivan Visconti, Daniele Venturi

Publication date: 17 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_4

zbMATH Keywords

MPCblockchainfinalitysmart contractsforks

Mathematics Subject Classification ID

Cryptography (94A60) Actuarial science and mathematical finance (91G99)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Thunderella: blockchains with optimistic instant confirmation
• Bitcoin as a transaction ledger: a composable treatment
• Overcoming cryptographic impossibility results using blockchains
• Instantaneous decentralized poker
• Efficient constant-round MPC with identifiable abort and public verifiability
• Afgjort: a partially synchronous finality layer for blockchains
• Insured MPC: efficient secure computation with financial penalties
• Publicly verifiable proofs from blockchains
• Founding secure computation on blockchains
• Secure Multi-Party Computation with Identifiable Abort
• How to Use Bitcoin to Design Fair Protocols
• The Bitcoin Backbone Protocol: Analysis and Applications
• Analysis of the Blockchain Protocol in Asynchronous Networks
• Modeling Bitcoin Contracts by Timed Automata
• Fair and Robust Multi-party Computation Using a Global Transaction Ledger
• Hybrid consensus: efficient consensus in the permissionless model

This page was built for publication: Shielded computations in smart contracts overcoming forks