Related papers: Undeniable Signature Schemes Using Braid Groups
In this paper we provide an alternative solution to a result by Juh\'{a}sz that the twisted conjugacy problem for odd dihedral Artin groups is solvable, that is, groups with presentation $G(m) = \langle a,b \; | \; _{m}(a,b) = {}_{m}(b,a)…
Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…
An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of…
We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…
The Coxeter groups that act geometrically on euclidean space have long been classified and presentations for the irreducible ones are encoded in the well-known extended Dynkin diagrams. The corresponding Artin groups are called euclidean…
This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of…
Motivated by the work in [15], this paper deals with the theory of the braids from chromatic configuration spaces. This kind of braids possess the property that some strings of each braid may intersect together and can also be untangled, so…
A group is called decomposable if it can be expressed as a direct product of two proper subgroups, and indecomposable otherwise. This paper explores the decomposability of virtual Artin groups, which were introduced by Bellingeri, Paris,…
We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…
The aim of the present note is to construct invariants of the Artin braid group valued in $G_{N}^{2}$, and further study of groups related to $G_{n}^{3}$. In the groups $G_{n}^{2}$, the word problem is solved; these groups are much simpler…
A first multi-proxy multi-signcryption scheme from pairings, which efficiently combines a multi-proxy multi-signature scheme with a signcryption, is proposed. Its security is analyzed in detail. In our scheme, a proxy signcrypter group…
We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter would follow from solving the conjugacy search problem in the platform (noncommutative)…
With privacy-preserving and traceability properties, group signature is a cryptosystem with central role in cryptography. And there are lots of application scenarios. A new extension concept of group signature is presented, namely group…
An obfuscator is an algorithm that translates circuits into functionally-equivalent similarly-sized circuits that are hard to understand. Efficient obfuscators would have many applications in cryptography. Until recently, theoretical…
In the present paper, we introduce $\mathbb{Z}_2$-braids and, more generally, $G$-braids for an arbitrary group $G$. They form a natural group-theoretic counterpart of $G$-knots, see \cite{reidmoves}. The underlying idea, used in the…
We provide new group presentations for surface braid groups which are positive. We study some properties of such presentations and we solve the conjugacy problem in a particular case.
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are easily established. Authentication and signature…
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…