Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428136
DOI10.1007/b11817zbMath1122.94378OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428136
David Wagner, Yuval Ishai, Amit Sahai
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
Related Items
Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ A further study on bridge structures and constructing bijective S-boxes for low-latency masking ⋮ A holistic approach towards side-channel secure fixed-weight polynomial sampling ⋮ Provable secure software masking in the real-world ⋮ Systematic study of decryption and re-encryption leakage: the case of Kyber ⋮ Removing the field size loss from Duc et al.'s conjectured bound for masked encodings ⋮ \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ A key-recovery attack against Mitaka in the \(t\)-probing model ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ Secret can be public: low-memory AEAD mode for high-order masking ⋮ A modular approach to the incompressibility of block-cipher-based AEADs ⋮ Higher-order masking scheme for Trivium hardware implementation ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Combined fault and leakage resilience: composability, constructions and compiler ⋮ Secure and efficient software masking on superscalar pipelined processors ⋮ Divided we stand, united we fall: security analysis of some SCA+SIFA countermeasures against SCA-enhanced fault template attacks ⋮ Dynamic random probing expansion with quasi linear asymptotic complexity ⋮ Analyzing masked ciphers against transition and coupling effects ⋮ Improving first-order threshold implementations of \textsf{SKINNY} ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Efficiently masking polynomial inversion at arbitrary order ⋮ Secure Implementation of Lattice-Based Encryption Schemes ⋮ Universal hashing based on field multiplication and (near-)MDS matrices ⋮ New bounds on the local leakage resilience of Shamir's secret sharing scheme ⋮ Learning with physical rounding for linear and quadratic leakage functions ⋮ Unifying freedom and separation for tight probing-secure composition ⋮ Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Codes for Side-Channel Attacks and Protections ⋮ Masking the GLP lattice-based signature scheme at any order ⋮ The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Differential Bias Attack for Block Cipher Under Randomized Leakage with Key Enumeration ⋮ Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version ⋮ Towards tight random probing security ⋮ Secure wire shuffling in the probing model ⋮ Adaptive extractors and their application to leakage resilient secret sharing ⋮ Resilient uniformity: applying resiliency in masking ⋮ Correlation power analysis and higher-order masking implementation of WAGE ⋮ How to Compute in the Presence of Leakage ⋮ Leakage-resilient cryptography from minimal assumptions ⋮ Leakage Resilient One-Way Functions: The Auxiliary-Input Setting ⋮ Security analysis of deterministic re-keying with masking and shuffling: application to ISAP ⋮ Proving SIFA protection of masked redundant circuits ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ The wonderful world of global random oracles ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Fully leakage-resilient signatures ⋮ Private circuits with quasilinear randomness ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Higher-Order Side Channel Security and Mask Refreshing ⋮ Masking Tables—An Underestimated Security Risk ⋮ CUBE Cipher: A Family of Quasi-Involutive Block Ciphers Easy to Mask ⋮ Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ Threshold implementations of small S-boxes ⋮ Masking and leakage-resilient primitives: one, the other(s) or both? ⋮ Spin me right round rotational symmetry for FPGA-specific AES: extended version ⋮ Taylor Expansion of Maximum Likelihood Attacks for Masked and Shuffled Implementations ⋮ Unknown-Input Attacks in the Parallel Setting: Improving the Security of the CHES 2012 Leakage-Resilient PRF ⋮ Strong continuous non-malleable encoding schemes with tamper-detection ⋮ All the AES you need on Cortex-M3 and M4 ⋮ Succinct Diophantine-satisfiability arguments ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ SILVER -- statistical independence and leakage verification ⋮ Cryptanalysis of masked ciphers: a not so random idea ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Trojan-resilience without cryptography ⋮ An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order ⋮ Unifying leakage models: from probing attacks to noisy leakage ⋮ Secure hardware implementation of nonlinear functions in the presence of glitches ⋮ Security Evaluation Against Side-Channel Analysis at Compilation Time ⋮ Reducing Randomness Complexity of Mask Refreshing Algorithm ⋮ Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison ⋮ Vectorizing Higher-Order Masking ⋮ On Masked Galois-Field Multiplication for Authenticated Encryption Resistant to Side Channel Analysis ⋮ Protecting Triple-DES Against DPA ⋮ Threshold Implementation in Software ⋮ A First-Order SCA Resistant AES Without Fresh Randomness ⋮ Interleaved Group Products ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ Compositional Synthesis of Leakage Resilient Programs ⋮ Detecting Flawed Masking Schemes with Leakage Detection Tests ⋮ Montgomery’s Trick and Fast Implementation of Masked AES ⋮ Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience ⋮ Minimizing locality of one-way functions via semi-private randomized encodings ⋮ Statistical properties of side-channel and fault injection attacks using coding theory ⋮ On the Connection between Leakage Tolerance and Adaptive Security ⋮ Leakage-resilient coin tossing ⋮ Classical leakage resilience from fault-tolerant quantum computation ⋮ Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version ⋮ Private Circuits II: Keeping Secrets in Tamperable Circuits ⋮ One-Time Programs ⋮ Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON ⋮ Leakage resilient one-way functions: the auxiliary-input setting ⋮ Characterization and enumeration of complementary dual abelian codes ⋮ Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice ⋮ Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits ⋮ Optimal Amplification of Noisy Leakages ⋮ QRL: A High Performance Quadruple-Rail Logic for Resisting DPA on FPGA Implementations ⋮ Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Cryptography without (Hardly Any) Secrets ? ⋮ A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks ⋮ A Leakage-Resilient Mode of Operation ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Fault template attacks on block ciphers exploiting fault propagation ⋮ Tornado: automatic generation of probing-secure masked bitsliced implementations ⋮ 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 ⋮ On the power of expansion: more efficient constructions in the random probing model ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages ⋮ Leakage resilient value comparison with application to message authentication ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ Leakage-Resilient Coin Tossing ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Leakage-Resilient Signatures ⋮ Public-Key Encryption Schemes with Auxiliary Inputs ⋮ Identity-based broadcast encryption with continuous leakage resilience ⋮ Random probing security: verification, composition, expansion and new constructions ⋮ Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle ⋮ Leakage-resilient key exchange and two-seed extractors ⋮ Reverse firewalls for actively secure MPCs ⋮ Single-trace side-channel analysis on polynomial-based MAC schemes ⋮ Custom instruction support for modular defense against side-channel and fault attacks ⋮ Lightweight authenticated encryption mode suitable for threshold implementation
This page was built for publication: Advances in Cryptology - CRYPTO 2003
