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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of cryptology Jg. 34; H. 4
Hauptverfasser:	Bogdanov, Andrej, Ishai, Yuval, Srinivasan, Akshayaram
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2021 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!