Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts

@article{Banasik2016EfficientZC,
  title={Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts},
  author={Waclaw Banasik and Stefan Dziembowski and Daniel Malinowski},
  journal={IACR Cryptol. ePrint Arch.},
  year={2016},
  volume={2016},
  pages={451}
}
One of the most promising innovations offered by the cryptographic currencies (like Bitcoin) are the so-called smart contracts, which can be viewed as financial agreements between mutually distrusting participants. Their execution is enforced by the mechanics of the currency, and typically has monetary consequences for the parties. The rules of these contracts are written in the form of so-called “scripts”, which are pieces of code in some “scripting language”. Although smart contracts are… 
SoK: unraveling Bitcoin smart contracts
TLDR
This paper presents a comprehensive survey of smart contracts on Bitcoin, in a uniform framework based on a new formal specification language for smart contracts, which also helps to highlight some subtleties in existing informal descriptions, making a step towards automatic verification.
Financial Cryptography and Data Security
TLDR
Focussing on the two most widespread platforms, Bitcoin and Ethereum, the usage of smart contracts in relation to their application domain is quantified and the most common programming patterns in Ethereum are analysed.
A Proof-of-Stake Protocol for Consensus on Bitcoin Subchains
TLDR
This work proposes a consensus protocol, based on Proof-of-Stake, that incentivizes nodes to consistently extend the subchain and empirically evaluates the security of the protocol, and shows how to exploit it as the basis for smart contracts on Bitcoin.
Verification of recursive Bitcoin contracts
TLDR
This work addresses the problem of verifying liquidity on BitML, a DSL for smart contracts with a secure compiler to Bitcoin, featuring primitives for currency transfers, contract renegotiation and consensual recursion, and implements a toolchain that automatically verifies liquidity of BitML contracts and compiles them to Bitcoin.
Verifying liquidity of recursive Bitcoin contracts
TLDR
This work addresses the problem of verifying liquidity on BitML, a DSL for smart contracts with a secure compiler to Bitcoin, featuring primitives for currency transfers, contract renegotiation and consensual recursion, and implements a toolchain that automatically verifies liquidity of BitML contracts and compiles them to Bitcoin.
On the Possibility of Creating Smart Contracts on Bitcoin by MPC-based Approaches
  • Ahmad Jahanbin, M. S. Haghighi
  • Computer Science, Mathematics
    2021 26th International Computer Conference, Computer Society of Iran (CSICC)
  • 2021
TLDR
This paper formally defines what a smart contract is and introduces seven requirements that if are satisfied, can make creation of smart contracts for Bitcoin possible and examines the ability of the current methods that use secure Multi-party Computation to create smart deals for Bitcoin and shows where they fall short.
Off-chain protocols for cryptocurrencies
TLDR
This work shows how to construct threshold signatures that are compatible with Bitcoin, and uses this primitive to build off-chain protocols for privacy-preserving access control and escrow services, and presents Arbitrum, a private and scalable smart contract system which enables running arbitrary smart contracts for which the code is executed off- chain and disputes are resolved on-chain.
Generalized Bitcoin-Compatible Channels
TLDR
Generalized channels are introduced and formalized, providing a cryptographic instantiation of generalized channels that is compatible with Bitcoin, leveraging adaptor signatures – a cryptographic primitive already used in the cryptocurrency literature but formalized as a standalone primitive in this work for the first time.
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends
TLDR
A new framework that makes it possible to re-write or compress the content of any number of blocks in decentralized services exploiting the blockchain technology, and details how to integrate a chameleon hash function in virtually any blockchain-based technology.
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
TLDR
This survey presents guidelines for designing an anonymity/privacy improvement and discusses future research directions, and examines the studies in the literature/Web in two major categories: analyses of anonymity and privacy in Bitcoin and extensions and alternatives to Bitcoin, which improve anonymity and Privacy.
...
...

References

SHOWING 1-10 OF 50 REFERENCES
Demystifying Incentives in the Consensus Computer
TLDR
This work calls the framework of computation through a scriptable cryptocurrency a consensus computer and develops a model that captures incentives for verifying computation in it and proposes a resolution to the verifier's dilemma which incentivizes correct execution of certain applications, including outsourced computation, where scripts require minimal time to verify.
Zerocash: Decentralized Anonymous Payments from Bitcoin
TLDR
This paper formulate and construct decentralized anonymous payment schemes (DAP schemes) and builds Zero cash, a practical instantiation of the DAP scheme construction that is orders of magnitude more efficient than the less-anonymous Zero coin and competitive with plain Bit coin.
Bitcoin: A Peer-to-Peer Electronic Cash System
TLDR
This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.
Fair Two-Party Computations via Bitcoin Deposits
TLDR
The Bitcoin currency system can be used to obtain fairness in any two-party secure computation protocol in the following sense: if one party aborts the protocol after learning the output then the other party gets a financial compensation (in bitcoins).
Timed Commitments
We introduce and construct timed commitment schemes, an extension to the standard notion of commitments in which a potential forced opening phase permits the receiver to recover (with effort) the
Securing Bitcoin wallets via a new DSA / ECDSA threshold signature scheme
TLDR
The first threshold signature scheme compatible with Bitcoin’s ECDSA signatures is presented and it is shown how distributed Bitcoin wallets can be built using this primitive and how to systematically eliminate single points of failure in the flow of bitcoins through the system.
How to Use Bitcoin to Play Decentralized Poker
TLDR
This work formalize, generalize, and construct multiparty protocols for the primitive secure cash distribution with penalties, which is dropout-tolerant in the sense that any party that drops out during the protocol is forced to pay a monetary penalty to all other parties.
Note on fair coin toss via Bitcoin
In this short note we show that the Bitcoin network can allow remote parties to gamble with their bitcoins by tossing a fair or biased coin, with no need for a trusted party, and without the
Two-party generation of DSA signatures
We describe a means of sharing the DSA signature function, so that two parties can efficiently generate a DSA signature with respect to a given public key but neither can alone. We focus on a certain
Mastering Bitcoin: Unlocking Digital Crypto-Currencies
TLDR
This book describes the technical foundations of bitcoin and other cryptographic currencies, from cryptography basics, such as keys and addresses, to the data structures, network protocols and the consensus mechanism ("mining") that underpin bitcoin.
...
...