中文
相关论文

相关论文: Undeniable Signature Schemes Using Braid Groups

200 篇论文

Consider an element~$x$ of a Garside group which is rigid in the sense of Garside-theory. Let $SC(x)$ be the set of rigid conjugates of~$x$ -- this is a well-known characteristic subset of the conjugacy class of~$x$. We present…

We describe Artin's braid group on a (fixed) finite number of strings as a crossed module over itself. In particular, we interpret the braid relations as crossed module structure relations.

代数拓扑 · 数学 2013-03-12 Johannes Huebschmann

We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…

几何拓扑 · 数学 2007-05-23 Asma Bentalha

These are Lecture Notes of a course given by the author at the French-Spanish School "Tresses in Pau", held in Pau (France) in October 2009. It is basically an introduction to distinct approaches and techniques that can be used to show…

几何拓扑 · 数学 2010-10-05 Juan Gonzalez-Meneses

Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.

群论 · 数学 2007-05-23 Arjeh M. Cohen , David B. Wales

Construct the first provably secure linear homomorphic ring signature scheme. Ring signatures allow a signer to anonymously sign a message on behalf of a user group (ring) and are widely applied in areas such as identity protection,…

密码学与安全 · 计算机科学 2026-03-30 Heng Guo , Jia Li , Yanan Wang , Fengxia Liu , Zhiyong Zheng , Kun Tian

It is known that each of the successive quotient groups of the grope and solvable filtrations of the knot concordance group has an infinite rank subgroup. The generating knots of these subgroups are constructed using iterated doubling…

几何拓扑 · 数学 2020-11-11 Taehee Kim

The objective of this work is to survey several digital signatures proposed in the last decade using non-commutative groups and rings and propose a digital signature using non-commutative groups and analyze its security.

密码学与安全 · 计算机科学 2012-10-30 Delaram Kahrobaei , Charalambos Koupparis

We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…

几何拓扑 · 数学 2016-09-07 Roger Fenn , Michael T Greene , Dale Rolfsen , Colin Rourke , Bert Wiest

The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…

In his initial paper on braids E.Artin gave a presentation with two generators for an arbitrary braid group. We give analogues of this Artin's presentation for various generalizations of braids.

群论 · 数学 2012-02-20 Vladimir Vershinin

Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups.…

密码学与安全 · 计算机科学 2016-10-25 Jonathan Gryak , Delaram Kahrobaei

Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…

代数几何 · 数学 2019-05-10 Francesco Polizzi

We construct non-associative key establishment protocols for all left self-distributive (LD), multi-LD-, and other left distributive systems. Instantiations of these protocols using generalized shifted conjugacy in braid groups lead to…

密码学与安全 · 计算机科学 2013-10-04 Arkadius Kalka , Mina Teicher

Using totally symmetric sets, Chudnovsky, Kordek, Li, and Partin gave a superexponential lower bound on the cardinality of non-abelian finite quotients of the braid group. In this paper, we develop new techniques using multiple totally…

群论 · 数学 2021-04-07 Nancy Scherich , Yvon Verberne

Public-key cryptosystems are suggested based on invariants of groups. We give also an overview of the known cryptosystems which involve groups.

密码学与安全 · 计算机科学 2007-05-23 D. Grigoriev

This article presents the application of homomorphic authenticators, replication encodings to be precise, to multigroup fully homomorphic encryption schemes. Following the works of Gennaro and Wichs on homomorphic authenticators in…

密码学与安全 · 计算机科学 2023-03-16 Ramsès Fernàndez-València

For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of…

群论 · 数学 2007-05-23 Valerij G. Bardakov

We describe new types of normal forms for braid monoids, Artin-Tits monoids, and, more generally, for all monoids in which divisibility has some convenient lattice properties (``locally Garside monoids''). We show that, in the case of…

群论 · 数学 2008-02-11 Patrick Dehornoy

In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

群论 · 数学 2012-02-21 V. V. Vershinin