中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

9 records (took 0.016 seconds)

    Cheap signatures for synchronous broadcast communication
    3.
    发明申请
    Cheap signatures for synchronous broadcast communication 有权
    同步广播通信的便宜签名

    公开(公告)号：US20050182932A1

    公开(公告)日：2005-08-18

    申请号：US10779382

    申请日：2004-02-13

    Applicant: Graham Wheeler

    Inventor： Graham Wheeler

    IPC: H04L9/00 ,  H04L9/32

    CPC classification number: H04L9/12 ,  G06F19/00 ,  H04L9/3242 ,  H04L9/3249 ,  H04L2209/38 ,  H04L2209/80

    Abstract: A method and system are configured for synchronous broadcast communications by applying signature keys using hashing functions. Each subsequent transmission in a sequence includes a signature key that can be verified by hashing to a preceding signature key from a previous portion of the sequence. The first transmission in the sequence is signed using a signature key that is known by the client device, typically verified using some other mechanism such as asymmetric key signatures. Each client device can utilize an internal counter for the current time or the block number in the transmission sequence to maintain synchronized transmissions in the even that a particular portion of the sequence is missed, and to validate signature keys. Since the signature keys can be validated when they are received but not predicted before they are received, the transmission is difficult to attack while synchronization is maintained.

    Abstract translation: 一种方法和系统被配置为通过使用散列函数应用签名密钥来进行同步广播通信。 序列中的每个后续传输包括签名密钥，其可以通过从序列的先前部分对先前的签名密钥进行散列来验证。 序列中的第一个传输使用客户端设备已知的签名密钥进行签名，通常使用诸如非对称密钥签名之类的其他机制进行验证。 每个客户端设备可以利用当前时间的内部计数器或传输序列中的块号来保持同步传输，即使该序列的特定部分被错过，并且验证签名密钥。 由于签名密钥在接收到它们之前可以被验证，而是在它们被接收之前未被预测，所以在保持同步的同时传输难以攻击。

    Peer-to peer name resolution protocol (PNRP) security infrastructure and method
    6.
    发明申请
    Peer-to peer name resolution protocol (PNRP) security infrastructure and method 有权
    对等名称解析协议（PNRP）安全基础设施和方法

    公开(公告)号：US20060161657A1

    公开(公告)日：2006-07-20

    申请号：US11375748

    申请日：2006-03-15

    Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John Miller ,  Graham Wheeler

    Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John Miller ,  Graham Wheeler

    IPC: G06F15/173

    CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

    Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

    Abstract translation: 提出了一种防止恶意节点中断对等网络的正常操作的能力的安全基础设施和方法。 本发明的方法允许节点通过使其自我验证来使用安全和不安全的身份。 在必要或机会主义的情况下，通过捎带现有消息的验证来验证身份所有权。 通过随机选择连接到哪个节点来减少初始连接到恶意节点的概率。 此外，来自恶意节点的信息被识别，并且可以通过维护关于将要响应的先前通信的信息而被忽略。 通过允许节点在其资源利用超过预定限制时忽略请求，禁止拒绝服务攻击。 恶意节点删除有效节点的能力通过要求撤销证书由要删除的节点进行签名来减少。

    Secure hierarchical namespaces in peer-to-peer networks
    7.
    发明申请
    Secure hierarchical namespaces in peer-to-peer networks 有权
    对等网络中的安全分层命名空间

    公开(公告)号：US20050039045A1

    公开(公告)日：2005-02-17

    申请号：US10623994

    申请日：2003-07-21

    Applicant: Graham Wheeler

    Inventor： Graham Wheeler

    IPC: G06F15/00 ,  G06F13/00 ,  H04L9/32 ,  H04L12/22 ,  H04L29/06 ,  H04L29/08 ,  H04L29/12 ,  G06F15/16

    CPC classification number: H04L63/062 ,  H04L29/12066 ,  H04L61/1511 ,  H04L63/0442 ,  H04L67/104 ,  H04L69/16 ,  H04L69/167 ,  H04L69/329

    Abstract: A method and data structure are provided that enables name resolution via a hierarchical or chained lookup of delegated authorities independent of requiring IP addresses of the delegated authorities. In an embodiment, the method provides for lookups by first generating cryptographic keys associated with a namespace. An authority is created using one of the cryptographic keys. Next, the method provides for enabling namespaces to refer to the authority via requesting authorities associated with the namespaces to issue a peer-to-peer type resolution so that names of the namespaces resolve to the authority. For other desired namespaces, the method provides for issuing a resolution that names the authority and names associated with the other namespaces to resolve to the other authorities. For services, the authority and a service name are published to receive and end result such as arbitrary data, an IP address, a protocol name or a port.

    Abstract translation: 提供了一种方法和数据结构，可以通过分层或链接的委派权限查找来实现名称解析，而不需要授权的当局的IP地址。 在一个实施例中，该方法通过首先生成与命名空间相关联的加密密钥来提供查找。 使用其中一个加密密钥创建一个权限。 接下来，该方法提供使命名空间能够通过与命名空间相关联的请求机构来引用权限，以发出对等类型解析，以便命名空间的名称解析为权限。 对于其他所需的命名空间，该方法提供了一个解决方案，命名与其他命名空间相关联的权限和名称以解析给其他权限。 对于服务，权限和服务名称被发布以接收和结束结果，例如任意数据，IP地址，协议名称或端口。

    USING SYNCHRONIZED EVENT TYPES FOR TESTING AN APPLICATION
    8.
    发明申请
    USING SYNCHRONIZED EVENT TYPES FOR TESTING AN APPLICATION 审中-公开
    使用同步事件类型测试应用程序

    公开(公告)号：US20110131450A1

    公开(公告)日：2011-06-02

    申请号：US12626949

    申请日：2009-11-30

    Applicant: Graham Wheeler ,  Frederic Mokren ,  Fernando Zandona ,  Danny Lange ,  Joe Futty

    Inventor： Graham Wheeler ,  Frederic Mokren ,  Fernando Zandona ,  Danny Lange ,  Joe Futty

    IPC: G06F11/07

    CPC classification number: G06F11/3688

    Abstract: Embodiments are described for using synchronized event types in testing an application configured to be executed on multiple types of networked devices. The method can include playing a macro containing recorded application events to be applied to the application for testing. The recorded application events can be stored in a macro queue during playback. Further, order independent events can be identified in the macro queue, which precede an order dependent event. This enables identified order independent events to be removed. In addition, an order dependent event in the macro queue can be removed after order independent events preceding the order dependent events are removed. Then the order dependent event from the macro queue can be played after the order dependent event has been removed from the macro queue.

    Abstract translation: 描述了在测试被配置为在多种类型的联网设备上执行的应用中使用同步事件类型的实施例。 该方法可以包括播放包含应用于测试应用的记录的应用事件的宏。 录制的应用程序事件可以在播放过程中存储在宏队列中。 此外，可以在宏队列中识别与订单相关的事件之前的与订单无关的事件。 这使得能够删除所识别的与顺序无关的事件。 此外，在排除依赖事件之后的顺序独立事件被移除之后，可以去除宏队列中的依赖顺序的事件。 然后，在从宏队列中删除依赖顺序的事件之后，可以播放来自宏队列的依赖顺序的事件。

    Peer-to-peer name resolution protocol (PNRP) security infrastructure and method
    9.
    发明申请
    Peer-to-peer name resolution protocol (PNRP) security infrastructure and method 有权
    对等名称解析协议（PNRP）安全基础设施和方法

    公开(公告)号：US20070168512A1

    公开(公告)日：2007-07-19

    申请号：US11376397

    申请日：2006-03-15

    Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John Miller ,  Graham Wheeler

    Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John Miller ,  Graham Wheeler

    IPC: G06F15/173

    CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

    Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

    Abstract translation: 提出了一种防止恶意节点中断对等网络的正常操作的能力的安全基础设施和方法。 本发明的方法允许节点通过使其自我验证来使用安全和不安全的身份。 在必要或机会主义的情况下，通过捎带现有消息的验证来验证身份所有权。 通过随机选择连接到哪个节点来减少初始连接到恶意节点的概率。 此外，来自恶意节点的信息被识别，并且可以通过维护关于将要响应的先前通信的信息而被忽略。 通过允许节点在其资源利用超过预定限制时忽略请求，禁止拒绝服务攻击。 恶意节点删除有效节点的能力通过要求撤销证书由要删除的节点进行签名来减少。

Patent Agency Ranking