pllmR02: ReDASH: Fast and efficient Scaling in Arithmetic Garbled Circuits for Secure Outsourced Inference
ReDASH generalizes residue-number-system scaling and uses ScaleQuant+ to reduce encoded-inference overhead. PLLM status: reference primitive only.
Status: reference primitive only
Year: 2025
Authors: Felix Maurer, Jonas Sander, Thomas Eisenbarth
External source: ReDASH: Fast and efficient Scaling in Arithmetic Garbled Circuits for Secure Outsourced Inference
Source contribution
ReDASH generalizes residue-number-system scaling and uses ScaleQuant+ to reduce encoded-inference overhead.
PLLM perspective
Implement signed base extension, the published scaling gadget and its quantization policy as separately versioned components. Expose exact and approximate semantics explicitly.
Only researched previously; earlier CRT kernels did not implement full ReDASH scaling.
PLLM has related clean-room reference primitives only. They are not a paper reproduction, reviewed protected runtime, or complete-model result.
The source's boundary remains binding: Preserve the specified sign/scaling assumptions. Modular inversion is not ordinary fixed-point division; per-residue ReLU is not global integer ReLU.
PLLM modules and documentation
Target module identifiers: convert.rns_base_extension, gate.scale, numeric.scalequant_plus. These identifiers describe scoped work unless this page explicitly links an implementation source. Dependencies: R01, R03.
- Research backlog
- Reimplementation backlog
- Clean-room workflow
- Arithmetic garbling documentation
- Reference garbling source
Backlog
This source is assigned to reimplementation priority 3, Arithmetic garbling foundation. Its source-registry order is 2. Follow current gates and unfinished work in the research backlog.
R01: Dash: Accelerating Distributed Private Convolutional Neural Network Inference with Arithmetic Garbled Circuits
Arithmetic garbling and LabelTensors provide the foundation for offline preparation and local encoded public-weight evaluation. PLLM status: reference primitive only.
R03: Garbling Gadgets for Boolean and Arithmetic Circuits
Arithmetic garbling provides free additions and specialized gadgets, with a stated symmetric-primitive security model. PLLM status: PLLM component adaptation.