Towards a ring analogue of the leftover hash lemma
From MaRDI portal
Publication:2027271
DOI10.1515/jmc-2020-0076zbMath1464.94032OpenAlexW3112772686WikidataQ124811322 ScholiaQ124811322MaRDI QIDQ2027271
Dana Dachman-Soled, Huijing Gong, Aria Shahverdi, Mukul Kulkarni
Publication date: 25 May 2021
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2020-0076
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On Fourier transforms of radial functions and distributions
- Practical implementation of Ring-SIS/LWE based signature and IBE
- On the ring-LWE and polynomial-LWE problems
- Local non-malleable codes in the bounded retrieval model
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Fully leakage-resilient signatures
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Lattices and Codes
- Signatures Resilient to Continual Leakage on Memory and Computation
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Public-Key Encryption Schemes with Auxiliary Inputs
- Trapdoors for hard lattices and new cryptographic constructions
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- A Leakage-Resilient Mode of Operation
- Signature Schemes with Bounded Leakage Resilience
- A Toolkit for Ring-LWE Cryptography
- On cryptography with auxiliary input
- On Ideal Lattices and Learning with Errors over Rings
- How to leak on key updates
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
- Public-Key Cryptosystems Resilient to Key Leakage
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Towards a ring analogue of the leftover hash lemma
