Dynamic random probing expansion with quasi linear asymptotic complexity
From MaRDI portal
(Redirected from Publication:6157515)
Recommendations
- Random probing security: verification, composition, expansion and new constructions
- On the power of expansion: more efficient constructions in the random probing model
- Towards tight random probing security
- Side-channel masking with pseudo-random generator
- Amortizing randomness complexity in private circuits
Cites work
- Advances in Cryptology - CRYPTO 2003
- Algebraic decomposition for probing security
- Circuit compilers with O(1/ (n)) leakage rate
- Higher-order side channel security and mask refreshing
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- scientific article; zbMATH DE number 1504808 (Why is no real title available?)
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- New instantiations of the CRYPTO 2017 masking schemes
- On the power of expansion: more efficient constructions in the random probing model
- Private circuits: a modular approach
- Private multiplication over finite fields
- Provably secure higher-order masking of AES
- Random probing security: verification, composition, expansion and new constructions
- Randomness complexity of private circuits for multiplication
- Secure computation with information leaking to an adversary
- Topics in Cryptology – CT-RSA 2006
- Towards sound approaches to counteract power-analysis attacks
- Unifying leakage models: from probing attacks to noisy leakage.
Cited in
(11)- On the power of expansion: more efficient constructions in the random probing model
- Random probing security: verification, composition, expansion and new constructions
- Towards tight random probing security
- Automata, Languages and Programming
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Exploiting algebraic structures in probing security
- From random probing to noisy leakages without field-size dependence
- Masked circuit compiler in the cardinal random probing composability framework
- Tighter security notions for a modular approach to private circuits
- New techniques for random probing security and application to Raccoon signature scheme
- PERSEUS -- Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling
This page was built for publication: Dynamic random probing expansion with quasi linear asymptotic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157515)
