Related papers: Emulating OP

Emulating OP_RAND in Bitcoin

URL: http://arxiv.org/abs/2501.16451v2
Date: Thu, 13 Feb 2025 15:48:32 GMT
Title: Emulating OP_RAND in Bitcoin
Authors: Oleksandr Kurbatov,
Abstract summary: This paper proposes a method of emulation of verb|OP_RAND| opcode on Bitcoin through a trustless interactive game between transaction counterparties. The protocol can be organized in a way unrecognizable to any external party and doesn't require some specific scripts or Bitcoin protocol updates.
Score: 20.069861855710325
License:
Abstract: This paper proposes a method of emulation of \verb|OP_RAND| opcode on Bitcoin through a trustless interactive game between transaction counterparties. The game result is probabilistic and doesn't allow any party to cheat, increasing their chance of winning on any protocol step. The protocol can be organized in a way unrecognizable to any external party and doesn't require some specific scripts or Bitcoin protocol updates. We will show how the protocol works on the simple \textbf{Thimbles Game} and provide some initial thoughts about approaches and applications that can use the mentioned approach.

Related papers

Should I Trust You? Detecting Deception in Negotiations using Counterfactual RL [30.6942857922867]
We analyze how humans strategically deceive each other in textitDiplomacy, a board game that requires both natural language communication and strategic reasoning. Our method detects human deception with a high precision when compared to a Large Language Model approach. Future human-abrai interaction tools can build on our methods for deception detection by triggering textitfriction to give users a chance of interrogating suspicious proposals.
arXiv Detail & Related papers (2025-02-18T02:11:41Z)
Atomic Transfer Graphs: Secure-by-design Protocols for Heterogeneous Blockchain Ecosystems [7.312229214872541]
We propose a framework for generating secure-by-design protocols that realize common security and functionality goals. The resulting protocols build upon Timelock Contracts (CTLCs), a novel minimal smart contract functionality. Our framework is the first to provide generic and provably secure protocols for all these use cases while matching or improving the performance of existing use-case-specific protocols.
arXiv Detail & Related papers (2025-01-29T17:25:53Z)
Tyche: Collateral-Free Coalition-Resistant Multiparty Lotteries with Arbitrary Payouts [23.27199615640474]
We propose Tyche, a family of protocols for performing efficient multiparty lotteries. Our protocols are based on a commit-and-reveal approach, requiring only a collision-resistant hash function. We show that our protocols are secure, fair, and some preserve the participants' privacy.
arXiv Detail & Related papers (2024-09-05T12:19:37Z)
The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z)
How To Save Fees in Bitcoin Smart Contracts: a Simple Optimistic Off-chain Protocol [0.40964539027092906]
We consider the execution of smart contracts on Bitcoin. We introduce a protocol that moves most of the execution of a Bitcoin contract off-chain.
arXiv Detail & Related papers (2024-03-14T21:20:36Z)
CryptoVerif: a Computationally-Sound Security Protocol Verifier (Initial Version with Communications on Channels) [2.06682776181122]
This document presents the security protocol verifier CryptoVerif. It does not rely on the symbolic, Dolev-Yao model, but on the computational model. It can work automatically, or the user can guide it with manual proof indications.
arXiv Detail & Related papers (2023-10-23T07:53:38Z)
Implicit Communication as Minimum Entropy Coupling [42.13333133772116]
In many common-payoff games, achieving good performance requires players to develop protocols for communicating their private information implicitly. We identify a class of partially observable common-payoff games, which we call implicit referential games, whose difficulty can be attributed to implicit communication. We show that this method can discover performant implicit communication protocols in settings with very large spaces of messages.
arXiv Detail & Related papers (2021-07-17T17:44:30Z)
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z)
Collaborative Deanonymization [0.0]
We propose protocols to resolve the tension between anonymity and accountability in a peer-to-peer manner. We illustrate how the protocols could apply to Monero rings and CoinJoin transactions in Bitcoin.
arXiv Detail & Related papers (2020-05-07T15:03:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.