Problems complete for deterministic logarithmic space
Journal of Algorithms
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Communication complexity and quasi randomness
SIAM Journal on Discrete Mathematics
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
Subquadratic Simulations of Balanced Formulae by Branching Programs
SIAM Journal on Computing
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
On the (Im)possibility of Obfuscating Programs
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates
SIAM Journal on Computing
SIAM Journal on Computing
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Protecting cryptographic keys against continual leakage
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Securing computation against continuous leakage
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Protecting circuits from leakage: the computationally-bounded and noisy cases
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Leakage-Resilient circuits without computational assumptions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
New Limits to Classical and Quantum Instance Compression
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
How to Compute in the Presence of Leakage
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We show how to efficiently compile any given circuit C into a leakage-resistant 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 Au. In combination with new compression bounds for Au products, also obtained here, C' withstands leakage from virtually any class of functions against which average-case lower bounds are known. This includes communication protocols, and AC0 circuits augmented with few arbitrary symmetric gates. If NC1 ' TC0 then then the construction resists TC0 leakage as well. We also conjecture that our construction resists NC1 leakage. 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-resistant constructions by Ishai et al. [Crypto '03] and Faust et al. [Eurocrypt '10]. Our construction exploits properties of Au beyond what is sufficient for Barrington's theorem.