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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of cryptology Ročník 34; číslo 4
Hlavní autori:	Bogdanov, Andrej, Ishai, Yuval, Srinivasan, Akshayaram
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2021 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!