基于MSP秘密共享的（t，n）门限群签名方案

门限群签名是群签名中重要的—类，它是秘钥共享与群签名的有机结合．本文通过文献[5]中的MSP方案（Monotone Span Program），提出了一种新的门限群签名方案．在本签名方案建立后，只有达到门限的群成员的联合才能生成—个有效的群签名，并且可以方便的加入或删除成员．一旦发生争议，只有群管理员才能确定签名人的身份．该方案能够抵抗合谋攻击：即群中任意一组成员合谋都无法恢复群秘钥k．本方案的安全性基于Gap Diffie-Hellman群上的计算Diffie-Hellmanl可题难解上，因此在计算上是最安全的．     

格上基于身份的高效环签名方案及安全性分析

环签名是一种特殊的数字签名,可以广泛应用于电子选举、移动通信、移动代理、电子商务等领域.提出了一种新的基于格的环签名方案,在格上的小整数解和非齐次小整数解困难问题的假设下,方案对适应性选择消息攻击是强不可伪造的.利用的格基代理技术,可以保证新方案签名长度更短,计算效率更高.     

前向安全的指定验证人代理多重签名方案

基于有限域上离散对数难解问题和强RSA假设,提出了一个前向安全的指定验证人代理多重签名方案.在方案中,代理签名人不仅可以代表多个原始签名人生成指定验证人的代理多重签名,确保只有原始签名人指定的验证人可以验证代理多重签名的有效性;而且在该方案中,代理多重签名是前向安全的,即使代理签名人当前时段的代理多重签名密钥被泄漏,敌手也不能伪造此时段之前的代理多重签名,以前所产生的代理多重签名依然有效.     

标准模型下基于格的代理环签名方案

代理环签名是一种特殊的数字签名,可以广泛地应用于很多生活领域.但是现有的代理环签名方案的安全性大都是在随机预言模型下证明的,在实际应用中不一定安全.提出一个标准模型下基于格的代理环签名方案,同时,基于格上的难题SIS和ISIS,证明了方案能够抵抗存在性伪造攻击.     

解无约束最优化问题的块共轭方向法

在给出块共轭概念的基础上，提出了适合并行计算的向量组的块共轭化方法，进而得到解无约束最优化问题的并行块共轭方向法．有大量数值结果表明块共轭方向法具有工作量少．适用函数范围广等特点，是一种比较有效的无约束最优化方法．     

超可解群的若干充分条件

本文研究了有限群的超可解性问题，利用子群的共轭可换性概念及极小反例法，获得了一个群为超可解的若干充分条件．举例说明了主要结果中的假设条件是不可少的．     

基于证书的无双线性对的代理签名方案

基于证书的密码体制既能降低公钥的管理费用又能解决密钥托管问题,代理签名可以让一个原始签名者在自己不方便亲自签名的情况下,委托他信任的代理人代替他签名.针对目前基于证书的代理签名方案普遍基于双线性对来实现因而效率不高和其安全模型不完善的问题,给出了新的基于证书的代理签名的安全模型,并提出一个不使用双线性对的基于证书的代理签名方案.在随机预言机模型中,基于椭圆曲线离散对数问题假设,对方案进行了不可伪造性的证明.最后,对方案的效率进行了比较,结果表明方案是高效的.     

一般线性或非线性约束下的共轭投影变尺度方法

梯度投影法是一类有效的约束最优化算法，在最优化领域中占有重要的地位．但是，梯度投影法所采用的投影是正交投影，不包含目标函数和约束函数的二阶导数信息·因而；收敛速度不太令人满意．本文介绍一种共轭投影概念，利用共轭投影构造了一般线性或非线性约束下的共轭投影变尺度算法，并证明了算法在一定条件下具有全局收敛性．由于算法中的共轭投影恰当地包含了目标函数和约束函数的二阶导数信息，因而收敛速度有希望加快．数值试验的结果表明算法是有效的．     

Yetter-Drinfel'd范畴中辫化余交换余代数

本文研究与Ｈｏｐｆ代数Ｈ关联之ＹｅｔｅｒＤｒｉｎｆｅｌ’ｄ范畴ＹＨＤ中的辫化余交换余代数Ｃ，证明ＨＹＤ中左Ｃ－余模范畴ＨＹＤ是张量范畴，且ＨＹＤ中辫结构Ψ诱导ＣＨＹＤ中一辫结构当且仅当对ＣＨＤＹ中任意对象Ｎ有ΨＮ，ＣΨＣ，ＮＣΓＮ＝ＣＹＤΓＮ；由此导致新的辫化张量范畴．     

本刊外文版9卷3期文章简介

（１９９３）临界性问题眭跃飞Ａ－及时允许的新概念在Ｔｕｒｉｎｇ归约下被定义了，并给出了它的一个基本性质，利用．此基本性质，作者证明了，任意两个递归可枚举度Ａ和Ｂ形成极小对，当且仅当Ｂ不是Ａ－及时允许的．作者还证明了不存在极大极小对．ｎ维Ｍｂｉｕｓ群的表示理论方爱农该文解决了高维Ｍｂｉｕｓ群的分类，不求不动点建立共轭标准型和简明的判别法等人们一直关心而长期未解决的基本问题．假设ｇ＝是Ｃｌｉｆｆｏｒｄ矩阵，ｃ≠０．本文给出了ｎ维Ｍｏｂｉｕｓ群的完全共轭分类，证明了下列充要条件：ｇ是运动的（没有不动点…     

Towards generating secure keys for braid cryptography

Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this article, we first survey all the major attacks on the braid cryptosystem and conclude that the attacks were successful because the current ways of random key generation almost always result in weaker instances of the conjugacy problem. We then propose several alternate ways of generating hard instances of the conjugacy problem for use braid cryptography.      

On the cycling operation in braid groups

The cycling operation is a special kind of conjugation that can be applied to elements in Artin’s braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In their seminal paper on braid-cryptography, Ko, Lee et al. proposed the cycling problem as a hard problem in braid groups that could be interesting for cryptography. In this paper we give a polynomial solution to that problem, mainly by showing that cycling is surjective, and using a result by Maffre which shows that pre-images under cycling can be computed fast. This result also holds in every Artin-Tits group of spherical type, endowed with the Artin Garside structure.On the other hand, the conjugacy search problem in braid groups is usually solved by computing some finite sets called (left) ultra summit sets (left-USSs), using left normal forms of braids. But one can equally use right normal forms and compute right-USSs. Hard instances of the conjugacy search problem correspond to elements having big (left and right) USSs. One may think that even if some element has a big left-USS, it could possibly have a small right-USS. We show that this is not the case in the important particular case of rigid braids. More precisely, we show that the left-USS and the right-USS of a given rigid braid determine isomorphic graphs, with the arrows reversed, the isomorphism being defined using iterated cycling. We conjecture that the same is true for every element, not necessarily rigid, in braid groups and Artin-Tits groups of spherical type.     

THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS

Small Gaussian groups are a natural generalization of spherical Artin groups, namely groups of fractions of monoids in which the existence of least common multiples is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be of Coxeter type. We show here how to extend the Elrifai–Morton solution for the conjugacy problem in braid groups to every small Gaussian group.     

Obstructions to trivializing a knot

The recent proof by Bigelow and Krammer that the braid groups are linear opens the possibility of applications to the study of knots and links. It was proved by the first author and Menasco that any closed braid representative of the unknot can be systematically simplified to a round planar circle by a finite sequence of exchange moves and reducing moves. In this paper we establish connections between the faithfulness of the Krammer-Lawrence representation and the problem of recognizing when the conjugacy class of a closed braid admits an exchange move or a reducing move.     

A Weak Key Test for Braid Based Cryptography

This work emphasizes an important problem of braid based cryptography: the random generation of good keys. We present a deterministic, polynomial algorithm that reduces the conjugacy search problem in braid group. The algorithm is based on the decomposition of braids into products of canonical factors and gives a partial factorization of the secret: a divisor and a multiple. The tests we performed on different keys of existing protocols showed that many protocols in their current form are broken and that the efficiency of our attack depends on the random generator used to create the key. Therefore, this method gives new critera for testing weak keys. We also propose a new random generator of key which is secure against our attack and the one of Hofheinz and Steinwandt.     

Gröbner–Shirshov basis for the Braid group in the Birman–Ko–Lee generators

In this paper, we obtain Gröbner–Shirshov (non-commutative Gröbner) bases for braid groups in the Birman–Ko–Lee generators enriched by “Garside word” δ [J. Birman, K.H. Ko, S.J. Lee, A new approach to the word and conjugacy problems for the braid groups, Adv. Math. 139 (1998) 322–353]. It gives a new algorithm for getting the Birman–Ko–Lee normal forms in braid groups, and thus a new algorithm for solving the word problem in these groups.     

Conjugacy Length in Group Extensions

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behavior of conjugacy length functions under group extensions, introducing the twisted and restricted conjugacy length functions. We apply these results to show that certain abelian-by-cyclic groups have linear conjugacy length function and certain semidirect products ?^d ? ?^k have at most exponential (if k > 1) or linear (if k = 1) conjugacy length functions.     

On the unsolvability of the conjugacy problem for subgroups of the groupR 5 of pure braids

The main objective of the paper is the proof of the unsolvability of the conjugacy problem for subgroups of the pure braid groupR ₅. Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 15–22, January, 1999.     

Twisted conjugacy in braid groups

In this note we solve the twisted conjugacy problem for braid groups, i.e., we propose an algorithm which, given two braids u, υ ∈ B _n and an automorphism φ ∈ Aut(B _n ), decides whether υ = (φ(x))^?1 ux for some x ∈ B _n . As a corollary, we deduce that each group of the form B _n ? H, a semidirect product of the braid group B _n by a torsion-free hyperbolic group H, has solvable conjugacy problem.