公开(公告)号：US20120131642A1

公开(公告)日：2012-05-24

申请号：US13257947

申请日：2010-03-23

Applicant: Yijun Zheng ,  Zhaoji Lin ,  Jianyong Chen ,  Zhimeng Teng ,  Yuan Li

Inventor： Yijun Zheng ,  Zhaoji Lin ,  Jianyong Chen ,  Zhimeng Teng ,  Yuan Li

IPC: G06F21/00

CPC classification number: H04L63/105 ,  G06F21/30 ,  H04L9/32 ,  H04L63/0815 ,  H04L63/0884

Abstract: A method for establishing an identity management trust, and an IDentification Provider (IDP) and a Service Provider (SP) are provided in the present disclosure. The method comprises: after receiving an access from a user, an SP determines whether an IDP to which the user attaches is located in a trust domain of the SP (S102); if theIDP to which the user attaches is not located in the trust domain of the SP, the SP inquires of an IDP in a local trust domain about the IDP to which the user attaches (S104); if the SP receives information of the IDP to which the user attaches, wherein the information is returned by an IDP in the local trust domain, the SP adds the IDP to which the user attaches to a temporary trust list to establish a trust for the IDP to which the user attaches (S106). The present disclosure can establish a trust relationship between an SP and any IDP in case of adding or not adding extra devices, ensuring the user to obtain desired services after logging on for one time.

Abstract translation: 在本公开中提供了用于建立身份管理信任的方法，以及身份验证提供商（IDP）和服务提供商（SP）。 该方法包括：在接收到来自用户的访问之后，SP确定用户所附加的IDP是否位于SP的信任域中（S102）; 如果用户所附的IDP不在SP的信任域中，则SP在本地信任域中查询关于用户所附加的IDP的IDP（S104）; 如果SP接收到用户所附加的IDP的信息，其中信息由本地信任域中的IDP返回，则SP将用户附加到的临时信任列表的IDP添加到IDP的信任 （S106）。 本公开可以在添加或不添加额外的设备的情况下在SP和任何IDP之间建立信任关系，确保用户在登录一次之后获得所需的服务。

公开(公告)号：US07725724B2

公开(公告)日：2010-05-25

申请号：US10579801

申请日：2004-11-12

Applicant: Yong Ding ,  Jianyong Chen ,  Zhiwei Peng

Inventor： Yong Ding ,  Jianyong Chen ,  Zhiwei Peng

IPC: H04L9/32

CPC classification number: H04L9/3073 ,  H04L9/302 ,  H04L9/3249 ,  H04L2209/68

Abstract: The present invention discloses a digital signature scheme based on braid group conjugacy problem and a verifying method thereof, wherein a signatory S selects three braids xεLBm(l), x′εBn(l), aεBn(l), and considers braid pair (x′,x) as a public key of S, braid a as a private key of S; Signatory S uses hash function h for a message M needing signature to get y=h(M)εBn(l); generating a braid bεRBn−1−m(l) randomly, then signing M with a and b to obtain Sign(M)=a−1byb−1a; a signature verifying party V obtains the public key of S, calculating the message M by employing hash function h, obtaining the y=h(M); judging whether sign(M) and y, sign(M)x′ and xy are conjugate or not, if yes, sign(M) is a legal signature of message M; the present invention reduces the number of braids involved and the number for conjugacy decision without reducing security, thereby improving the operation efficiency of signature.

Abstract translation: 本发明公开了一种基于编织群共轭问题的数字签名方案及其验证方法，其中签名人S选择三个辫子x（x，y）和（b）（l） 并将辫子对（x'，x）视为S的公钥，辫子a作为S的私钥; 签名者S使用哈希函数h来获得需要签名的消息M，以获得y = h（M）＆egr; Bn（1）; 随机生成一个辫子和RBn-1-m（l），然后用a和b签名M，得到Sign（M）= a-1byb-1a; 签名验证方V获得S的公钥，通过采用哈希函数h计算消息M，获得y = h（M）; 判断符号（M）和y，符号（M）x'和xy是否是共轭的，如果是，则符号（M）是消息M的合法签名; 本发明在不降低安全性的情况下减少所涉及的辫子的数量和共同决定的数量，从而提高签名的操作效率。