Zero-knowledge authentication schemes from actions on graphs, groups, or rings

Details Zero-knowledge authentication schemes from actions on graphs, groups, or rings Zero-knowledge authentication schemes from actions on graphs, groups, or rings

2008-02-12

arxiv.org/abs/0802.1661v1

Computer Science

Cryptography and Security

Scientific paper

We propose a general way of constructing zero-knowledge authentication schemes from actions of a semigroup on a set, without exploiting any specific algebraic properties of the set acted upon. Then we give several concrete realizations of this general idea, and in particular, we describe several zero-knowledge authentication schemes where forgery (a.k.a. impersonation) is NP-hard. Computationally hard problems that can be employed in these realizations include (Sub)graph Isomorphism, Graph Colorability, Diophantine Problem, and many others.

Affiliated with

Also associated with

No associations

Rating

Zero-knowledge authentication schemes from actions on graphs, groups, or rings 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 Zero-knowledge authentication schemes from actions on graphs, groups, or rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zero-knowledge authentication schemes from actions on graphs, groups, or rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108607