Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
From MaRDI portal
Publication:5739216
DOI10.1007/978-3-662-49896-5_21zbMath1371.94620OpenAlexW2496749353MaRDI QIDQ5739216
Sebastian Faust, Stefan Dziembowski, Marcin Andrychowicz
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_21
Related Items (13)
Towards tight random probing security ⋮ Secure wire shuffling in the probing model ⋮ Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Combined fault and leakage resilience: composability, constructions and compiler ⋮ Dynamic random probing expansion with quasi linear asymptotic complexity ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Unifying freedom and separation for tight probing-secure composition ⋮ Unifying leakage models: from probing attacks to noisy leakage ⋮ Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model ⋮ On the power of expansion: more efficient constructions in the random probing model ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Random probing security: verification, composition, expansion and new constructions
This page was built for publication: Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
