BlindHub: Bitcoin-Compatible Privacy-Preserving Payment Channel Hubs Supporting Variable Amounts

Payment Channel Hub (PCH) is a promising solution to the scalability issue of first-generation blockchains or cryptocurrencies such as Bitcoin. It supports off-chain payments between a sender and a receiver through an intermediary (called the tumbler). Relationship anonymity and value privacy are desirable features of privacy-preserving PCHs, which prevent the tumbler from identifying the sender and receiver pairs as well as the payment amounts. To our knowledge, all existing Bitcoin-compatible PCH constructions that guarantee relationship anonymity allow only a (predefined) fixed payment amount. Thus, to achieve payments with different amounts, they would require either multiple PCH systems or running one PCH system multiple times. Neither of these solutions would be deemed practical.In this paper, we propose the first Bitcoin-compatible PCH that achieves relationship anonymity and supports variable amounts for payment. To achieve this, we have several layers of technical constructions, each of which could be of independent interest to the community. First, we propose BlindChannel, a novel bi-directional payment channel protocol for privacy-preserving payments, where one of the channel parties is unable to see the channel balances. Then, we further propose BlindHub, a three-party (sender, tumbler, receiver) protocol for private conditional payments, where the tumbler pays to the receiver only if the sender pays to the tumbler. The appealing additional feature of BlindHub is that the tumbler cannot link the sender and the receiver while supporting a variable payment amount. To construct BlindHub, we also introduce two new cryptographic primitives as building blocks, namely Blind Adaptor Signature (BAS), and Flexible Blind Conditional Signature (FBCS). BAS is an adaptor signature protocol built on top of a blind signature scheme. FBCS is a new cryptographic notion enabling us to provide an atomic and privacy-preserving PCH. Lastly, we instantiate both BlindChannel and BlindHub protocols and present implementation results to show their practicality.

[1]  Sri Aravinda Krishnan Thyagarajan,et al.  Foundations of Coin Mixing Services , 2022, IACR Cryptol. ePrint Arch..

[2]  Matteo Maffei,et al.  Thora: Atomic and Privacy-Preserving Multi-Channel Updates , 2022, IACR Cryptol. ePrint Arch..

[3]  Tancrède Lepoint,et al.  On the (in)Security of ROS , 2022, Journal of Cryptology.

[4]  Stefanie Roos,et al.  SyncPCN/PSyncPCN: Payment Channel Networks without Blockchain Synchrony , 2022, AFT.

[5]  Kang Yang,et al.  QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field , 2021, IACR Cryptol. ePrint Arch..

[6]  Diego Kreutz,et al.  Analysis of transaction flooding attacks against Monero , 2021, 2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC).

[7]  Pedro Moreno-Sanchez,et al.  A2L: Anonymous Atomic Locks for Scalability in Payment Channel Hubs , 2021, 2021 IEEE Symposium on Security and Privacy (SP).

[8]  Kang Yang,et al.  Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits , 2020, IACR Cryptol. ePrint Arch..

[9]  Masayuki Abe,et al.  WI is Almost Enough: Contingent Payment All Over Again , 2020, CCS.

[10]  Georg Fuchsbauer,et al.  Efficient Signatures on Randomizable Ciphertexts , 2020, IACR Cryptol. ePrint Arch..

[11]  Steven D. Galbraith,et al.  Trustless Groups of Unknown Order with Hyperelliptic Curves , 2020, IACR Cryptol. ePrint Arch..

[12]  Georg Fuchsbauer,et al.  Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model , 2020, EUROCRYPT.

[13]  Tong Cao,et al.  Exploring the Monero Peer-to-Peer Network , 2020, IACR Cryptol. ePrint Arch..

[14]  Sarah Meiklejohn,et al.  QuisQuis: A New Design for Anonymous Cryptocurrencies , 2019, IACR Cryptol. ePrint Arch..

[15]  Man Ho Au,et al.  Re-Thinking Untraceability in the CryptoNote-Style Blockchain , 2019, 2019 IEEE 32nd Computer Security Foundations Symposium (CSF).

[16]  Stefan Dziembowski,et al.  Perun: Virtual Payment Hubs over Cryptocurrencies , 2019, 2019 IEEE Symposium on Security and Privacy (SP).

[17]  Man Ho Au,et al.  New Empirical Traceability Analysis of CryptoNote-Style Blockchains , 2019, Financial Cryptography.

[18]  Prateek Saxena,et al.  Obscuro: A Bitcoin Mixer using Trusted Execution Environments , 2018, IACR Cryptol. ePrint Arch..

[19]  Stefan Dziembowski,et al.  General State Channel Networks , 2018, CCS.

[20]  Emin Gün Sirer,et al.  Teechain: Reducing Storage Costs on the Blockchain With Offline Payment Channels , 2018, SYSTOR.

[21]  Sarah Meiklejohn,et al.  An Empirical Analysis of Anonymity in Zcash , 2018, USENIX Security Symposium.

[22]  Sarah Meiklejohn,et al.  Möbius: Trustless Tumbling for Transaction Privacy , 2018, IACR Cryptol. ePrint Arch..

[23]  Matthew Green,et al.  Bolt: Anonymous Payment Channels for Decentralized Currencies , 2017, CCS.

[24]  Giulio Malavolta,et al.  Concurrency and Privacy with Payment-Channel Networks , 2017, IACR Cryptol. ePrint Arch..

[25]  Prateek Saxena,et al.  A Traceability Analysis of Monero's Blockchain , 2017, ESORICS.

[26]  Pedro Moreno-Sanchez,et al.  PathShuffle: Credit Mixing and Anonymous Payments for Ripple , 2017, Proc. Priv. Enhancing Technol..

[27]  Ethan Heilman,et al.  An Empirical Analysis of Traceability in the Monero Blockchain , 2017, Proc. Priv. Enhancing Technol..

[28]  Pedro Moreno-Sanchez,et al.  ValueShuffle: Mixing Confidential Transactions for Comprehensive Transaction Privacy in Bitcoin , 2017, Financial Cryptography Workshops.

[29]  Melissa Chase,et al.  Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials , 2016, CRYPTO.

[30]  Ethan Heilman,et al.  Blindly Signed Contracts: Anonymous On-Blockchain and Off-Blockchain Bitcoin Transactions , 2016, Financial Cryptography Workshops.

[31]  Christian Decker,et al.  A Fast and Scalable Payment Network with Bitcoin Duplex Micropayment Channels , 2015, SSS.

[32]  Luke Valenta,et al.  Blindcoin: Blinded, Accountable Mixes for Bitcoin , 2015, Financial Cryptography Workshops.

[33]  Brian Neil Levine,et al.  Sybil-Resistant Mixing for Bitcoin , 2014, WPES.

[34]  Pedro Moreno-Sanchez,et al.  CoinShuffle: Practical Decentralized Coin Mixing for Bitcoin , 2014, ESORICS.

[35]  Jeremy Clark,et al.  Mixcoin: Anonymity for Bitcoin with Accountable Mixes , 2014, Financial Cryptography.

[36]  Jens Groth,et al.  Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems , 2004, TCC.

[37]  Chanathip Namprempre,et al.  The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme , 2003, Journal of Cryptology.

[38]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[39]  Torben P. Pedersen Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[40]  Dawu Gu,et al.  MixCT: Mixing Confidential Transactions from Homomorphic Commitment , 2022, IACR Cryptol. ePrint Arch..

[41]  Pedro A. Moreno-Sanchez,et al.  Generalized Channels from Limited Blockchain Scripts and Adaptor Signatures , 2021, ASIACRYPT.

[42]  Tsz Hon Yuen,et al.  One-More Unforgeability of Blind ECDSA , 2021, ESORICS.

[43]  Alex J. Malozemoff,et al.  Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions , 2021, CRYPTO.

[44]  Rafail Ostrovsky,et al.  Line-Point Zero Knowledge and Its Applications , 2020, IACR Cryptol. ePrint Arch..

[45]  Arthur Gervais,et al.  NOCUST – A Securely Scalable Commit-Chain , 2019 .

[46]  Giulio Malavolta,et al.  Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability , 2019, NDSS.

[47]  Ethan Heilman,et al.  TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment Hub , 2017, NDSS.

[48]  Fabien Laguillaumie,et al.  Linearly Homomorphic Encryption from DDH , 2015, IACR Cryptol. ePrint Arch..

[49]  Ron Wolfson Create. , 2009, The Alpha omegan.

[50]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..