LWE-based Identification Schemes

Details LWE-based Identification Schemes LWE-based Identification Schemes

2011-09-03

arxiv.org/abs/1109.0631v2

Computer Science

Cryptography and Security

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

LWE-based Identification Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with LWE-based Identification Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LWE-based Identification Schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-148107