Scholars Central

Research articlePublished Nov 2010

A NON-REPUDIABLE BIASED BITSTRING COMMITMENT SCHEME ON A POST QUANTUM CRYPTOSYSTEM USING NON-ABELIAN GROUP

Authors: D.B.Ojha, Abhishek Dwivedi, Akhilesh Dwivedi

Journal of Global Research in Computer Sciences

Volume 1 · Issue 4 · Pages 22–25

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Commitment schemes are fundamental bricks for guaranteeing fairness in upper level cryptographic protocols. Most commitment schemes in the literature rely on hash functions, which should be strongly collision free for the scheme to be secure. We present a commitment scheme, which avoids hash functions by using a public-key cryptosystem based on braid root problem instead.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “D.B.Ojha”
  • BylineArticles whose byline prints “Abhishek Dwivedi”
  • BylineArticles whose byline prints “Akhilesh Dwivedi”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels