Name
Abstract | ||
|---|---|---|
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(delta w log(S)), delta being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-90453-1_17 | THEORY OF CRYPTOGRAPHY, TCC 2021, PT II |
DocType | Volume | ISSN |
Conference | 13043 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chethan Kamath | 1 | 0 | 0.34 |
| Karen Klein | 2 | 0 | 0.34 |
| Krzysztof Pietrzak | 3 | 1513 | 72.60 |