Undeniable Signature Schemes Using Braid Groups

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Artin's braid groups have been recently suggested as a new source for
public-key cryptography. In this paper we propose the first undeniable
signature schemes using the conjugacy problem and the decomposition problem in
the braid groups which are believed to be hard problems.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Undeniable Signature Schemes Using Braid Groups 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 Undeniable Signature Schemes Using Braid Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Undeniable Signature Schemes Using Braid Groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-452092

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.