Towards sound fresh re-keying with hard (physical) learning problems
From MaRDI portal
(Redirected from Publication:2829218)
Recommendations
- Leakage-resilient symmetric encryption via re-keying
- A new birthday-type algorithm for attacking the fresh re-keying countermeasure
- Public-key cryptosystems resilient to key leakage
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- Practical leakage-resilient symmetric cryptography
Cites work
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1979272 (Why is no real title available?)
- A Leakage Resilient MAC
- A more efficient AES threshold implementation
- Advances in Cryptology - CRYPTO 2003
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Circuit compilers with O(1/ (n)) leakage rate
- Conversion of security proofs from one leakage model to another: a new issue
- FPGA implementations of SPRING and their countermeasures against side-channel attacks
- Fresh re-keying: security against side-channel and fault attacks for low-cost devices
- Generic Side-Channel Countermeasures for Reconfigurable Devices
- Hardness of SIS and LWE with small parameters
- Hardware implementation and side-channel analysis of Lapin
- Higher-Order Threshold Implementations
- How to certify the leakage of a chip?
- Improved side-channel analysis of finite-field multiplication
- Key homomorphic PRFs and their applications
- Lapin: an efficient authentication protocol based on ring-LPN
- Leakage resilient ElGamal encryption
- Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks
- Leakage-resilient symmetric encryption via re-keying
- Learning with rounding, revisited. New reduction, properties and applications
- Lossy codes and a new variant of the learning-with-errors problem
- Making Masking Security Proofs Concrete
- Masking against Side-Channel Attacks: A Formal Security Proof
- Masking and leakage-resilient primitives: one, the other(s) or both?
- New Algorithms for Learning in Presence of Errors
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- On solving LPN using BKW and variants, Implementation and analysis
- On the Existence of Pseudorandom Generators
- On the concrete hardness of learning with errors
- On the hardness of learning with rounding over small modulus
- Power Analysis Attacks
- Practical leakage-resilient pseudorandom objects with minimum public randomness
- Pseudorandom functions and lattices
- Pushing the limits: a very compact and a threshold implementation of AES
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Side-Channel Analysis of Multiplications in GF(2128)
- Topics in Cryptology – CT-RSA 2005
- Towards sound approaches to counteract power-analysis attacks
- Towards super-exponential side-channel security with efficient leakage-resilient PRFs
- Tweakable block ciphers
- Unifying leakage models: from probing attacks to noisy leakage.
Cited in
(7)- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Learning with physical rounding for linear and quadratic leakage functions
- IP masking with generic security guarantees under minimum assumptions, and applications
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption
- Leakage-resilient symmetric encryption via re-keying
- 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)
