Computer Science · 2026-10-30

RV2GC: Reconstructing the Garbling Boundary in a RISC-V Garbled Processor

arXiv:2610.39572v1 Announce Type: cross 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.

SHARE THIS ARTICLE LinkedIn X Facebook

arXiv:2610.39572v1 Announce Type: cross 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.

Source and attribution

Original source: arXiv Computer Science AR ↗

This is an attributed editorial digest. For the complete study and original reporting, follow the source link.

Reader feedback

0 likes · 0 dislikes

Sign in to like or dislike this research.

SHARE THIS ARTICLE LinkedIn X Facebook
← Back to research archive