Shielding circuits with groups

Eric Miles, Emanuele Viola
2013 Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13  
We show how to efficiently compile any given circuit C into a leakage-resilient circuit C such that any function on the wires of C that leaks information during a computation C(x) yields advantage in computing the product of | C| Ω(1) elements of the alternating group A u . Our construction resists NC 1 leakage assuming L = NC 1 , as was conjectured here and proven later [Miles, ITCS '14]. Also, in combination with new compression bounds for A u products obtained here, C withstands leakage from
more » ... virtually any class of functions against which average-case lower bounds are known. This includes communication protocols, and AC 0 circuits augmented with few arbitrary symmetric gates. In addition, we extend the construction to the multi-query setting by relying on a simple secure hardware component. We build on Barrington's theorem [JCSS '89] and on the previous leakage-resilient constructions by Ishai et al. [Crypto '03] and Faust et al. [Eurocrypt '10]. Our construction exploits properties of A u beyond what is sufficient for Barrington's theorem.
doi:10.1145/2488608.2488640 dblp:conf/stoc/MilesV13 fatcat:zohseoo4yzdyxgksrycfbxeca4