Paper 2026/2383 Original: eprint.iacr.org/2026/2383 ↗

The Post-Quantum Cost of Garbled-Circuit Bitcoin Bridges

Mukesh Tiwari
Aaron Feickert
Abstract

Recent Bitcoin bridge designs rely on verification of succinct proofs to process withdrawals. This requires off-chain garbled circuit evaluation of a succinct proof, the input labels for which must be encoded on chain in a manner compatible with malicious security. We assess the post-quantum vulnerability of these cryptographic components, and examine the costs of secure alternatives. Circuit sizes for post-quantum proving systems can be made smaller than the current pairing-based baseline, but at the cost of significantly higher proof sizes that incur greater cost and require multiple Bitcoin blocks to encode. We suggest avenues of future research to improve efficiency of proofs, circuit representations, and input encodings.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint.
History
2026-10-06: last updated
2026-10-06: published
Short URL
https://ia.cr/2026/2383
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2026/2383,
      author = {Mukesh Tiwari and Aaron Feickert},
      title = {The Post-Quantum Cost of Garbled-Circuit Bitcoin Bridges},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2383},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2383}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.