Welcome to the resource topic for 2025/1253
Title:
BitVM with Succinct On-Chain Cost from AB-LFE, HMAC, or Privacy-Free GC
Authors: Weikeng Chen
Abstract:This paper aims to be a systematization of knowledge on how to instantiate BitVM with succinct on-chain cost from attribute-based laconic function evaluation (AB-LFE), homomorphic message authentication codes (HMAC), or privacy-free garbled circuits (GC) with suitable properties, specifically with:
-
AB-LFE with unbounded depth and with bounded depth, which implies reusable privacy-free garbled circuits
-
HMAC in with unbounded depth, which implies succinct privacy-free garbled circuits
-
privacy-free garbled circuits and their succinct garbling as in BitGC
They vary in complexity, concrete overhead, succinctness, reusability, and security mechanisms against a malicious garbler. This paper is a literature review, as instantiating BitVM with them is straightforward.
ePrint: https://eprint.iacr.org/2025/1253
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .