Analysis of Error Terms of Signatures Based on Learning with Errors
From MaRDI portal
Publication:2988339
DOI10.1007/978-3-319-53177-9_4zbMath1381.94073OpenAlexW2587464774WikidataQ62042657 ScholiaQ62042657MaRDI QIDQ2988339
Seonggeun Kim, Dongyoung Roh, Busik Jang, Sangim Jung, Suyong Park, Jeongsu Kim, Sang Geun Hahn
Publication date: 19 May 2017
Published in: Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53177-9_4
latticedigital signatureLWEdiscrete random variablelearning with errorsdiscrete Gaussian distribution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice Signatures and Bimodal Gaussians
- Lattice Signatures without Trapdoors
- High-Speed Signatures from Standard Lattices
- BKZ 2.0: Better Lattice Security Estimates
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Analysis of Error Terms of Signatures Based on Learning with Errors