On treewidth, separators and Yao's garbling - Kamath Hosdurg, Chethan; Klein, Karen; Pietrzak, Krzysztof Z; TCC: Theory of Cryptography Conference; Teaching Old Crypto New Tricks (19th Theory of Cryptography Conference 2021, 2021)
We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.
published
yes
Keywords: conference paper