Vitārit: Paying for Threshold Services on Bitcoin and Friends
Sri Aravinda Krishnan Thyagarajan, Easwar Vivek Mangipudi, Lucjan Hanzlik, Aniket Kate, Pratyay Mukherjee
摘要
Blockchain service offerings have seen a rapid rise in recent times. Many of these services realize a decentralized architecture with a threshold adversary to avoid a single point of failure and to mitigate key escrow issues. Although payments to such services are straightforward in systems that support smart contracts, achieving fairness poses challenges in systems like Bitcoin, which use the UTXO model with limited scripting capabilities. This is especially challenging without smart contracts, as we wish to pay only the required threshold of + 1 out of the servers offering the service, without any server claiming payment twice. In this paper, we introduce Vitārit11.A Sanskrit word for ‘distributed’, a novel payment solution tailored for threshold cryptographic services in UTXO systems like Bitcoin. Our approach guarantees robust, provable security while facilitating practical deployment. We focus on the t-out-of-n distributed threshold verifiable random function (VRF) service with certain properties, such as threshold BLS signatures, a recently highlighted area of interest. Our protocol enables clients to request verifiable random function (VRF) values from the threshold service, triggering payments to up to + 1 servers of the distributed threshold VRF. Our efficient design relies on simple transactions using signature verification scripts, making it immediately applicable in Bitcoin-like systems. We also introduce new tools and techniques at both the cryptographic and transaction layers, including a novel signature-VRF exchange protocol for standard constructions, which may be of independent interest. Additionally, our transaction flow design prevents malicious servers from claiming payments twice, offering broader implications for decentralized payment systems. Our prototype implementation shows that in the two-party interaction, the client takes 126.4 msec, and the server takes 204 msec, demonstrating practicality and deployability of the system.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper23
- Anonymous Multi-Hop Locks for Blockchain Scalability and InteroperabilityGiulio Malavolta, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate 等NDSS 2019 · 被引用 305 次
- Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for ServicesMatteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca NizzardoCCS 2017 · 被引用 170 次
- Universal Atomic Swaps: Secure Exchange of Coins Across All BlockchainsSri Aravinda Krishnan Thyagarajan, Giulio Malavolta, Pedro Moreno-SanchezS&P 2022 · 被引用 112 次
- DECO: Liberating Web Data Using Decentralized Oracles for TLSFan Zhang, Deepak Maram, Harjasleen Malvai, Steven Goldfeder 等CCS 2020 · 被引用 110 次
- A2L: Anonymous Atomic Locks for Scalability in Payment Channel HubsErkan Tairi, Pedro Moreno-Sanchez, Matteo MaffeiS&P 2021 · 被引用 96 次
相关 Paper
- FlexiRand: Output Private (Distributed) VRFs and Application to BlockchainsAniket Kate, Easwar Vivek Mangipudi, Siva Maradana, Pratyay MukherjeeCCS 2023 · 被引用 11 次
- Cryptographic Oracle-based Conditional PaymentsVarun Madathil, Sri Aravinda Krishnan Thyagarajan, Dimitrios Vasilopoulos, Lloyd Fournier 等NDSS 2023
- Threshold Cryptography as a Service (in the Multiserver and YOSO Models)Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Alex Miao 等CCS 2022 · 被引用 13 次
- Ark: Offchain Transaction Batching in BitcoinPim Keer, Matteo Maffei, Marco Argentieri, Andrew Camilleri 等CCS 2026
- Bitcontracts: Supporting Smart Contracts in Legacy BlockchainsKarl Wüst, Loris Diana, Kari Kostiainen, Ghassan Karame 等NDSS 2021
