Paper 2023/1795

Efficiently Testable Circuits without Conductivity

Abstract

The notion of ``efficiently testable circuits'' (ETC) was recently put forward by Baig et al.~(ITCS'23). Informally, an ETC compiler takes as input any Boolean circuit $$ and outputs a circuit/inputs tuple $$ where (completeness) $$ is functionally equivalent to $$ and (security) if $$ is tampered in some restricted way, then this can be detected as $$ will err on at least one input in the small test set $$. The compiler of Baig et al. detects tampering even if the adversary can tamper with \emph{all} wires in the compiled circuit. Unfortunately, the model requires a strong ``conductivity'' restriction: the compiled circuit has gates with fan-out up to 3, but wires can only be tampered in one way even if they have fan-out greater than one. In this paper, we solve the main open question from their work and construct an ETC compiler without this conductivity restriction. While Baig et al. use gadgets computing the AND and OR of particular subsets of the wires, our compiler computes inner products with random vectors. We slightly relax their security notion and only require that tampering is detected with high probability over the choice of the randomness. Our compiler increases the size of the circuit by only a small constant factor. For a parameter $$ (think $$), the number of additional input and output wires is $$, while the number of test queries to detect an error with constant probability is around $$.