会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • RESYNCHRONIZATION FOR PUSH MESSAGE SECURITY USING SECRET KEYS
    • 使用秘密钥匙推送消息安全的重新定义
    • US20090319792A1
    • 2009-12-24
    • US12135987
    • 2008-06-09
    • Philip Michael HawkesAndreas K. WachterMichael Paddon
    • Philip Michael HawkesAndreas K. WachterMichael Paddon
    • H04L9/32
    • H04L63/068H04L9/0894H04L9/12H04L9/3271H04L63/12H04L2209/80
    • A method for a server to initiate resynchronization with an access terminal, when synchronization has been lost, that cannot be exploited by attackers is provided. The server may provide the access terminal with a secret key that is only known to the access terminal and the server. The access terminal may store the secret key in a secure storage device to prevent the secret key from being hacked. If the server determines that synchronization has been lost, the server may send a resynchronization message to the access terminal with the secret key attached. The access terminal retrieves the stored secret key from the secure memory device and compares it to the secret key attached to the resynchronization message. If there is a match, the access terminal may initiate a secure communication link with the server to reestablish synchronization.
    • 提供了一种用于当同步已经丢失时服务器发起与接入终端的重新同步的方法,其不能被攻击者利用。 服务器可以向接入终端提供只有接入终端和服务器已知的秘密密钥。 接入终端可以将秘密密钥存储在安全存储设备中,以防止秘密密钥被黑客入侵。 如果服务器确定同步已经丢失,则服务器可能会在附加密钥的情况下向接入终端发送重新同步消息。 接入终端从安全存储设备检索存储的秘密密钥,并将其与附加到重新同步消息的秘密密钥进行比较。 如果存在匹配,则接入终端可以发起与服务器的安全通信链路以重新建立同步。
    • 2. 发明授权
    • Resynchronization for push message security using secret keys
    • 使用秘密密钥重新同步推送消息安全
    • US08625793B2
    • 2014-01-07
    • US12135987
    • 2008-06-09
    • Philip Michael HawkesAndreas K. WachterMichael Paddon
    • Philip Michael HawkesAndreas K. WachterMichael Paddon
    • H04K1/00H04L9/32
    • H04L63/068H04L9/0894H04L9/12H04L9/3271H04L63/12H04L2209/80
    • A method for a server to initiate resynchronization with an access terminal, when synchronization has been lost, that cannot be exploited by attackers is provided. The server may provide the access terminal with a secret key that is only known to the access terminal and the server. The access terminal may store the secret key in a secure storage device to prevent the secret key from being hacked. If the server determines that synchronization has been lost, the server may send a resynchronization message to the access terminal with the secret key attached. The access terminal retrieves the stored secret key from the secure memory device and compares it to the secret key attached to the resynchronization message. If there is a match, the access terminal may initiate a secure communication link with the server to reestablish synchronization.
    • 提供了一种用于当同步已经丢失时服务器发起与接入终端的重新同步的方法,其不能被攻击者利用。 服务器可以向接入终端提供只有接入终端和服务器已知的秘密密钥。 接入终端可以将秘密密钥存储在安全存储设备中,以防止秘密密钥被黑客入侵。 如果服务器确定同步已经丢失,则服务器可能会在附加密钥的情况下向接入终端发送重新同步消息。 接入终端从安全存储设备检索存储的秘密密钥,并将其与附加到重新同步消息的秘密密钥进行比较。 如果存在匹配,则接入终端可以发起与服务器的安全通信链路以重新建立同步。
    • 5. 发明授权
    • Puzzle-based authentication between a token and verifiers
    • 令牌和验证者之间的基于拼图的身份验证
    • US08793497B2
    • 2014-07-29
    • US12118593
    • 2008-05-09
    • Gregory Gordon RoseAlexander GantmanMiriam Wiggers De VriesMichael PaddonPhilip Michael Hawkes
    • Gregory Gordon RoseAlexander GantmanMiriam Wiggers De VriesMichael PaddonPhilip Michael Hawkes
    • G06F21/00
    • H04L63/0435H04L63/06H04L63/0853
    • A puzzle-based protocol is provided that allows a token and verifier to agree on a secure symmetric key for authentication between the token and verifier. A token stores a secret key and one or more puzzle-generating algorithms. The verifier independently obtains a plurality of puzzles associated with the token, pseudorandomly selects at least one of the puzzles, and solves it to obtain a puzzle secret and a puzzle identifier. The verifier generates a verifier key based on the puzzle secret. The verifier sends the puzzle identifier and an encoded version of the verifier key to the token. The token regenerates the puzzle secret using its puzzle-generating algorithms and the puzzle identifier. The token sends an encoded response to the verifier indicating that it knows the verifier key. The token and verifier may use the verifier key as a symmetric key for subsequent authentications.
    • 提供了一个基于拼图的协议,允许令牌和验证者在安全对称密钥之间达成令牌和验证者之间的认证。 令牌存储密钥和一个或多个拼图生成算法。 验证者独立地获得与令牌相关联的多个谜题,伪随机地选择至少一个谜题,并解决它以获得拼图秘密和谜题标识符。 验证者基于拼图秘密生成验证码。 验证者将拼图标识符和验证者密钥的编码版本发送到令牌。 令牌使用其拼图生成算法和拼图标识符重新生成拼图秘密。 令牌向验证者发送编码的响应,指示它知道验证者密钥。 令牌和验证者可以使用验证者密钥作为后续认证的对称密钥。
    • 8. 发明授权
    • Network helper for authentication between a token and verifiers
    • 网络助手用于令牌和验证者之间的身份验证
    • US08595501B2
    • 2013-11-26
    • US12118580
    • 2008-05-09
    • Gregory Gordon RoseAlexander GantmanMiriam Wiggers De VriesMichael PaddonPhilip Michael Hawkes
    • Gregory Gordon RoseAlexander GantmanMiriam Wiggers De VriesMichael PaddonPhilip Michael Hawkes
    • H04L29/06
    • H04L63/0435H04L63/06H04L63/0853
    • A network helper is provided that assists verifiers in executing a puzzle-based protocol for authentication of a token. A token stores a secret key and one or more puzzle-generating algorithms. The helper stores a plurality of puzzles associated with a particular token. When requested to do so by a verifier, the helper provides a plurality of pseudorandomly selected puzzles for the token to a verifier. The puzzles are encoded with information that is used between the verifier and token to establish a secured symmetric key. The verifier selects one or a few of the encoded puzzles and breaks them by a brute force attack. Because the helper does not know which puzzles have been selected, it has to break all puzzles to attempt to figure out the symmetric key. However, if a large number of puzzles are utilized, say millions, then breaking all of them becomes a computationally prohibitive task.
    • 提供了一个网络助手,帮助验证者执行一个基于拼图的协议,用于令牌的身份验证。 令牌存储密钥和一个或多个拼图生成算法。 辅助者存储与特定令牌相关联的多个谜题。 当验证者要求这样做时,帮助者为验证者提供多个伪随机选择的令牌的拼图。 使用在验证者和令牌之间使用的信息来编码谜题以建立安全的对称密钥。 验证者选择一个或几个编码的谜题,并通过暴力攻击破坏它们。 因为帮手不知道哪些谜题被选中,所以它必须打破所有的谜题,试图找出对称的关键。 然而,如果大量的谜题被利用,说数百万,那么打破所有这些都成为一个计算上令人望而却步的任务。
    • 10. 发明申请
    • EFFICIENT CLASSIFICATION OF NETWORK PACKETS
    • 网络分组的高效分类
    • US20120042374A1
    • 2012-02-16
    • US13245680
    • 2011-09-26
    • Michael PADDONGregory Gordon RosePhilip Michael Hawkes
    • Michael PADDONGregory Gordon RosePhilip Michael Hawkes
    • H04L12/56G06F17/00
    • H04L63/0227H04L63/0263H04L63/102
    • Embodiments describe a system and/or method for efficient classification of network packets. According to an aspect a method includes describing a packet as a feature vector and mapping the feature vector to a feature space. The method can further include defining a feature prism, classifying the packet relative to the feature prism, and determining if the feature vector matches the feature prism. If the feature vector matches the feature prism the packet is passed to a data recipient, if not, the packet is blocked. Another embodiment is an apparatus that includes an identification component that defines at least one feature of a packet and a classification component that classifies the packet based at least in part upon the at least one defined feature.
    • 实施例描述了用于网络分组的有效分类的系统和/或方法。 根据一方面,一种方法包括将分组描述为特征向量并将特征向量映射到特征空间。 该方法还可以包括定义特征棱镜,对分组相对于特征棱镜进行分类,以及确定特征向量是否与特征棱镜匹配。 如果特征向量与特征棱镜匹配,则将数据包传递给数据收件人,否则,数据包被阻止。 另一个实施例是一种装置,其包括定义分组的至少一个特征的识别组件和至少部分地基于至少一个定义的特征对分组进行分类的分类组件。