Secure wire shuffling in the probing model
From MaRDI portal
Publication:2128997
DOI10.1007/978-3-030-84252-9_8zbMath1486.94092OpenAlexW3192820170MaRDI QIDQ2128997
Jean-Sébastien Coron, Lorenzo Spignoli
Publication date: 22 April 2022
Full work available at URL: http://orbilu.uni.lu/handle/10993/48507
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Sorting in \(c \log n\) parallel steps
- Tight bounds on maximal and maximum matchings
- Amortizing randomness complexity in private circuits
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- Provably Secure Higher-Order Masking of AES
- Protecting AES Software Implementations on 32-Bit Processors Against Power Analysis
- Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
- Higher-Order Masking Schemes for S-Boxes
- Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note
- Very High Order Masking: Efficient Implementation and Security Evaluation
- Higher Order Masking of Look-Up Tables
- Advances in Cryptology - CRYPTO 2003
- Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
- Applied Cryptography and Network Security
- Algorithms and Data Structures
This page was built for publication: Secure wire shuffling in the probing model
