LWE-based Identification Schemes

TL;DR

This paper presents two new LWE-based zero-knowledge identification schemes, emphasizing their security, performance, and practical relevance, leveraging lattice problems for cryptographic applications.

Contribution

It introduces novel LWE-based identification schemes with detailed analysis of their security and efficiency, highlighting practical design considerations.

Findings

Schemes achieve strong security based on LWE hardness

Performance analysis shows practical efficiency

Design choices enhance real-world applicability

Abstract

Some hard problems from lattices, like LWE (Learning with Errors), are particularly suitable for application in Cryptography due to the possibility of using worst-case to average-case reductions as evidence of strong security properties. In this work, we show two LWE-based constructions of zero-knowledge identification schemes and discuss their performance and security. We also highlight the design choices that make our solution of both theoretical and practical interest.