Learning with physical rounding for linear and quadratic leakage functions
From MaRDI portal
Publication:6186764
DOI10.1007/978-3-031-38548-3_14MaRDI QIDQ6186764FDOQ6186764
Authors: Clément Hoffmann, Pierrick Méaux, Charles Momin, Yann Rotella, François-Xavier Standaert, Balazs Udvarhelyi 
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Recommendations
- Towards sound fresh re-keying with hard (physical) learning problems
- A new birthday-type algorithm for attacking the fresh re-keying countermeasure
- Enhancing Side-Channel Analysis of Binary-Field Multiplication with Bit Reliability
- High-resolution EM attacks against leakage-resilient PRFs explained and an improved construction
- Noisy leakage revisited
Cites Work
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- On lattices, learning with errors, random linear codes, and cryptography
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lapin: an efficient authentication protocol based on ring-LPN
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Power Analysis Attacks
- Pseudorandom functions and lattices
- Topics in Cryptology – CT-RSA 2004
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Topics in Cryptology – CT-RSA 2005
- Applied Cryptography and Network Security
- All in the XL Family: Theory and Practice
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- How fast can higher-order masking be in software?
- Pseudorandom functions in almost constant depth from low-noise LPN
- Shuffling against side-channel attacks: a comprehensive study with cautionary note
- Cryptography from learning parity with noise
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Improved side-channel analysis of finite-field multiplication
- Side-Channel Analysis of Multiplications in GF(2128)
- Fresh re-keying: security against side-channel and fault attacks for low-cost devices
- Conversion of security proofs from one leakage model to another: a new issue
- Hardware implementation and side-channel analysis of Lapin
- Lectures on finite fields
- A new birthday-type algorithm for attacking the fresh re-keying countermeasure
- Enhancing Side-Channel Analysis of Binary-Field Multiplication with Bit Reliability
- Boolean functions for cryptography and coding theory
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Security analysis of deterministic re-keying with masking and shuffling: application to ISAP
- Towards sound fresh re-keying with hard (physical) learning problems
- FPGA implementations of SPRING and their countermeasures against side-channel attacks
- \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
Cited In (2)
This page was built for publication: Learning with physical rounding for linear and quadratic leakage functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186764)
