利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

21 条记录 (耗时 0.03 秒)

    Secret-Key Exchange for Wireless and Sensor Networks
    1.
    发明申请
    Secret-Key Exchange for Wireless and Sensor Networks 有权
    无线和传感器网络的密钥交换

    公开(公告)号：US20120036362A1

    公开(公告)日：2012-02-09

    申请号：US12850948

    申请日：2010-08-05

    申请人： Dakshi Agrawal ,  Chatschik Bisdikiant ,  Cagatay Capar ,  Rosario Gennaro ,  Hugo M. Krawczyk ,  Tal Rabin ,  Murtaza Zafer

    发明人： Dakshi Agrawal ,  Chatschik Bisdikiant ,  Cagatay Capar ,  Rosario Gennaro ,  Hugo M. Krawczyk ,  Tal Rabin ,  Murtaza Zafer

    IPC分类号： H04W12/04 ,  H04W12/06 ,  H04L9/00

    CPC分类号： H04L9/0844 ,  H04L2209/805 ,  H04W12/04 ,  H04W84/18

    摘要： A mechanism is provided for establishing a shared secret-key for secure communication between nodes in a wireless network. A first node in the wireless network provides a spreading code to a second node of the wireless network. The second node provides a first input for the key establishment to the first node using communication encoded with the spreading code. Responsive to obtaining the first input from the second node, the first node provides a second input for the key establishment to the second node using communication encoded with the spreading code. Then, the first node and the second node establish the shared secret-key using the first input and the second input.

    摘要翻译： 提供了一种用于建立用于无线网络中的节点之间的安全通信的共享秘密密钥的机制。 无线网络中的第一节点向无线网络的第二节点提供扩展码。 第二节点使用通过扩展码编码的通信，向第一节点提供用于密钥建立的第一输入。 响应于从第二节点获得第一输入，第一节点使用利用扩展码编码的通信，向第二节点提供用于密钥建立的第二输入。 然后，第一节点和第二节点使用第一输入和第二输入建立共享密钥。

    Secret-key exchange for wireless and sensor networks
    2.
    发明授权
    Secret-key exchange for wireless and sensor networks 有权
    无线和传感器网络的密钥交换

    公开(公告)号：US08522029B2

    公开(公告)日：2013-08-27

    申请号：US12850948

    申请日：2010-08-05

    申请人： Dakshi Agrawal ,  Chatschik Bisdikian ,  Cagatay Capar ,  Rosario Gennaro ,  Hugo M. Krawczyk ,  Tal Rabin ,  Murtaza Zafer

    发明人： Dakshi Agrawal ,  Chatschik Bisdikian ,  Cagatay Capar ,  Rosario Gennaro ,  Hugo M. Krawczyk ,  Tal Rabin ,  Murtaza Zafer

    IPC分类号： H04L9/32

    CPC分类号： H04L9/0844 ,  H04L2209/805 ,  H04W12/04 ,  H04W84/18

    摘要： A mechanism is provided for establishing a shared secret-key for secure communication between nodes in a wireless network. A first node in the wireless network provides a spreading code to a second node of the wireless network. The second node provides a first input for the key establishment to the first node using communication encoded with the spreading code. Responsive to obtaining the first input from the second node, the first node provides a second input for the key establishment to the second node using communication encoded with the spreading code. Then, the first node and the second node establish the shared secret-key using the first input and the second input.

    摘要翻译： 提供了一种用于建立用于无线网络中的节点之间的安全通信的共享秘密密钥的机制。 无线网络中的第一节点向无线网络的第二节点提供扩展码。 第二节点使用通过扩展码编码的通信，向第一节点提供用于密钥建立的第一输入。 响应于从第二节点获得第一输入，第一节点使用利用扩展码编码的通信，向第二节点提供用于密钥建立的第二输入。 然后，第一节点和第二节点使用第一输入和第二输入建立共享密钥。

    Non-Interactive Hierarchical Identity-Based Key-Agreement
    3.
    发明申请
    Non-Interactive Hierarchical Identity-Based Key-Agreement 失效
    非交互式分层身份认证密钥协商

    公开(公告)号：US20090225986A1

    公开(公告)日：2009-09-10

    申请号：US12043755

    申请日：2008-03-06

    申请人： Rosario Gennaro ,  Shai Halevi ,  Hugo M. Krawczyk ,  Tal Rabin

    发明人： Rosario Gennaro ,  Shai Halevi ,  Hugo M. Krawczyk ,  Tal Rabin

    IPC分类号： H04L9/08

    CPC分类号： H04L9/0847 ,  H04L9/0836 ,  H04L2209/80

    摘要： A pairwise key-agreement scheme is provided for creating key agreements non-interactively between pairs of nodes disposed in a hierarchy of nodes. The scheme is non-interactive so that any two nodes can agree on a shared secret key without interaction. In addition, the scheme is identity-based so that any given node only needs to know the identity of peer nodes to compute the shared secret key. All of the nodes are arranged in a hierarchy where an intermediate node in the hierarchy can derive the secret keys for each of its children from its own secret key and the identity of the child. Accordingly, the scheme is fully resilient against compromise of any number of leaves in the hierarchy and of a threshold number of nodes in the upper levels of the hierarchy. The scheme is well-suited for environments such as mobile ad-hoc networks (MANETs), which are very dynamic, have acute bandwidth-constraints and have many nodes are vulnerable to compromise.

    摘要翻译： 提供了成对密钥协商方案，用于在节点层次结构中的成对节点之间非交互地创建密钥协议。 该方案是非交互式的，因此任何两个节点都可以在没有交互的情况下对共享秘密密钥达成一致。 此外，该方案是基于身份的，使得任何给定节点仅需要知道对等节点的身份来计算共享密钥。 所有的节点被排列在层次结构中，其中层次结构中的中间节点可以从其自己的秘密密钥和孩子的身份导出其每个子项的秘密密钥。 因此，该方案完全可抵御层次结构中任何数量的叶片和层次结构的较高层中的阈值数量的节点的折中。 该方案非常适合诸如移动自组织网络（MANET）这样非常动态的环境，具有严格的带宽限制，并且许多节点容易受到折中。

    Non-interactive hierarchical identity-based key-agreement
    4.
    发明授权
    Non-interactive hierarchical identity-based key-agreement 失效
    基于非交互式层次化身份的密钥协商

    公开(公告)号：US08422681B2

    公开(公告)日：2013-04-16

    申请号：US12043755

    申请日：2008-03-06

    申请人： Rosario Gennaro ,  Shai Halevi ,  Hugo M Krawczyk ,  Tal Rabin

    发明人： Rosario Gennaro ,  Shai Halevi ,  Hugo M Krawczyk ,  Tal Rabin

    IPC分类号： H04L29/06

    CPC分类号： H04L9/0847 ,  H04L9/0836 ,  H04L2209/80

    摘要： A pairwise key-agreement scheme is provided for creating key agreements non-interactively between pairs of nodes disposed in a hierarchy of nodes. The scheme is non-interactive so that any two nodes can agree on a shared secret key without interaction. In addition, the scheme is identity-based so that any given node only needs to know the identity of peer nodes to compute the shared secret key. All of the nodes are arranged in a hierarchy where an intermediate node in the hierarchy can derive the secret keys for each of its children from its own secret key and the identity of the child. Accordingly, the scheme is fully resilient against compromise of any number of leaves in the hierarchy and of a threshold number of nodes in the upper levels of the hierarchy. The scheme is well-suited for environments such as mobile ad-hoc networks (MANETs), which are very dynamic, have acute bandwidth-constraints and have many nodes are vulnerable to compromise.

    摘要翻译： 提供了成对密钥协商方案，用于在节点层次结构中的成对节点之间非交互地创建密钥协议。 该方案是非交互式的，因此任何两个节点都可以在没有交互的情况下对共享秘密密钥达成一致。 此外，该方案是基于身份的，使得任何给定节点仅需要知道对等节点的身份来计算共享密钥。 所有的节点被排列在层次结构中，其中层次结构中的中间节点可以从其自己的秘密密钥和孩子的身份导出其每个子项的秘密密钥。 因此，该方案完全可抵御层次结构中任何数量的叶片和层次结构的较高层中的阈值数量的节点的折中。 该方案非常适合诸如移动自组织网络（MANET）这样非常动态的环境，具有严格的带宽限制，并且许多节点容易受到折中。

    Biometric authentication system with encrypted models
    5.
    发明授权
    Biometric authentication system with encrypted models 有权
    具有加密模型的生物识别认证系统

    公开(公告)号：US06317834B1

    公开(公告)日：2001-11-13

    申请号：US09240214

    申请日：1999-01-29

    申请人： Rosario Gennaro ,  Shai Halevi ,  Stephane Maes ,  Tal Rabin ,  Jeffrey Sorensen

    发明人： Rosario Gennaro ,  Shai Halevi ,  Stephane Maes ,  Tal Rabin ,  Jeffrey Sorensen

    IPC分类号： H04L932

    CPC分类号： G06F21/32 ,  G07C9/00158 ,  H04L9/0844 ,  H04L9/0891 ,  H04L9/14 ,  H04L9/3231 ,  H04L9/3271

    摘要： A method of performing biometric authentication of a person's identity including a biometric template prior to storing it in a biometric database. The encryption algorithm encrypts the biometric template using a pass-phrase, known only to the individual, to generate the cryptographic key used to store and retrieve the biometric template. When an individual wishes to access a secured resource, he must be authenticated by providing an identifier which is used to retrieve the appropriate record. He must also provide the correct password to allow the system to decrypt the model.

    摘要翻译： 在将生物测定模板存储在生物特征数据库中之前，对包括生物特征模板的人的身份进行身份认证的方法。 加密算法使用仅针对个人知道的密码短语加密生物特征模板，以生成用于存储和检索生物特征模板的加密密钥。 当个人希望访问安全资源时，他必须通过提供用于检索适当记录的标识符进行身份验证。 他还必须提供正确的密码，让系统解密模型。

    Secure hash-and-sign signatures
    6.
    发明授权
    Secure hash-and-sign signatures 有权
    安全的哈希签名签名

    公开(公告)号：US06578144B1

    公开(公告)日：2003-06-10

    申请号：US09274525

    申请日：1999-03-23

    申请人： Rosario Gennaro ,  Shai Halevi ,  Tal Rabin

    发明人： Rosario Gennaro ,  Shai Halevi ,  Tal Rabin

    IPC分类号： H04L930

    CPC分类号： H04L9/302 ,  H04L9/3236 ,  H04L9/3249 ,  H04L2209/56

    摘要： This invention is a method and apparatus which provide a solution to the problem of constructing efficient and secure digital signature schemes. It presents a signature scheme that can be proven to be existentially unforgeable under a chosen message attack, assuming a variant of the RSA conjecture. This scheme is not based on “signature trees”, but instead it uses a “hash-and-sign” paradigm, while maintaining provable security. The security proof is based on well-defined and reasonable assumptions made on the cryptographic hash function in use. In particular, it does not model this function as a random oracle. The signature scheme which is described in this invention is efficient. Further, it is “stateless”, in the sense that the signer does not need to keep any state, other than the secret key, for the purpose of generating signatures.

    摘要翻译： 本发明是提供解决构建有效和安全的数字签名方案的问题的方法和装置。 它提出了一种签名方案，假设RSA推测的变体，可以证明在选择的消息攻击下存在不可伪造的签名方案。 该方案不是基于“签名树”，而是使用“哈希和签名”范例，同时保持可证明的安全性。 安全性证明是基于对正在使用的密码散列函数的明确且合理的假设。 特别是，它不会将这个函数建模成一个随机的oracle。 本发明描述的签名方案是有效的。 此外，它是“无国籍的”，在某种意义上，为了生成签名，签名者不需要保留除秘密密钥之外的任何状态。

    Method and apparatus for providing interoperability between key recovery and non-key recovery systems
    7.
    发明授权
    Method and apparatus for providing interoperability between key recovery and non-key recovery systems 有权

    公开(公告)号：US06535607B1

    公开(公告)日：2003-03-18

    申请号：US09184002

    申请日：1998-11-02

    申请人： Coimbatore S. Chandersekaran ,  Rosario Gennaro ,  Sarbari Gupta ,  Stephen M. Matyas, Jr. ,  David R. Safford ,  Nevenko Zunic

    发明人： Coimbatore S. Chandersekaran ,  Rosario Gennaro ,  Sarbari Gupta ,  Stephen M. Matyas, Jr. ,  David R. Safford ,  Nevenko Zunic

    IPC分类号： H04L900

    CPC分类号： H04L9/0841 ,  H04L9/0894

    摘要： A method and apparatus for ensuring that a key recovery-enabled (KR-enabled) system communicating with a non-KR-enabled system in a cryptographic communication system transmits the information necessary to permit key recovery by a key recovery entity. In a first embodiment, data is encrypted under a second key K that is generated as a one-way function of a first key K′ and a key recovery block KRB generated on the first key K′. The key recovery block KRB and the encrypted data e(K, data) are transmitted to the receiver, who cannot decrypt the data without regenerating the second key K from the first key K′ and the key recovery block KRB. In a second embodiment, data is encrypted under a second key K that is generated independently of the first key K′. A third key X, generated as a one-way function of the first key K′ and a key recovery block KRB generated on the second key K, is used to encrypt the XOR product Y of the first and second keys K′, K. The key recovery block KRB, the encrypted XOR product e(X, Y) and the encrypted data e(K, data) are transmitted to the receiver, who cannot decrypt the data without regenerating the third key X from the first key K′ and the key recovery block KRB, decrypting the XOR product Y using the regenerated third key X, and recombining the XOR product Y with the first key K″ to regenerate the second key K. In a third embodiment, an integrity value is computed on a key K and its key recovery block KRB. The integrity value and the key K are encrypted to form an encrypted portion of a key exchange block KEB, while the key recovery block KRB is put in an unencrypted portion of the key exchange block KEB, which is sent along with the encrypted data e(K, data) to the receiver. The receiver decrypts the encrypted portion, recomputes the integrity value and compares it with the received integrity value. Only if the two integrity values compare is the key K extracted and used to decrypt the data.