会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 22. 发明授权
    • Interface for a security coprocessor
    • 用于安全协处理器的接口
    • US06789147B1
    • 2004-09-07
    • US10025512
    • 2001-12-19
    • Richard E. KesslerDavid A. CarlsonMuhammad Raghib HussainRobert A. SanzoneKhaja E. AhmedMichael D. Varga
    • Richard E. KesslerDavid A. CarlsonMuhammad Raghib HussainRobert A. SanzoneKhaja E. AhmedMichael D. Varga
    • G06F900
    • H04L63/166G06F21/602
    • A method and apparatus for processing security operations are described. In one embodiment, a processor includes a number of execution units to process a number of requests for security operations. The number of execution units are to output the results of the number of requests to a number of output data structures associated with the number of requests within a remote memory based on pointers stored in the number of requests. The number of execution units can output the results in an order that is different from the order of the requests in a request queue. The processor also includes a request unit coupled to the number of execution units. The request unit is to retrieve a portion of the number of requests from the request queue within the remote memory and associated input data structures for the portion of the number of requests from the remote memory. Additionally, the request unit is to distribute the retrieved requests to the number of execution units based on availability for processing by the number of execution units.
    • 描述用于处理安全操作的方法和装置。 在一个实施例中,处理器包括多个执行单元,用于处理多个安全操作请求。 执行单元的数量是基于存储在请求数中的指针,将与多个与远程存储器内的请求数相关联的输出数据结构的请求数的结果输出。 执行单元的数量可以按照与请求队列中的请求顺序不同的顺序输出结果。 处理器还包括耦合到执行单元数量的请求单元。 请求单元从远程存储器中的请求队列中检索一部分请求数,并且从远程存储器中获取部分请求的相关联的输入数据结构。 此外,请求单元是基于执行单元的数量的处理的可用性将检索到的请求分发到执行单元的数量。
    • 23. 发明授权
    • Content identification for peer-to-peer content retrieval
    • 内容识别用于对等内容检索
    • US08112477B2
    • 2012-02-07
    • US13207925
    • 2011-08-11
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • G06F15/16
    • H04L9/3236H04L2209/30H04L2209/60
    • Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value.
    • 描述了一种技术,其中客户端内容通过广域网(WAN)向服务器请求的哈希信息被响​​应,客户端可以通过该信息来定位经由局域网耦合到客户端的一个或多个对等端点中的内容( LAN)。 哈希信息可以是标识多个内容块的段哈希形式,由此服务器可以引用具有单个散列值的多个内容块。 通过根据标准来确定它们,通过将流内容分成段,和/或通过基于内容数据(例如,经由RDC或内容/应用程序类型)处理内容来确定分割点,来分段边界可以是自适应的。 还描述了使用散列信息的内容验证,包括通过生成和行走Merkle树来确定较高级别的段哈希,以便匹配服务器提供的哈希值。
    • 24. 发明申请
    • Content Identification for Peer-to-Peer Content Retrieval
    • 内容识别用于对等内容检索
    • US20090327505A1
    • 2009-12-31
    • US12163024
    • 2008-06-27
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • Ravi T. RaoKhaja E. AhmedR. Scott BriggsScott A. Plant
    • G06F15/16
    • H04L9/3236H04L2209/30H04L2209/60
    • Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value.
    • 描述了一种技术,其中客户端内容通过广域网(WAN)向服务器请求的哈希信息被响​​应,客户端可以通过该信息来定位经由局域网耦合到客户端的一个或多个对等端点中的内容( LAN)。 哈希信息可以是标识多个内容块的段哈希形式,由此服务器可以引用具有单个散列值的多个内容块。 通过根据标准来确定它们,通过将流内容分成段,和/或通过基于内容数据(例如,经由RDC或内容/应用程序类型)处理内容来确定分割点,来分段边界可以是自适应的。 还描述了使用散列信息的内容验证,包括通过生成和行走Merkle树来确定较高级别的段哈希,以便匹配服务器提供的哈希值。
    • 25. 发明授权
    • Secure peer-to-peer cache sharing
    • 安全的对等缓存共享
    • US07617322B2
    • 2009-11-10
    • US11540435
    • 2006-09-29
    • Khaja E. AhmedDaniel R. Simon
    • Khaja E. AhmedDaniel R. Simon
    • G06F15/173
    • H04L67/104H04L63/126H04L67/1068H04L67/1091H04L67/28H04L67/2842
    • A system, apparatus, method, and computer-readable medium are provided for secure P2P caching. In one method, a requesting peer obtains a hash of requested data from a server. The requesting peer then transmits a request for the data to other peers. The request proves that the requesting peer has the hash. If a caching peer has the data, it generates a reply to the request that proves that it has the requested data. If the requesting peer receives a reply from a caching peer, the requesting peer establishes a connection to the caching peer and retrieves the data from the caching peer. If the requesting peer does not receive a reply to the request from any other peer, the requesting peer establishes a connection to the server and retrieves the data from the server. The requesting peer stores the data for use in responding to requests from other peers.
    • 提供了用于安全P2P缓存的系统,装置,方法和计算机可读介质。 在一种方法中,请求对等体从服务器获取所请求数据的散列。 请求对等体然后向其他对等体发送数据请求。 该请求证明请求对等体具有散列。 如果缓存对等体具有数据,则它生成对请求的答复,证明其具有所请求的数据。 如果请求对等体从缓存对等体接收到回复,则请求对等体建立与缓存对等体的连接并从缓存对等体检索数据。 如果请求对等体没有收到来自任何其他对等体的请求的回复,则请求对等体建立与服务器的连接并从服务器检索数据。 请求对等体存储用于响应来自其他对等体的请求的数据。