会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Context limited shared secret
    • 上下文有限共享秘密
    • US08726019B2
    • 2014-05-13
    • US11351448
    • 2006-02-10
    • Michael PaddonGregory Gordon RoseJames SemplePhilip Michael Hawkes
    • Michael PaddonGregory Gordon RoseJames SemplePhilip Michael Hawkes
    • H04L29/06
    • H04L9/085
    • In a communication system in which two communication entities seek to have a private or confidential communication session, a trust relationship needs first be established. The trust relationship is based on the determination of a shared secret which in turn is generated from contextual information. The contextual information can be derived from the circumstances surrounding the communication session. For example, the contextual information can include topological information, time-based information, and transactional information. The shared secret may be self-generated or received from a third party. In either event, the shared secret may be used as key material for any cryptographic protocol used between the communication entities.
    • 在两个通信实体寻求私人或机密通信会话的通信系统中,首先需要建立信任关系。 信任关系是基于共享秘密的确定,而这个秘密又是从上下文信息中产生的。 上下文信息可以从通信会话周围的情况导出。 例如,上下文信息可以包括拓扑信息,基于时间的信息和事务信息。 共享密钥可以是自生产的或从第三方接收的。 在任一情况下,共享秘密可以用作在通信实体之间使用的任何加密协议的关键材料。
    • 4. 发明申请
    • LOW LATENCY BLOCK CIPHER
    • 低延迟块碳化硅
    • US20100115286A1
    • 2010-05-06
    • US12262092
    • 2008-10-30
    • Philip Michael HawkesLU XiaoGregory gordon RoseSteve Millendorf
    • Philip Michael HawkesLU XiaoGregory gordon RoseSteve Millendorf
    • G06F12/14H04L9/06
    • G06F12/1408H04L9/0618H04L2209/125H04L2209/24
    • A block cipher is provided that secures data by encrypting it based on the memory address where it is to be stored. When encrypting data for storage in the memory address, the memory address is encrypted in a first plurality of block cipher rounds. Data round keys are generated using information from the first plurality of block cipher rounds. Data to be stored is combined with the encrypted memory address and encrypted in a second plurality of block cipher rounds using the data round keys. The encrypted data is then stored in the memory location. When decrypting data, the memory address is again encrypted as before while the encrypted stored data is decrypted in a second plurality of the block cipher rounds using the data round keys to obtain a partially decrypted data. The partially decrypted data is combined with the encrypted memory address to obtain fully decrypted data.
    • 提供了一种分组密码,其通过基于要存储的存储器地址对其进行加密来保护数据。 当将存储在存储器地址中的数据进行加密时,存储器地址以第一多个块密码循环加密。 使用来自第一多个块密码轮的信息来生成数据循环密钥。 要存储的数据与加密的存储器地址组合,并使用数据循环密钥在第二多个块密码轮中进行加密。 然后将加密的数据存储在存储器位置。 当解密数据时,如先前一样再次加密存储器地址,同时使用数据循环密钥在第二多个块密码轮中对加密的存储数据进行解密以获得部分解密的数据。 部分解密的数据与加密的存储器地址组合以获得完全解密的数据。
    • 6. 发明授权
    • 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.
    • 提供了一个网络助手,帮助验证者执行一个基于拼图的协议,用于令牌的身份验证。 令牌存储密钥和一个或多个拼图生成算法。 辅助者存储与特定令牌相关联的多个谜题。 当验证者要求这样做时,帮助者为验证者提供多个伪随机选择的令牌的拼图。 使用在验证者和令牌之间使用的信息来编码谜题以建立安全的对称密钥。 验证者选择一个或几个编码的谜题,并通过暴力攻击破坏它们。 因为帮手不知道哪些谜题被选中,所以它必须打破所有的谜题,试图找出对称的关键。 然而,如果大量的谜题被利用,说数百万,那么打破所有这些都成为一个计算上令人望而却步的任务。
    • 9. 发明申请
    • 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.
    • 实施例描述了用于网络分组的有效分类的系统和/或方法。 根据一方面,一种方法包括将分组描述为特征向量并将特征向量映射到特征空间。 该方法还可以包括定义特征棱镜,对分组相对于特征棱镜进行分类,以及确定特征向量是否与特征棱镜匹配。 如果特征向量与特征棱镜匹配,则将数据包传递给数据收件人,否则,数据包被阻止。 另一个实施例是一种装置,其包括定义分组的至少一个特征的识别组件和至少部分地基于至少一个定义的特征对分组进行分类的分类组件。