LWE-based Identification Schemes
Cryptography and Security
2012-04-18 v2 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.1109.0631,
title = {LWE-based Identification Schemes},
author = {Rosemberg Silva and Antonio Campello and Ricardo Dahab},
journal= {arXiv preprint arXiv:1109.0631},
year = {2012}
}
Comments
5 pages. Presented at the 2012 Information Theory Workshop (ITW)