专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20100310070A1 Generation and Use of a Biometric Key 失效
标题翻译：生物识别密钥的生成和使用
公开(公告)号：US20100310070A1
公开(公告)日：2010-12-09
申请号：US12809331
申请日：2008-12-19
申请人： Julien Bringer , Hervé Chabanne , David Pointcheval , Sébastien Zimmer
发明人： Julien Bringer , Hervé Chabanne , David Pointcheval , Sébastien Zimmer
IPC分类号： H04L9/00
CPC分类号： G06K9/00885 , G06F21/32 , H04L9/0866 , H04L9/3255
摘要： In a control system comprising control device adapted for, on the one hand, receiving signal indicating a first biometric datum (W), and, on the other hand, obtaining a second biometric datum captured (w′), at the level of the control device, the first and second biometric date are compared. Next, it is decided whether the first and second biometric data correspond on the basis of the comparison. Thereafter, at least a secret cryptographic key part (H(w)) is generated by applying cryptographic function to the first biometric datum.
摘要翻译：在包括控制装置的控制系统中，所述控制装置一方面适用于指示第一生物统计数据（W）的接收信号，另一方面，获得在控制级别捕获的第二生物测定数据（w'）设备，比较第一和第二生物测定日期。接下来，基于比较来判定第一生物体数据和第二生物体数据是否对应。此后，通过对第一生物测定数据应用加密功能，生成至少一个秘密加密密钥部分（H（w））。

2. 发明授权

US08670562B2 Generation and use of a biometric key 失效
标题翻译：生物识别密钥的生成和使用
公开(公告)号：US08670562B2
公开(公告)日：2014-03-11
申请号：US12809331
申请日：2008-12-19
申请人： Julien Bringer , Hervé Chabanne , David Pointcheval , Sébastien Zimmer
发明人： Julien Bringer , Hervé Chabanne , David Pointcheval , Sébastien Zimmer
IPC分类号： G06F21/00
CPC分类号： G06K9/00885 , G06F21/32 , H04L9/0866 , H04L9/3255
摘要： In a control system comprising control device adapted for, on the one hand, receiving signal indicating a first biometric datum (W), and, on the other hand, obtaining a second biometric datum captured (w′), at the level of the control device, the first and second biometric date are compared. Next, it is decided whether the first and second biometric data correspond on the basis of the comparison. Thereafter, at least a secret cryptographic key part (H(w)) is generated by applying cryptographic function to the first biometric datum.
摘要翻译：在包括控制装置的控制系统中，所述控制装置一方面适用于指示第一生物统计数据（W）的接收信号，另一方面，获得在控制级别捕获的第二生物测定数据（w'）设备，比较第一和第二生物测定日期。接下来，基于比较来判定第一生物体数据和第二生物体数据是否对应。此后，通过对第一生物测定数据应用加密功能，生成至少一个秘密加密密钥部分（H（w））。

3. 发明申请

US20100318787A1 Method for Certifying a Public Key by an Uncertified Provider 审中-公开
标题翻译：未经认证的提供商认证公钥的方法
公开(公告)号：US20100318787A1
公开(公告)日：2010-12-16
申请号：US12224005
申请日：2006-12-27
申请人： Laurent Maupertuis , David Pointcheval , Cyrille Giquello , Bernard Starck
发明人： Laurent Maupertuis , David Pointcheval , Cyrille Giquello , Bernard Starck
IPC分类号： H04L9/32
CPC分类号： H04L9/3226 , H04L9/3263 , H04L2209/56
摘要： The invention concerns a method for guaranteeing certification of a user's public key by reducing requests to key-certifying appropriate authorities. More particularly, the invention concerns a method for managing a public key of a user capable of being implemented in an asymmetric cryptosystem. According to the invention, a certification, or validation of the correspondence between a public key and a user, is performed by a validating entity, a provider separate from the certifying authority via a validation step. The password is verifiable by the validating entity, but without the latter being aware of it.
摘要翻译：本发明涉及一种通过减少对关键证明有关当局的请求来保证用户公钥的认证的方法。更具体地，本发明涉及一种用于管理能够在不对称密码系统中实现的用户的公共密钥的方法。根据本发明，认证或公开密钥和用户之间的对应关系的验证由验证实体，通过验证步骤与认证机构分开的提供者进行。该密码可由验证实体验证，但不得知道该密码。

4. 发明申请

US20110064216A1 CRYPTOGRAPHIC MESSAGE SIGNATURE METHOD HAVING STRENGTHENED SECURITY, SIGNATURE VERIFICATION METHOD, AND CORRESPONDING DEVICES AND COMPUTER PROGRAM PRODUCTS 审中-公开
标题翻译：具有加强安全性的签名消息签名方法，签名验证方法和相应的设备和计算机程序产品
公开(公告)号：US20110064216A1
公开(公告)日：2011-03-17
申请号：US12882838
申请日：2010-09-15
申请人： David Naccache , Pavel Polechtchouk , David Pointcheval
发明人： David Naccache , Pavel Polechtchouk , David Pointcheval
IPC分类号： H04L9/30
CPC分类号： H04L9/3236 , H04L9/3013 , H04L9/3247
摘要： A cryptographic message signature method are provided, which have strengthened security. The method implements two sets of signature algorithms SA1={K1, S1, V1} and SA2={K2, S2, V2}, where Ki, Si and Vi are key generation algorithms, signature generation algorithms and signature verification algorithms, respectively. The method includes: a step of generating permanent keys using the algorithm K1, delivering a pair of private and public keys {sk1, pk1}; and, for at least one message m to be signed: a signature step including sub-steps. The sub-steps include: receipt of the message m to be signed; generation of an ephemeral key pair {sk2,pk2} using the algorithm K2; calculation, by the signature algorithm S2, of the signature s2 of the message m by the private key sk2; calculation, by the signature algorithm S1, of the signature c1 of the public key pk2 by the private key sk1; and providing the strengthened signature {s2, c1, pk2}.
摘要翻译：提供了加密消息签名方法，加强了安全性。该方法实现了两组签名算法SA1 = {K1，S1，V1}和SA2 = {K2，S2，V2}，其中Ki，Si和Vi分别是密钥生成算法，签名生成算法和签名验证算法。该方法包括：使用算法K1产生永久密钥的步骤，提供一对私钥和公钥（sk1，pk1}; 并且对于要被签名的至少一个消息m：包括子步骤的签名步骤。子步骤包括：接收要签名的消息m; 使用算法K2生成短暂密钥对{sk2，pk2}; 通过签名算法S2，通过私钥sk2计算消息m的签名s2; 通过签名算法S1，通过私钥sk1计算公开密钥pk2的签名c1; 并提供加强签名{s2，c1，pk2}。

5. 发明授权

US07340058B2 Low-overhead secure information processing for mobile gaming and other lightweight device applications 失效
标题翻译：用于移动游戏和其他轻量级设备应用的低开销安全信息处理
公开(公告)号：US07340058B2
公开(公告)日：2008-03-04
申请号：US09844121
申请日：2001-04-27
申请人： Bjorn Markus Jakobsson , David Pointcheval , Adam Lucas Young
发明人： Bjorn Markus Jakobsson , David Pointcheval , Adam Lucas Young
IPC分类号： H04K1/00 , H04L9/32 , A63F9/24
CPC分类号： G07F17/32 , A63F13/12 , A63F2300/204 , A63F2300/401 , A63F2300/406 , A63F2300/50 , A63F2300/532 , G06Q20/325 , G06Q20/3674 , H04L9/3247 , H04L2209/56 , H04L2209/805
摘要： Cryptography-based methods and apparatus for secure information processing are disclosed that are particularly efficient in terms of the computational resources required, and thus implementable in mobile telephones, personal digital assistants (PDAs) or other lightweight processing devices. A setup procedure is performed to permit interactions of a designated type, e.g., secure mobile gaming interactions, to be carried out between participants, e.g., one or more players and a casino. A given participant initiates a particular interaction with another participant by sending to that participant initiation information based at least in part on one or more results of the setup procedure. The other participant in turn sends response information back to the given participant, and the interaction then continues with one or more rounds each involving one or more decisions committed to by each participant. Transcripts of the interaction can be used to determine rights of the first and second participants in a publicly verifiable manner, with the rights being based upon particular results of the interaction. The invention may be configured to permit arbitrary disconnection of the lightweight devices, and provides the advantages of public verifiability, fairness and robustness. Although the invention is particularly well suited for use in secure mobile gaming applications, it is also applicable to other secure information processing applications, including contract signing and fair exchange of digital signatures.
摘要翻译：公开了用于安全信息处理的基于密码学的方法和装置，其在所需的计算资源方面特别有效，并且因此可在移动电话，个人数字助理（PDA）或其它轻量级处理装置中实现。执行设置过程以允许在参与者（例如，一个或多个玩家和娱乐场）之间执行指定类型（例如，安全的移动游戏交互）的交互。给定的参与者通过至少部分地基于设置过程的一个或多个结果发送给该参与者发起信息来发起与另一参与者的特定交互。另一参与者又将响应信息发回给给定的参与者，然后交互继续进行一轮或多轮，每轮涉及每个参与者承诺的一个或多个决定。交互记录可用于以公开可验证的方式确定第一和第二参与者的权利，权利基于交互的特定结果。本发明可以被配置为允许轻量化设备的任意断开，并且提供公共可验证性，公平性和鲁棒性的优点。虽然本发明特别适用于安全的移动游戏应用，但也适用于其他安全信息处理应用，包括合同签名和数字签名的公平交换。

6. 发明申请

US20050157874A1 Cryptography for secure dynamic group communications 审中-公开
标题翻译：密码学用于安全动态组通信
公开(公告)号：US20050157874A1
公开(公告)日：2005-07-21
申请号：US11001251
申请日：2004-11-30
申请人： Emmanuel Bresson , Olivier Chevassut , David Pointcheval
发明人： Emmanuel Bresson , Olivier Chevassut , David Pointcheval
IPC分类号： H04K1/00 , H04L9/00 , H04L9/08
CPC分类号： H04L9/0841
摘要： A method for generating a cryptographic key by players in a dynamic group, where: 1) a first player U1 initiates an upflow to the next player, the upflow based on a random value x1, a random value v1, and “g”, a generator of a finite cyclic group where a computational solution to a Diffie-Hellman problem is hard; 2) each player after the first Up sends an upflow Flp, comprising information based on a random value xp, a random value vp, and the previous upflow Flp−1; 3) the last player Up sends a downflow Fln to all other players in the dynamic group, where the downflow Fln comprises information based on a random value xn, a random value vn, and the previous upflow Fln−1. New players may join the dynamic group in a similar fashion. Players may be removed from the dynamic group by adjusting the downflow to the remaining players. The dynamic group may be refreshed by adjusting the downflow to establish a new cryptographic key.
摘要翻译：一种用于由动态组中的玩家产生加密密钥的方法，其中：1）第一玩家U 1向下一玩家发起向上流，基于随机值x 1的向上流＆lt; / SUB＆gt;，随机值v 1＆gt;和“g”，其中对Diffie-Hellman问题的计算解难的有限循环群的生成器; 2）每个播放器在第一U
P 之后发送包括基于随机值x∈P的信息的上升流P p， p＆lt; SUB＆gt;和先前的上升流F1-1＆lt; 3）最后一个播放器U
向动态组中的所有其他播放器发送下拉菜单，其中向下流Fl N n包括基于信息随机值x N n，随机值v N n N，以及先前的上升流F1-n-1。新玩家可以以类似的方式加入动态组。可以通过调整剩余玩家的下降流量来从动态组中移除玩家。可以通过调整下降流来建立新的加密密钥来刷新动态组。

7. 发明授权

US6125445A Public key identification process using two hash functions 失效
标题翻译：公钥识别过程使用两个哈希函数
公开(公告)号：US6125445A
公开(公告)日：2000-09-26
申请号：US76818
申请日：1998-05-13
申请人： David Arditti , Henri Gilbert , Jacques Stern , David Pointcheval
发明人： David Arditti , Henri Gilbert , Jacques Stern , David Pointcheval
IPC分类号： H04L9/32 , H04L9/00
CPC分类号： H04L9/3236 , H04L9/3218
摘要： A process for the identification of a claimant by a verifier. The process is of the public key type, where the public exponent is equal to 3. The claimant draws at random a first exponent .alpha., calculates r=g.sup..alpha. mod n and transmits R=r.sup.3. The verifier draws at random a second exponent .beta., calculates t=g.sup..beta. mod n, calculates T=t.sup.3 mod n and h=H.sub.1 (Z), where H.sub.1 is a hash function, and calculates Z=R.sup.3 mod n. The verifier transmits to the claimant the numbers T and h. The claimant calculates Y=T.sup..alpha. mod n, verifies the result H.sub.1 (Y), calculates H=H.sub.2 (Y), where H.sub.2 is another hash function, calculates z=rS mod n, and transmits z and H. The claimant also has a secret number S equal to the modulo n cubic root of a number I deduced from its identity so that the number S verifies S.sup.3 =I mod n. The verifier verifies that H received is equal to H.sub.2 (Z) and that z.sup.3 is equal to RI mod n.
摘要翻译：验证者识别索赔人的过程。该过程是公钥类型，其中公共指数等于3.索赔人随机抽取第一指数α，计算r = g alpha mod n并发送R = r3。验证者随机抽取第二指数β，计算t = g beta mod n，计算T = t3 mod n和h = H1（Z），其中H1是散列函数，并计算Z = R3 mod n。验证者向索赔人传送号码T和h。索赔人计算Y = Tαmod n，验证结果H1（Y），计算H = H2（Y），其中H2是另一个哈希函数，计算z = rS mod n，并发送z和H.索赔人也有秘密数S等于从其身份推断的数字的模n立方根，使得数S验证S3 = I mod n。验证者验证H接收等于H2（Z），并且z3等于RI mod n。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式