Function Recovery Attacks in Gate-Hiding Garbled Circuits using SAT Solving

TL;DR

This paper introduces a SAT-based attack that recovers hidden gate functionalities in gate-hiding garbled circuits by exploiting topology leakage, demonstrating its effectiveness on various benchmarks within a 24-hour limit.

Contribution

It presents a novel SAT-based method for recovering gate functions from circuit topology, highlighting topology as a security-relevant leakage channel.

Findings

The attack reduces recovery time compared to baseline methods.

It can recover hidden gate functions within 24 hours on benchmark circuits.

Revealing topology significantly aids in function recovery.

Abstract

Semi-Private Function Evaluation (SPFE) enables joint computation while protecting both input data and the function itself. A practical instantiation is gate-hiding garbled circuits, which conceal gate functionalities while revealing circuit topology. Existing security definitions intentionally exclude leakage through topology, leaving its concrete impact on function privacy largely unexplored. We present a SAT-based function-recovery attack that reconstructs hidden gate operations from a circuit's public topology under two attacker knowledge models. Our approach combines topology-preserving simplification theorems with a decomposition of the recovery task into smaller SAT queries, thereby reducing the candidate gate-type assignment space and improving recovery performance. We evaluate the attack on ISCAS benchmarks, representative secure computation circuits, and fault-tolerant sensor fusion circuits under a 24-hour recovery budget. Compared to a baseline attack, the optimized version substantially reduces recovery time and, in some cases, completes recovery within the evaluation budget where the baseline does not. Our results show that revealing circuit topology can materially assist recovery of hidden gate functionality, identifying topology as a security-relevant leakage channel in gate-hiding garbled circuits.