Fair and Robust Multi-party Computation Using a Global Transaction Ledger
From MaRDI portal
Publication:5739220
DOI10.1007/978-3-662-49896-5_25zbMath1371.94643OpenAlexW2430991892MaRDI QIDQ5739220
Vassilis Zikas, Aggelos Kiayias, Hong-Sheng Zhou
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/chapter/10.1007%2F978-3-662-49896-5_25
Related Items (19)
Shielded computations in smart contracts overcoming forks ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ SoK: communication across distributed ledgers ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Constant-round linear-broadcast secure computation with penalties ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Formalizing delayed adaptive corruptions and the security of flooding networks ⋮ A universally composable non-interactive aggregate cash system ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Completeness theorems for adaptively secure broadcast ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ On the (Ir)replaceability of global setups, or how (not) to use a global ledger ⋮ Etherless Ethereum Tokens: simulating native tokens in Ethereum ⋮ From fairness to full security in multiparty computation ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ FAST: fair auctions via secret transactions ⋮ Coin-based multi-party fair exchange ⋮ P2DEX: privacy-preserving decentralized cryptocurrency exchange
This page was built for publication: Fair and Robust Multi-party Computation Using a Global Transaction Ledger
