arXiv · 2610.39572
RV2GC: Reconstructing the Garbling Boundary in a RISC-V Garbled Processor
Abstract
Programmable garbled-circuit execution must balance the benefits of cross-program reuse against the cost of repeated work during secure execution. A complete garbled processor provides a fixed circuit for many programs, but its evaluator repeatedly visits processor-wide structures even when only a small part performs the current protected computation. We present RV2GC, which reconstructs the garbling boundary around a fixed library of RISC-V instruction circuits. Public scheduling and operand routing operate outside the circuit topologies; persistent label-encoded state connects independently invoked garbled instruction circuits and instruction-specific garbling-free paths through a common interface. A Conditional-execution Stack and protected commits support secret-dependent branches, bounded loops, and secret-indexed memory access under public scheduling, keeping instruction and memory-address sequences independent of private inputs. Across nine benchmarks, measured ARM2GC-to-RV2GC runtime ratios range from 12.81 to 4,043. In terms of circuit size, the largest listed instruction circuit has 3,386 gates, corresponding to 2.044% and 0.393% of the 256-byte and 4,096-byte Amber processors, respectively. Additional comparisons quantify schedule storage, communication, and the cost of secret-dependent execution.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zixiao Feng, Xiaolin Li, Chenglu Jin, Wei Yan, Yong Zhang, Hongwei Liu, Yong Liu, Qinfen Hao. 2026-10-29. RV2GC: Reconstructing the Garbling Boundary in a RISC-V Garbled Processor. https://arxiv.org/abs/2610.39572
Cite the original work for its findings. Save a collection to share your selection of sources.