Fast verification of masking schemes in characteristic two
From MaRDI portal
Publication:2056733
DOI10.1007/978-3-030-77886-6_10zbMATH Open1479.94296OpenAlexW3166412651MaRDI QIDQ2056733FDOQ2056733
Authors: Nicolas Bordes, Pierre Karpman 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_10
Recommendations
- Verified Proofs of Higher-Order Masking
- A fast algorithm for the Boolean masking problem
- Reducing the number of non-linear multiplications in masking schemes
- Efficient and provably secure methods for switching from arithmetic to Boolean masking
- Very high order masking: efficient implementation and security evaluation
- Masking proofs are tight and how to exploit it in security evaluations
- A New Class of Codes for Boolean Masking of Cryptographic Computations
- New instantiations of the CRYPTO 2017 masking schemes
- Fast transforms over finite fields of characteristic two
- Masking against Side-Channel Attacks: A Formal Security Proof
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Title not available (Why is that?)
- Randomness complexity of private circuits for multiplication
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Advances in cryptology -- EUROCRYPT 2017. 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30 -- May 4, 2017. Proceedings. Part I
- Faster evaluation of sboxes via common shares
- Very high order masking: efficient implementation and security evaluation
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- How fast can higher-order masking be in software?
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Advances in cryptology -- ASIACRYPT 2018. 24th international conference on the theory and application of cryptology and information security, Brisbane, QLD, Australia, December 2--6, 2018. Proceedings. Part I
- Formal verification of masked hardware implementations in the presence of glitches
- Making Masking Security Proofs Concrete
- Private multiplication over finite fields
- New instantiations of the CRYPTO 2017 masking schemes
- Tight private circuits: achieving probing security with the least refreshing
- Constructive side-channel analysis and secure design. 9th international workshop, COSADE 2018, Singapore, April 23--24, 2018. Proceedings
- SILVER -- statistical independence and leakage verification
- Vectorizing higher-order masking
Cited In (7)
- Algebraic decomposition for probing security
- Unifying freedom and separation for tight probing-secure composition
- Verified Proofs of Higher-Order Masking
- SILVER -- statistical independence and leakage verification
- Automated verification of correctness for masked arithmetic programs
- New instantiations of the CRYPTO 2017 masking schemes
- Tight private circuits: achieving probing security with the least refreshing
Uses Software
This page was built for publication: Fast verification of masking schemes in characteristic two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056733)
