Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems
From MaRDI portal
Publication:2829218
DOI10.1007/978-3-662-53008-5_10zbMATH Open1391.94746OpenAlexW2484680112WikidataQ58764961 ScholiaQ58764961MaRDI QIDQ2829218FDOQ2829218
Sebastian Faust, Stefan Dziembowski, Daniel Masny, Gottfried Herold, Anthony Journault, François-Xavier Standaert
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_10
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On lattices, learning with errors, random linear codes, and cryptography
- On solving LPN using BKW and variants, Implementation and analysis
- New Algorithms for Learning in Presence of Errors
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- Noise-tolerant learning, the parity problem, and the statistical query model
- On the Existence of Pseudorandom Generators
- Advances in Cryptology - CRYPTO 2003
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Power Analysis Attacks
- Towards sound approaches to counteract power-analysis attacks
- Tweakable block ciphers
- Pseudorandom Functions and Lattices
- Topics in Cryptology – CT-RSA 2005
- How to Certify the Leakage of a Chip?
- Practical Leakage-Resilient Pseudorandom Objects with Minimum Public Randomness
- On the concrete hardness of learning with errors
- Leakage Resilient ElGamal Encryption
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Pushing the Limits: A Very Compact and a Threshold Implementation of AES
- Leakage-Resilient Symmetric Encryption via Re-keying
- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
- Towards Super-Exponential Side-Channel Security with Efficient Leakage-Resilient PRFs
- Masking against Side-Channel Attacks: A Formal Security Proof
- A More Efficient AES Threshold Implementation
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Masking and leakage-resilient primitives: one, the other(s) or both?
- Learning with Rounding, Revisited
- Key Homomorphic PRFs and Their Applications
- Hardness of SIS and LWE with Small Parameters
- Making Masking Security Proofs Concrete
- Lossy Codes and a New Variant of the Learning-With-Errors Problem
- Improved side-channel analysis of finite-field multiplication
- Side-Channel Analysis of Multiplications in GF(2128)
- Higher-Order Threshold Implementations
- 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
- Generic Side-Channel Countermeasures for Reconfigurable Devices
- Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
- On the Hardness of Learning with Rounding over Small Modulus
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- A Leakage Resilient MAC
- FPGA Implementations of SPRING
Cited In (5)
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Learning with physical rounding for linear and quadratic leakage functions
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption
- Practical significance of security bounds for standardized internally re-keyed block cipher modes
This page was built for publication: Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829218)