Unconditionally Secure Computation Against Low-Complexity Leakage

We consider the problem of constructing leakage-resilient circuit compilers that are secure against global leakage functions with bounded output length. By global, we mean that the leakage can depend on all circuit wires and output a low-complexity function (represented as a multi-output Boolean cir...

Full description

Bibliographic Details

Published in:	Journal of cryptology Vol. 34; no. 4
Main Authors:	Bogdanov, Andrej, Ishai, Yuval, Srinivasan, Akshayaram
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2021 Springer Nature B.V
Subjects:	Boolean algebra Circuit design Coding and Information Theory Combinatorics Communications Engineering Compilers Complexity Computational Mathematics and Numerical Analysis Computer Science Leakage Networks Private circuits Probability Theory and Stochastic Processes Statelessness
ISSN:	0933-2790, 1432-1378
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!