Towards a ring analogue of the leftover hash lemma
type: Item
instance of: scholarly article
title: Towards a ring analogue of the leftover hash lemma
zbMATH Open document ID: 1464.94032
author: Dana Dachman-Soled
author: Huijing Gong
author: Mukul Kulkarni
author: Aria Shahverdi
published in: Journal of Mathematical Cryptology
publication date: 2021-05-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7350879
zbMATH Keywords: lattice-based cryptography
zbMATH Keywords: leakage resilience
zbMATH Keywords: ring-LWE
zbMATH Keywords: regularity lemma
describes a project that uses: ring-LWE
MaRDI profile type: Publication
full work available at URL: jmc-2020-0076
OpenAlex ID: W3112772686
Wikidata QID: Q124811322
cites work: Simultaneous Hardcore Bits and Cryptography against Memory Attacks
cites work: Practical implementation of Ring-SIS/LWE based signature and IBE
cites work: Order-LWE and the hardness of ring-LWE with entropic secrets
cites work: Fully leakage-resilient signatures
cites work: Classical hardness of learning with errors
cites work: Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
cites work: Local non-malleable codes in the bounded retrieval model
cites work: Q3723577
cites work: Public-Key Encryption Schemes with Auxiliary Inputs
cites work: Efficient Public-Key Cryptography in the Presence of Key Leakage
cites work: On cryptography with auxiliary input
cites work: Lattices and Codes
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: On Fourier transforms of radial functions and distributions
cites work: Signature Schemes with Bounded Leakage Resilience
cites work: How to leak on key updates
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: A Toolkit for Ring-LWE Cryptography
cites work: Signatures Resilient to Continual Leakage on Memory and Computation
cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Public-Key Cryptosystems Resilient to Key Leakage
cites work: A Leakage-Resilient Mode of Operation
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: On the ring-LWE and polynomial-LWE problems
cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
cites work: Q4856171
DOI: 10.1515/JMC-2020-0076
description: scientific article; zbMATH DE number 7350879