Fast verification of masking schemes in characteristic two
From MaRDI portal
Publication:2056733
DOI10.1007/978-3-030-77886-6_10zbMath1479.94296OpenAlexW3166412651MaRDI QIDQ2056733
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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
- Private multiplication over finite fields
- Faster evaluation of sboxes via common shares
- 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
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- SILVER -- statistical independence and leakage verification
- Making Masking Security Proofs Concrete
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- Vectorizing Higher-Order Masking
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Very High Order Masking: Efficient Implementation and Security Evaluation
- Advances in Cryptology - CRYPTO 2003
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- How Fast Can Higher-Order Masking Be in Software?
- Randomness Complexity of Private Circuits for Multiplication
