We show how to prove in honest verifier zero-knowledge the correctness of a shuffe of
homomorphic encryptions (or homomorphic commitments.) A shuffe consists in a …

Recently, several public key exchange protocols based on symbolic computation in non-
commutative (semi) groups were proposed as a more efficient alternative to well established …

We introduce the linear centralizer method, and use it to devise a provable polynomial-time
solution of the Commutator Key Exchange Problem, the computational problem on which, in …

The conjugacy search problem in a group G is the problem of recovering an x ∈ G from
given g ∈ G and h= x− 1 gx. This problem is in the core of several recently suggested public …

A simple heuristic approach to the conjugacy problem in braid groups is described. Although
it does not provide a general solution to the latter problem, it demonstrates that various …

We propose the first polynomial time algorithm for the braid Diffie-Hellman conjugacy
problem (DHCP) on which the braid key exchange scheme and the braid encryption scheme …

We propose a new digital signature scheme based on a non-commutative group where the
conjugacy search problem is hard and the conjugacy decision problem is feasible. We …

We introduce a method for obtaining provable polynomial time solutions of problems in
nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and …

In this paper we present a new key establishment protocol based on the decomposition
problem in non-commutative groups which is: given two elements $ w, w_1 $ of the platform …

The braid group with its conjugacy problem is one of the recent hot issues in cryptography.
At CT-RSA 2001, Anshel, Anshel, Fisher, and Goldfeld proposed a commutator key …