LWE-based Identification Schemes

2011/09/03 by Rosemberg Silva, Silva, Rosemberg, Antonio Campello +3
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.CR #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1109.0631

5 pages. Presented at the 2012 Information Theory Workshop (ITW)

arxiv created 2012/04/17 · arxiv updated 2012/04/18

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.

Related

• Analogy between Learning With Error Problem and Ill-Posed Inverse Problems
• The Learning with Errors Problem (Invited Survey)
• Anomaly Detection with LWE Encrypted Control
• Benchmarking Attacks on Learning with Errors
• A Decade of Lattice Cryptography