Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428136
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Weakening the isolation assumption of tamper-proof hardware tokens
- Leakage resilience of the Blom's key distribution scheme
- Lightweight authenticated encryption mode suitable for threshold implementation
- \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption
- A key-recovery attack against Mitaka in the \(t\)-probing model
- WrapQ: Side-Channel Secure Key Management for Post-quantum Cryptography
- Correction to: ``Unconditionally secure computation against low-complexity leakage
- Taylor expansion of maximum likelihood attacks for masked and shuffled implementations
- Adaptive extractors and their application to leakage resilient secret sharing
- On masked Galois-field multiplication for authenticated encryption resistant to side channel analysis
- Efficiently testable circuits without conductivity
- Exploiting algebraic structures in probing security
- Quantitative fault injection analysis
- Reverse firewalls for actively secure MPCs
- Raccoon: a masking-friendly signature proven in the probing model
- On the local leakage resilience of linear secret sharing schemes
- Towards sound fresh re-keying with hard (physical) learning problems
- 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
- Secure and efficient software masking on superscalar pipelined processors
- A low-randomness second-order masked AES
- Systematic study of decryption and re-encryption leakage: the case of Kyber
- Dynamic random probing expansion with quasi linear asymptotic complexity
- Removing the field size loss from Duc et al.'s conjectured bound for masked encodings
- Differential bias attack for block cipher under randomized leakage with key enumeration
- A holistic approach towards side-channel secure fixed-weight polynomial sampling
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Automated verification of correctness for masked arithmetic programs
- An Efficient PIR Construction Using Trusted Hardware
- Using Virtual Secure Circuit to Protect Embedded Software from Side-Channel Attacks
- Non-Malleable Codes from Additive Combinatorics
- Formal verification of arithmetic masking in hardware and software
- Leakage-Resilient Coin Tossing
- Secret can be public: low-memory AEAD mode for high-order masking
- Spin me right round rotational symmetry for FPGA-specific AES: extended version
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- Generalized Feistel ciphers for efficient prime field masking
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields
- Connecting leakage-resilient secret sharing to practice: scaling trends and physical dependencies of prime field masking
- From random probing to noisy leakages without field-size dependence
- Leakage-tolerant circuits
- \textsf{Plover}: masking-friendly hash-and-sign lattice signatures
- On the bit-slice representations of some nonlinear bijective transformations
- Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256}
- Trojan-resilience without cryptography
- Secure wire shuffling in the probing model
- Resilient uniformity: applying resiliency in masking
- Custom instruction support for modular defense against side-channel and fault attacks
- QRL: a high performance quadruple-rail logic for resisting DPA on FPGA implementations
- A modular approach to the incompressibility of block-cipher-based AEADs
- Interleaved Group Products
- CAPABARA: a combined attack on CAPA
- Lightweight leakage-resilient PRNG from TBCs using superposition
- Constructing tree decompositions of graphs with bounded gonality
- Higher-order masking scheme for Trivium hardware implementation
- Security analysis of deterministic re-keying with masking and shuffling: application to ISAP
- Improving first-order threshold implementations of \textsf{SKINNY}
- Proving SIFA protection of masked redundant circuits
- Succinct Diophantine-satisfiability arguments
- Cryptanalysis of masked ciphers: a not so random idea
- Packed multiplication: how to amortize the cost of side-channel masking?
- Polynomial evaluation and side channel analysis
- Leakage-resilient cryptography over large finite fields: theory and practice
- Masking the GLP lattice-based signature scheme at any order
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Private circuits with quasilinear randomness
- 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
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)
