Secure wire shuffling in the probing model
From MaRDI portal
Publication:2128997
Recommendations
Cites work
- scientific article; zbMATH DE number 1759298 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Algorithms and Data Structures
- Amortizing randomness complexity in private circuits
- Applied Cryptography and Network Security
- Circuit compilers with \(O(1/\log (n))\) leakage rate
- Higher order masking of look-up tables
- Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
- Higher-order masking schemes for S-boxes
- Protecting AES Software Implementations on 32-Bit Processors Against Power Analysis
- Provably secure higher-order masking of AES
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- Shuffling against side-channel attacks: a comprehensive study with cautionary note
- Sorting in \(c \log n\) parallel steps
- Tight bounds on maximal and maximum matchings
- Very high order masking: efficient implementation and security evaluation
Cited in
(6)- Unifying freedom and separation for tight probing-secure composition
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
- Dummy shuffling against algebraic attacks in white-box implementations
- Wire-tap codes as side-channel countermeasure
- Security analysis of deterministic re-keying with masking and shuffling: application to ISAP
- Shuffling against side-channel attacks: a comprehensive study with cautionary note
This page was built for publication: Secure wire shuffling in the probing model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128997)
