PERSEUS -- Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling
From MaRDI portal
Cites work
- Advances in Cryptology - CRYPTO 2003
- Circuit compilers with O(1/ (n)) leakage rate
- Dynamic random probing expansion with quasi linear asymptotic complexity
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- How to securely compute with noisy leakage in quasilinear complexity
- scientific article; zbMATH DE number 1504808 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- INDIANA -- verifying (random) probing security through indistinguishability analysis
- Masked circuit compiler in the cardinal random probing composability framework
- Masking against Side-Channel Attacks: A Formal Security Proof
- New techniques for random probing security and application to Raccoon signature scheme
- On the power of expansion: more efficient constructions in the random probing model
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Private circuits: a modular approach
- Provably secure higher-order masking of AES
- Random probing security: verification, composition, expansion and new constructions
- Secure computation with information leaking to an adversary
- SILVER -- statistical independence and leakage verification
- Simple refreshing in the noisy leakage model
- Towards sound approaches to counteract power-analysis attacks
- Towards tight random probing security
- Unifying leakage models: from probing attacks to noisy leakage.
- Verified Proofs of Higher-Order Masking
This page was built for publication: PERSEUS -- Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305306)
