Shielded computations in smart contracts overcoming forks
From MaRDI portal
Publication:2145367
DOI10.1007/978-3-662-64322-8_4zbMATH Open1491.91164OpenAlexW3210043073MaRDI QIDQ2145367FDOQ2145367
Vincenzo Botta, Daniele Friolo, Ivan Visconti, D. Venturi
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_4
Recommendations
- Insured MPC: efficient secure computation with financial penalties
- Efficient fair multiparty protocols using blockchain and trusted hardware
- Fair and robust multi-party computation using a global transaction ledger
- Instantaneous decentralized poker
- From fairness to full security in multiparty computation
Cites Work
- Title not available (Why is that?)
- The Bitcoin Backbone Protocol: Analysis and Applications
- How to Use Bitcoin to Design Fair Protocols
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Modeling Bitcoin Contracts by Timed Automata
- Thunderella: blockchains with optimistic instant confirmation
- Bitcoin as a transaction ledger: a composable treatment
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger
- Overcoming cryptographic impossibility results using blockchains
- Founding secure computation on blockchains
- Instantaneous decentralized poker
- Secure Multi-Party Computation with Identifiable Abort
- Publicly verifiable proofs from blockchains
- Efficient constant-round MPC with identifiable abort and public verifiability
- Insured MPC: efficient secure computation with financial penalties
- Hybrid consensus: efficient consensus in the permissionless model
- Afgjort: a partially synchronous finality layer for blockchains
Uses Software
This page was built for publication: Shielded computations in smart contracts overcoming forks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145367)
