Modeling Bitcoin Contracts by Timed Automata

DOI10.1007/978-3-319-10512-3_2zbMath1448.91328arXiv1405.1861OpenAlexW4993390WikidataQ111687910 ScholiaQ111687910MaRDI QIDQ5500550

Łukasz Mazurek, Daniel Malinowski, Marcin Andrychowicz, Stefan Dziembowski

Publication date: 6 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.1861

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Actuarial science and mathematical finance (91G99)

Related Items (21)

Incentive-driven attacker for corrupting two-party protocols ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ Shielded computations in smart contracts overcoming forks ⋮ A formal model of Algorand smart contracts ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Absentia: secure multiparty computation on ethereum ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Fully-secure MPC with minimal trust ⋮ Game-Theoretic Analysis of an Incentivized Verifiable Computation System ⋮ Financially backed covert security ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Bankrupting Sybil despite churn ⋮ Unnamed Item ⋮ How to build time-lock encryption ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Abuse resistant law enforcement access systems ⋮ FAST: fair auctions via secret transactions ⋮ Blind polynomial evaluation and data trading ⋮ Coin-based multi-party fair exchange ⋮ P2DEX: privacy-preserving decentralized cryptocurrency exchange

Uses Software

• Kronos
• TIMES
• Uppaal

This page was built for publication: Modeling Bitcoin Contracts by Timed Automata