Computational fuzzy extractor from LWE
From MaRDI portal
Publication:2682915
DOI10.1016/J.TCS.2022.12.031OpenAlexW4313478470MaRDI QIDQ2682915
Publication date: 1 February 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.031
Cites Work
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Learning with Rounding, Revisited
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Computational Fuzzy Extractors
- Pseudorandom Functions and Lattices
- Lattice-based FHE as secure as PKE
- Correcting errors without leaking partial information
- Entropy Analysis and New Constructions of Biometric Key Generation Systems
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Privacy Amplification by Public Discussion
- A Pseudorandom Generator from any One-way Function
- Power-Up SRAM State as an Identifying Fingerprint and Source of True Random Numbers
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Computational fuzzy extractor from LWE
