Group Signature Schemes Using Braid Groups

TL;DR

This paper introduces novel group signature schemes based on the conjugacy, decomposition, and root problems in Artin's braid groups, aiming to leverage their presumed computational hardness for cryptographic security.

Contribution

It is the first to propose group signature schemes utilizing the conjugacy, decomposition, and root problems in braid groups, expanding cryptographic applications of these algebraic structures.

Findings

Schemes are based on hard problems in braid groups

First application of braid groups in group signatures

Potential for secure cryptographic protocols

Abstract

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