Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428136
DOI10.1007/B11817zbMATH Open1122.94378OpenAlexW2480001466MaRDI QIDQ5428136FDOQ5428136
Authors: Yuval Ishai, Amit Sahai, David Wagner 
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Recommendations
Cited In (only showing first 100 items - show all)
- A Leakage-Resilient Mode of Operation
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Threshold implementations of small S-boxes
- How Fast Can Higher-Order Masking Be in Software?
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Detecting Flawed Masking Schemes with Leakage Detection Tests
- Montgomery’s Trick and Fast Implementation of Masked AES
- Optimal Amplification of Noisy Leakages
- Correlation power analysis and higher-order masking implementation of WAGE
- Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON
- Another step towards realizing random oracles: non-malleable point obfuscation
- How to Compute in the Presence of Leakage
- Bounded Indistinguishability and the Complexity of Recovering Secrets
- Tight bounds on the randomness complexity of secure multiparty computation
- Codes for Side-Channel Attacks and Protections
- Masking Tables—An Underestimated Security Risk
- Deterministic Public-Key Encryption Under Continual Leakage
- Statistical properties of side-channel and fault injection attacks using coding theory
- Provable secure software masking in the real-world
- Strong continuous non-malleable encoding schemes with tamper-detection
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- The wonderful world of global random oracles
- Leakage-resilient cryptography from minimal assumptions
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Leakage-resilient key exchange and two-seed extractors
- Leakage resilient one-way functions: the auxiliary-input setting
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle
- Higher-Order Side Channel Security and Mask Refreshing
- Masking and leakage-resilient primitives: one, the other(s) or both?
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- Leakage-resilient signatures
- Public-key encryption schemes with auxiliary inputs
- On the connection between leakage tolerance and adaptive security
- Cryptography without (Hardly Any) Secrets ?
- 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
- The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free
- Random probing security: verification, composition, expansion and new constructions
- Towards tight random probing security
- Leakage-resilient coin tossing
- Identity-based broadcast encryption with continuous leakage resilience
- One-Time Programs
- Analyzing masked ciphers against transition and coupling effects
- Unconditionally secure computation against low-complexity leakage
- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
- Fully leakage-resilient signatures
- An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
- SILVER -- statistical independence and leakage verification
- Security Evaluation Against Side-Channel Analysis at Compilation Time
- All the AES you need on Cortex-M3 and M4
- Minimizing locality of one-way functions via semi-private randomized encodings
- A First-Order SCA Resistant AES Without Fresh Randomness
- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy
- Unknown-Input Attacks in the Parallel Setting: Improving the Security of the CHES 2012 Leakage-Resilient PRF
- Protection of Sensitive Security Parameters in Integrated Circuits
- Single-trace side-channel analysis on polynomial-based MAC schemes
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Vectorizing Higher-Order Masking
- Characterization and enumeration of complementary dual abelian codes
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- A low-cost memory remapping scheme for address bus protection
- Classical leakage resilience from fault-tolerant quantum computation
- Unifying leakage models: from probing attacks to noisy leakage
- Locally decodable and updatable non-malleable codes and their applications
- Leakage Resilience of the Blom’s Key Distribution Scheme
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256}
- Custom instruction support for modular defense against side-channel and fault attacks
- Combined fault and leakage resilience: composability, constructions and compiler
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- Leakage-Resilient Coin Tossing
- Lightweight authenticated encryption mode suitable for threshold implementation
- Higher-order masking scheme for Trivium hardware implementation
- Efficiently testable circuits without conductivity
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version
- Correction to: ``Unconditionally secure computation against low-complexity leakage
- Secure and efficient software masking on superscalar pipelined processors
- Protecting Triple-DES Against DPA
- Reducing Randomness Complexity of Mask Refreshing Algorithm
- Threshold Implementation in Software
- Secure wire shuffling in the probing model
- Resilient uniformity: applying resiliency in masking
- Efficiently masking polynomial inversion at arbitrary order
- On the bit-slice representations of some nonlinear bijective transformations
- On Masked Galois-Field Multiplication for Authenticated Encryption Resistant to Side Channel Analysis
- Compositional Synthesis of Leakage Resilient Programs
- Exploiting algebraic structures in probing security
- Quantitative fault injection analysis
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)
