会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • System and methods for protecting users from malicious content
    • 保护用户免受恶意内容的系统和方法
    • US09286449B2
    • 2016-03-15
    • US13339275
    • 2011-12-28
    • Bjorn Markus JakobssonWilliam Leddy
    • Bjorn Markus JakobssonWilliam Leddy
    • G06F21/00G06F21/31G06F21/56G06F21/83
    • H04L63/123G06F13/24G06F21/31G06F21/56G06F21/83G06F2221/2119H04L63/083H04L63/145
    • A method, system and device for allowing the secure collection of sensitive information is provided. The device includes a display, and a user interface capable of receiving at least one user-generated interrupt in response to a stimulus generated in response to content received by the device, wherein the action taken upon receiving the user-generated interrupt depends on a classification of the content, the classification identifying the content as trusted or not trusted. The method includes detecting a request for sensitive information in content, determining if an interrupt is generated, determining if the content is trusted, allowing the collection of the sensitive information if the interrupt is generated and the content is trusted, and performing an alternative action if the interrupt is generated and the content is not trusted. The method may include instructions stored on a computer readable medium.
    • 提供了一种用于允许敏感信息的安全收集的方法,系统和设备。 该设备包括显示器和用户接口,其能够响应于响应于由设备接收到的内容产生的刺激而接收至少一个用户生成的中断,其中接收到用户产生的中断时采取的动作取决于分类 的内容,将内容标识为可信任或不被信任的分类。 该方法包括检测对内容中的敏感信息的请求,确定是否产生中断,确定内容是否被信任,如果生成中断并且内容被信任,则允许收集敏感信息,并且如果 生成中断,内容不受信任。 该方法可以包括存储在计算机可读介质上的指令。
    • 7. 发明授权
    • Methods and apparatus for efficient computation of one-way chains in cryptographic applications
    • 用于密码应用中单向链的有效计算的方法和装置
    • US08990576B2
    • 2015-03-24
    • US13940670
    • 2013-07-12
    • Bjorn Markus Jakobsson
    • Bjorn Markus Jakobsson
    • H04L9/32G06F21/60
    • G06F21/602H04L9/3236H04L2209/38
    • Techniques are disclosed for efficient computation of consecutive values of one-way chains and other one-way graphs in cryptographic applications. The one-way chain or graph may be a chain of length s having positions i=1, 2, . . . s each having a corresponding value vi associated therewith, wherein the value vi is given by vi=h (vi+1), for a given hash function or other one-way function h. An initial distribution of helper values may be stored for the one-way chain of length s, e.g., at positions given by i=2j for 0≦j≦log2 s. A given one of the output values vi at a current position in the one-way chain may be computed utilizing a first helper value previously stored for another position in the one-way chain between the current position and an endpoint of the chain. After computation of the given output value, the positions of the helper values are adjusted so as to facilitate computation of subsequent output values. Advantageously, a storage-computation product associated with generation of the output values of the one-way chain has a complexity O((log s)2).
    • 公开了用于在加密应用中有效计算单向链和其他单向图的连续值的技术。 单向链或图可以是具有位置i = 1,2的长度s的链。 。 。 每个具有与其相关联的对应值vi,其中对于给定的散列函数或其他单向函数h,值vi由vi = h(vi + 1)给出。 可以为长度为s的单向链存储辅助值的初始分布,例如,对于0≦̸ j≦̸ log 2 s,在i = 2j给出的位置处。 可以使用先前存储在当前位置和链的端点之间的单向链中的另一位置的第一辅助值来计算单向链中当前位置处的输出值vi中的给定一个输出值vi。 在计算给定输出值之后,调整帮助值的位置,以便于后续输出值的计算。 有利地,与生成单向链的输出值相关联的存储计算产品具有复杂度O((log s)2)。
    • 8. 发明申请
    • METHODS AND APPARATUS FOR EFFICIENT COMPUTATION OF ONE-WAY CHAINS IN CRYPTOGRAPHIC APPLICATIONS
    • 方法和设备,有效地计算单向链条在印刷应用中的应用
    • US20130311787A1
    • 2013-11-21
    • US13940670
    • 2013-07-12
    • Bjorn Markus Jakobsson
    • Bjorn Markus Jakobsson
    • G06F21/60
    • G06F21/602H04L9/3236H04L2209/38
    • Techniques are disclosed for efficient computation of consecutive values of one-way chains and other one-way graphs in cryptographic applications. The one-way chain or graph may be a chain of length s having positions i=1, 2, . . . s each having a corresponding value vi associated therewith, wherein the value vi is given by vi=h (vi+1), for a given hash function or other one-way function h. An initial distribution of helper values may be stored for the one-way chain of length s, e.g., at positions given by i=2j for 0≦j≦log2 s. A given one of the output values vi at a current position in the one-way chain may be computed utilizing a first helper value previously stored for another position in the one-way chain between the current position and an endpoint of the chain. After computation of the given output value, the positions of the helper values are adjusted so as to facilitate computation of subsequent output values. Advantageously, a storage-computation product associated with generation of the output values of the one-way chain has a complexity O((log s)2).
    • 公开了用于在加密应用中有效计算单向链和其他单向图的连续值的技术。 单向链或图可以是具有位置i = 1,2的长度s的链。 。 。 每个具有与其相关联的对应值vi,其中对于给定的散列函数或其他单向函数h,值vi由vi = h(vi + 1)给出。 对于长度为s的单向链,可以存储辅助值的初始分布,例如,对于0 @ j @ log 2 s,在由i = 2j给出的位置处存储辅助值的初始分布。 可以使用先前存储在当前位置和链的端点之间的单向链中的另一位置的第一辅助值来计算单向链中当前位置处的输出值vi中的给定一个输出值vi。 在计算给定输出值之后,调整帮助值的位置,以便于后续输出值的计算。 有利地,与生成单向链的输出值相关联的存储计算产品具有复杂度O((log s)2)。