惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

雷峰网
雷峰网
博客园 - 聂微东
酷 壳 – CoolShell
酷 壳 – CoolShell
宝玉的分享
宝玉的分享
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
罗磊的独立博客
Hugging Face - Blog
Hugging Face - Blog
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
IT之家
IT之家
博客园_首页
博客园 - 三生石上(FineUI控件)
博客园 - 叶小钗
Apple Machine Learning Research
Apple Machine Learning Research
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
量子位
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
人人都是产品经理
人人都是产品经理
美团技术团队
小众软件
小众软件
Jina AI
Jina AI
S
SegmentFault 最新的问题
博客园 - Franky
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com

Cryptology ePrint Archive

Fast Isogeny Evaluation on Binary Curves Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange A Constructive Treatment of Authentication Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators HAWK with Hint: Algebraic Key Recovery from Side-Channel Leakage Post-Quantum Secure k-Times Traceable Ring Signature A Key Schedule Design and Evaluation under Boundary Round-Key Leakage 2G2T: Constant-Size, Statistically Sound MSM Outsourcing Proximity Signatures Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-Quantum Cryptography Efficient Partially Blind Signatures from Isogenies Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning High-Throughput Side-Channel-Protected Stream Cipher Hardware for 6G Systems Efficient e = 3 Threshold RSA via Integer Coordinates for Intel SGX Zeal: PIR for Non-Cooperative Databases VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems Witness-Indistinguishable Arguments of Knowledge and One-Way Functions The many faces of Schnorr: a touch-up Open Problems in List Decoding and Correlated Agreement Compressed Key Exchange Protocol from Orientations of Large Discriminant Using AVX-512 SPLASH: SPeculative Leakage-Adaptive Secure Hardware An Efficient Identity-Based Blind Signature Scheme from SM9 Efficient Batch Threshold Encryption Using Partial Fraction Techniques A note on the Unsuitability of LIGA for Linkable Ring Signatures: The perils of non-commutativity Verification Facade: Masquerading Insecure Cryptographic Implementations as Verified Code Cryptographic Implications of Worst-Case Hardness of Time-Bounded Kolmogorov Complexity Efficient Merkle-Tree Consistent Accumulator FLOSS: Fast Linear Online Secret-Shared Shuffling Which Privacy Blanket is Optimal in the Shuffle Model? Applications of Bruhat-Chevalley-Renner Decomposition to Metric-Aware Code-Based Cryptography
BitPriv: A Privacy-Preserving Protocol for DeFi Applicati...
Ioannis Alex · 2025-09-02 · via Cryptology ePrint Archive

Paper 2025/1575

BitPriv: A Privacy-Preserving Protocol for DeFi Applications on Bitcoin

Zeta Avarikioti, TU Wien, Common Prefix

Paul Gerhart, TU Wien

Matteo Maffei, TU Wien

Dominique Schröder, Friedrich-Alexander-Universität Erlangen-Nürnberg, TU Wien

Abstract

Bitcoin secures over a trillion dollars in assets but remains largely absent from decentralized finance (DeFi) due to its restrictive scripting language. The emergence of BitVM, which enables verification of arbitrary off-chain computations via on-chain fraud proofs, opens the door to expressive Bitcoin-native applications without altering consensus rules. A key challenge for smart contracts executed on a public blockchain, however, is the privacy of data: bid privacy is crucial in auctions, and transaction privacy underlies MEV-mitigation techniques such as proposer-builder separation. While solutions exist for Ethereum, none apply to Bitcoin. In this work, we present BitPriv, the first Bitcoin-compatible protocol to condition payments on the outcome of a secure two-party computation (2PC). At its core is the Garbled Hashed Timelock Contract (GHTLC), a generalization of HTLCs that conditions payment on garbled-circuit output labels rather than arbitrary hash preimages. Parties lock collateral on-chain and evaluate a garbled circuit off-chain; a cut-and-choose mechanism deters misbehavior, and any violation is proven and punished on-chain via BitVM. This design achieves security against rational adversaries: deviation is irrational under financial penalties. We showcase BitPriv through two applications: BitMarket, the first Bitcoin-native sealed-bid auction protocol, and BitBridge, an intent-based cross-chain bridge built by composing BitMarket with a SNARK-verifying settlement layer. Optimistic settlement completes for under $3 in fees in both applications; disputes cost \$47-\$363 depending on the BitVM backend, with their mere feasibility acting as a deterrent under our compliance analysis. BitPriv provides a blueprint for enforceable, privacy-preserving DeFi primitives on Bitcoin without trusted hardware, sidechains, or consensus changes.

BibTeX

@misc{cryptoeprint:2025/1575,
      author = {Ioannis Alexopoulos and Zeta Avarikioti and Paul Gerhart and Matteo Maffei and Dominique Schröder},
      title = {{BitPriv}: A Privacy-Preserving Protocol for {DeFi} Applications on Bitcoin},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1575},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1575}
}