Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428136
Recommendations
Cited in
(only showing first 100 items - show all)- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Provable secure software masking in the real-world
- How fast can higher-order masking be in software?
- Leakage-resilient coin tossing
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- A Leakage-Resilient Mode of Operation
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Towards tight random probing security
- Protection of Sensitive Security Parameters in Integrated Circuits
- Correlation power analysis and higher-order masking implementation of WAGE
- All the AES you need on Cortex-M3 and M4
- Security evaluation against side-channel analysis at compilation time
- Strong continuous non-malleable encoding schemes with tamper-detection
- Cryptography without (Hardly Any) Secrets ?
- Identity-based broadcast encryption with continuous leakage resilience
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- Threshold implementations of small S-boxes
- Vectorizing higher-order masking
- Fault template attacks on block ciphers exploiting fault propagation
- Side-channel masking with pseudo-random generator
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- Dummy shuffling against algebraic attacks in white-box implementations
- Fast verification of masking schemes in characteristic two
- Leakage resilient value comparison with application to message authentication
- On the power of expansion: more efficient constructions in the random probing model
- Masking tables -- an underestimated security risk
- The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Higher-order masking in practice: a vector implementation of masked AES for ARM NEON
- Leakage-resilient key exchange and two-seed extractors
- Detecting flawed masking schemes with leakage detection tests
- SILVER -- statistical independence and leakage verification
- Bounded indistinguishability and the complexity of recovering secrets
- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
- Single-trace side-channel analysis on polynomial-based MAC schemes
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- A first-order SCA resistant AES without fresh randomness
- Montgomery’s Trick and Fast Implementation of Masked AES
- Fully leakage-resilient signatures
- Secure hardware implementation of nonlinear functions in the presence of glitches
- An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
- A low-cost memory remapping scheme for address bus protection
- One-Time Programs
- Classical leakage resilience from fault-tolerant quantum computation
- Analyzing masked ciphers against transition and coupling effects
- Unifying leakage models: from probing attacks to noisy leakage
- Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- The wonderful world of global random oracles
- Minimizing locality of one-way functions via semi-private randomized encodings
- Optimal amplification of noisy leakages
- Leakage-resilient signatures
- Public-key encryption schemes with auxiliary inputs
- Unconditionally secure computation against low-complexity leakage
- On the connection between leakage tolerance and adaptive security
- Statistical properties of side-channel and fault injection attacks using coding theory
- Deterministic Public-Key Encryption Under Continual Leakage
- Another step towards realizing random oracles: non-malleable point obfuscation
- Leakage-resilient cryptography from minimal assumptions
- Unifying leakage classes: simulatable leakage and pseudoentropy
- How to Compute in the Presence of Leakage
- Higher-order side channel security and mask refreshing
- Characterization and enumeration of complementary dual abelian codes
- Random probing security: verification, composition, expansion and new constructions
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Codes for side-channel attacks and protections
- Unknown-input attacks in the parallel setting: improving the security of the CHES 2012 leakage-resilient PRF
- Leakage resilient one-way functions: the auxiliary-input setting
- Tight bounds on the randomness complexity of secure multiparty computation
- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- Masking and leakage-resilient primitives: one, the other(s) or both?
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Mask compression: high-order masking on memory-constrained devices
- Threshold implementations with non-uniform inputs
- The random fault model
- Locally decodable and updatable non-malleable codes and their applications
- Efficiently masking polynomial inversion at arbitrary order
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Divided we stand, united we fall: security analysis of some SCA+SIFA countermeasures against SCA-enhanced fault template attacks
- Short leakage resilient and non-malleable secret sharing schemes
- Compositional Synthesis of Leakage Resilient Programs
- CUBE cipher: a family of quasi-involutive block ciphers easy to mask
- Energy-Privacy Trade-Offs in VLSI Computations
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Secure Implementation of Lattice-Based Encryption Schemes
- Reducing randomness complexity of mask refreshing algorithm
- Protecting triple-DES against DPA. A practical application of domain-oriented masking
- Threshold implementation in software. Case study of PRESENT
- New bounds on the local leakage resilience of Shamir's secret sharing scheme
- Learning with physical rounding for linear and quadratic leakage functions
- Universal hashing based on field multiplication and (near-)MDS matrices
- Unifying freedom and separation for tight probing-secure composition
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
- Improved reductions from noisy to bounded and probing leakages via hockey-stick divergences
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
- A further study on bridge structures and constructing bijective S-boxes for low-latency masking
This page was built for publication: Advances in Cryptology - CRYPTO 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428136)
