eprint.iacr.orgpaperRerandomizable Garbling for Arithmetic Circuits
Rerandomizable Garbling for Arithmetic Circuits is an IACR ePrint paper (2026/2590) by Acharya, Meyer, Orlandi and Roy. It gives the first rerandomizable garbling scheme for arithmetic circuits, built on techniques from garbling via homomorphic secret sharing. Communication is O(|C| log B), with 17 group elements per multiplication gate and free additions. Security rests on subgroup-indistinguishability assumptions such as DCR and class groups.
TL;DR Presents the first rerandomizable garbling scheme for arithmetic circuits, with 17 group elements per multiplication gate under DCR or class-group assumptions.
Organisations named here
- Anasuya Acharya
- Claudio Orlandi
- Decisional Composite Residuosity
- homomorphic secret sharing
- Lawrence Roy
- Pierre Meyer
- Yao's garbled circuits
Related in other
aseemshrey.inarticleSecurity Engineering is a Context Problem
securityweek.comarticle