专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2009038831A3 METHODS AND APPARATUS FOR PROVIDING PMIP KEY HIERARCHY IN WIRELESS COMMUNICATION NETWORKS 审中-公开
标题翻译：用于在无线通信网络中提供PMIP密钥层级的方法和设备
公开(公告)号：WO2009038831A3
公开(公告)日：2009-05-14
申请号：PCT/US2008065562
申请日：2008-06-02
申请人： QUALCOMM INC , NARAYANAN VIDYA , HSU RAYMOND TAH-SHENG , DONDETI LAKSHMINATH REDDY , WANG JUN , ULUPINAR FATIH
发明人： NARAYANAN VIDYA , HSU RAYMOND TAH-SHENG , DONDETI LAKSHMINATH REDDY , WANG JUN , ULUPINAR FATIH
IPC分类号： H04L29/06
CPC分类号： H04L63/06 , H04L9/0836 , H04L2209/76 , H04L2209/80 , H04W12/04 , H04W12/06 , H04W80/04 , H04W88/02
摘要： A method is provided for securing a PMIP tunnel between a serving gateway and a new access node through which an access terminal communicates. A PMIP key hierarchy unique to each access terminal is maintained by the gateway. The gateway uses a first node key to secure PMIP tunnels when authentication of the access terminal has been performed. A PMIP key is generated based on the first node key and the PMIP key is sent to the new access node to assist in establishing and securing a PMIP tunnel between the gateway and the new access node. Otherwise, when authentication of the access terminal has not been performed, the gateway generates a second node key and sends it to an intermediary network node which then generates and sends a PMIP key to the new access node. This second key is then used to secure the PMIP tunnel.
摘要翻译：提供了一种用于保护服务网关与接入终端通信所通过的新接入节点之间的PMIP隧道的方法。网关维护每个接入终端唯一的PMIP密钥层次结构。当执行接入终端的认证时，网关使用第一节点密钥来保护PMIP隧道。基于第一节点密钥生成PMIP密钥，并且PMIP密钥被发送到新接入节点，以协助建立和保护网关与新接入节点之间的PMIP隧道。否则，当没有执行接入终端的认证时，网关生成第二节点密钥并将其发送到中间网络节点，中间网络节点然后生成并向新接入节点发送PMIP密钥。然后使用第二个密钥来保护PMIP隧道。

2. 发明申请

WO2007121190A3 METHOD AND APPARATUS FOR BINDING MULTIPLE AUTHENTICATIONS 审中-公开
标题翻译：用于绑定多个认证的方法和装置
公开(公告)号：WO2007121190A3
公开(公告)日：2008-02-07
申请号：PCT/US2007066344
申请日：2007-04-10
申请人： QUALCOMM INC , DONDETI LAKSHMINATH REDDY , NARAYANAN VIDYA
发明人： DONDETI LAKSHMINATH REDDY , NARAYANAN VIDYA
IPC分类号： H04L29/06
CPC分类号： H04L63/08 , H04L63/0815 , H04L63/10 , H04L63/14 , H04L63/1466
摘要： Techniques for binding multiple authentications for a peer are described. In one design, multiple authentications for the peer may be bound based on a unique identifier for the peer. The unique identifier may be a pseudo-random number and may be exchanged securely between the peer, an authentication server, and an authenticator in order to prevent a man-in-the-middle attack. Data for all authentications bound by the unique identifier may be exchanged securely based on one or more cryptographic keys generated by all or a subset of these authentications. In another design, multiple levels of security may be used for multiple authentications for a peer. The peer may perform a first authentication with a first authentication server and obtain a first cryptographic key and may also perform a second authentication with the first authentication server or a second authentication server and obtain a second cryptographic key. The peer may thereafter securely exchange data using the two keys using nested security.
摘要翻译：描述用于绑定对等体的多个认证的技术。在一种设计中，可以基于对等体的唯一标识符来绑定对等体的多个认证。唯一标识符可以是伪随机数，并且可以在对等体，认证服务器和认证者之间安全地进行交换，以防止中间人攻击。基于唯一标识符所绑定的所有认证的数据可以基于由这些认证的全部或一部分生成的一个或多个密码密钥进行安全交换。在另一种设计中，可以将多级安全性用于对等体的多个认证。对等体可以执行与第一认证服务器的第一认证并获得第一密码密钥，并且还可以对第一认证服务器或第二认证服务器执行第二认证，并获得第二密码密钥。然后，对等体可以使用嵌套的安全性使用两个密钥安全地交换数据。

3. 发明申请

WO2010075338A3 SECURE NODE IDENTIFIER ASSIGNMENT IN A DISTRIBUTED HASH TABLE FOR PEER-TO-PEER NETWORKS 审中-公开
标题翻译：安全的节点标识符分配在对等网络的分布式散列表中
公开(公告)号：WO2010075338A3
公开(公告)日：2010-10-07
申请号：PCT/US2009069113
申请日：2009-12-22
申请人： QUALCOMM INC , XIAO LU , NARAYANAN VIDYA , HARDIE EDWARD THOMAS LINGHAM , JAYARAM RANJITH S , SUBRAMANIAN RAMACHANDRAN , DONDETI LAKSHMINATH REDDY
发明人： XIAO LU , NARAYANAN VIDYA , HARDIE EDWARD THOMAS LINGHAM , JAYARAM RANJITH S , SUBRAMANIAN RAMACHANDRAN , DONDETI LAKSHMINATH REDDY
IPC分类号： H04L29/06 , H04L29/12
CPC分类号： H04L63/126 , H04L63/1458 , H04L63/1466 , H04L67/104 , H04L67/1046 , H04L67/1057 , H04L2463/142
摘要： A multi-party commitment method is provided whereby a joining node uses contributions provided by contributor nodes in a peer-to-peer overlay network to generate a node identifier. The joining node generates a first contribution and sends a join request to an introducer node (or a plurality of contributor nodes), where the join request seeks to obtain one or more contributions for generating the node identifier within an identifier space of the overlay network. A hash of the first contribution may be included as part of the join request. In response, the joining node may receive a plurality of contributions, wherein the contributions are bound to each other and the first contribution by a prior external multi-node commitment operation. The joining node can then generate its node identifier as a function of the first contribution and the received contributions. Consequently, collusion between nodes and malicious manipulation during ID generation can be frustrated.
摘要翻译：提供多方承诺方法，由此加入节点使用由对等覆盖网络中的贡献者节点提供的贡献来生成节点标识符。加入节点生成第一贡献并向引导者节点（或多个贡献者节点）发送加入请求，其中加入请求试图获得用于在覆盖网络的标识符空间内生成节点标识符的一个或多个贡献。第一个贡献的散列可以作为加入请求的一部分包含在内。作为响应，加入节点可以接收多个贡献，其中贡献彼此相关并且第一贡献通过先前的外部多节点承诺操作。随后加入节点可以根据第一贡献和接收到的贡献生成其节点标识符。因此，ID生成期间节点之间的串通和恶意操作可能会受挫。

4. 发明申请

WO2009155567A3 METHODS AND APPARATUS FOR EVENT DISTRIBUTION AND ROUTING IN PEER-TO-PEER OVERLAY NETWORKS 审中-公开
标题翻译：在对等网络中进行事件分发和路由的方法和装置
公开(公告)号：WO2009155567A3
公开(公告)日：2010-04-01
申请号：PCT/US2009048044
申请日：2009-06-19
申请人： QUALCOMM INC , JAYARAM RANJITH , HARDIE EDWARD THOMAS LINGHAM , DONDETI LAKSHMINATH REDDY , NARAYANAN VIDYA
发明人： JAYARAM RANJITH , HARDIE EDWARD THOMAS LINGHAM , DONDETI LAKSHMINATH REDDY , NARAYANAN VIDYA
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L45/02 , H04L45/028 , H04L67/1059
摘要： Methods and apparatus for event distribution and routing in peer-to-peer overlay networks. A method is provided for event distribution and routing in a peer-to-peer overlay network that comprises a plurality of nodes. The method includes identifying a plurality of buckets on the overlay network, wherein each bucket includes one or more nodes, respectively, identifying bucket groups, wherein each bucket group includes a selected number of buckets, respectively, distributing events based on the bucket groups, and updating a routing table based on the events. A node includes a transceiver and a processor coupled to the transceiver and configured to identify a plurality of buckets on the overlay network, wherein each bucket includes one or more nodes, respectively, identify bucket groups, wherein each bucket group includes a selected number of buckets, respectively, distribute events based on the bucket groups, and update a routing table based on the events.
摘要翻译：对等覆盖网络中事件分发和路由的方法和装置。提供了一种用于包括多个节点的对等覆盖网络中的事件分发和路由的方法。该方法包括识别覆盖网络上的多个桶，其中每个桶分别包括一个或多个节点，标识桶组，其中每个桶组分别包括选定数量的桶，基于桶组分配事件，以及基于事件更新路由表。节点包括收发机和处理器，其耦合到收发器并且被配置为识别覆盖网络上的多个桶，其中每个桶分别包括一个或多个节点，以识别桶组，其中每个桶组包括选定数量的桶分别基于桶组分配事件，并根据事件更新路由表。

5. 发明申请

WO2008024999A3 SYSTEMS AND METHODS FOR KEY MANAGEMENT FOR WIRELESS COMMUNICATIONS SYSTEMS 审中-公开
标题翻译：无线通信系统的关键管理系统与方法
公开(公告)号：WO2008024999A3
公开(公告)日：2008-05-15
申请号：PCT/US2007076800
申请日：2007-08-24
申请人： QUALCOMM INC , NARAYANAN VIDYA , DONDETI LAKSHMINATH REDDY , AGASHE PARAG ARUN , BENDER PAUL E
发明人： NARAYANAN VIDYA , DONDETI LAKSHMINATH REDDY , AGASHE PARAG ARUN , BENDER PAUL E
IPC分类号： H04L29/06 , H04W12/04 , H04W36/00
CPC分类号： H04L63/062 , H04L9/0844 , H04L9/0891 , H04L2209/80 , H04L2463/061 , H04W12/04 , H04W36/08
摘要： A novel key management approach is provided for securing communication handoffs between an access terminal (118) and two access points (110,112). This approach provides for securely handing off communications between an access terminal and access point without risking exposure a master key for the access terminal. Temporary master keys (I-MK) are derived for low latency handoffs and secure authentication between a new access point (112) and the access terminal! In one aspect, a distributive key management scheme is provided in which a current access point (110) generates a new security key (based on its own security key) that is used by the next access point with which an access terminal communicates. In another aspect, a centralized key management scheme is provided in which a central authenticator (120) maintains, generates, and distributes new security keys (based on a master security key associated with the access terminal) to access points.
摘要翻译：提供了一种新颖的密钥管理方法，用于保护接入终端（118）和两个接入点（110,112）之间的通信切换。这种方法提供了安全地切断接入终端和接入点之间的通信，而不会冒着接入终端的主密钥的风险。导出临时主密钥（I-MK）用于低延迟切换和新接入点（112）与接入终端之间的安全认证！一方面，提供了一种分配密钥管理方案，其中当前接入点（110）生成由接入终端与之通信的下一个接入点使用的新的安全密钥（基于其自己的安全密钥）。在另一方面，提供一种集中式密钥管理方案，其中中央认证器（120）维护，生成和分发新的安全密钥（基于与接入终端相关联的主安全密钥）到接入点。

6. 发明申请

WO2010056936A3 NETWORK NODES AND METHODS FOR DATA AUTHORIZATION IN DISTRIBUTED STORAGE NETWORKS 审中-公开
标题翻译：用于分布式存储网络中的数据授权的网络编号和方法
公开(公告)号：WO2010056936A3
公开(公告)日：2010-11-11
申请号：PCT/US2009064301
申请日：2009-11-13
申请人： QUALCOMM INC , DONDETI LAKSHMINATH R , JAYARAM RANJITH S , NARAYANAN VIDYA
发明人： DONDETI LAKSHMINATH R , JAYARAM RANJITH S , NARAYANAN VIDYA
IPC分类号： H04L29/06
CPC分类号： H04L67/104 , H04L63/0823 , H04L67/1065 , H04L67/1076
摘要： Storage authorization and access control of data stored on a peer-to-peer overlay network is provided. A publishing node (502) stores data on a storage node (506) in the overlay network. The publishing node (502) is adapted to facilitate data storage authorization by generating a resource identifier (516) as a function of a usage string associated with a data type' to be stored. A storage request (504) is generated that includes the resource identifier (516) and data to be stored (518). The storage request may be sent to the storage node (506). The storage device (506) receives the storage request (504) sent by a publishing node (502), including a resource identifier (516) and data to be stored (518). Independent storage authorization is performed by the storage node (506) at an overlay level by verifying (510, 512) the resource identifier. The data in the storage request is stored at the storage node if the resource identifier is successfully verified.
摘要翻译：提供存储在对等覆盖网络上的数据的存储授权和访问控制。发布节点（502）将数据存储在覆盖网络中的存储节点（506）上。出版节点（502）适于通过根据与要存储的数据类型相关联的使用字符串的生成资源标识符（516）来促进数据存储授权。生成包括资源标识符（516）和要存储的数据（518）的存储请求（504）。存储请求可以被发送到存储节点（506）。存储装置（506）接收由发布节点（502）发送的包括资源标识符（516）和要存储的数据（518）的存储请求（504）。通过验证（510,512）资源标识符，由存储节点（506）在覆盖级别执行独立存储授权。如果资源标识符被成功验证，则存储请求中的数据被存储在存储节点处。

7. 发明申请

WO2010099492A3 METHOD AND APPARATUS FOR DETERMINING A SIZE OF A PEER TO PEER OVERLAY WORK 审中-公开
标题翻译：用于确定同型号重叠尺寸的方法和装置
公开(公告)号：WO2010099492A3
公开(公告)日：2010-10-21
申请号：PCT/US2010025665
申请日：2010-02-26
申请人： QUALCOMM INC , DAS SAUMITRA M , NARAYANAN VIDYA , DONDETI LARKSHMINATH R , JAYARAM RANJITH S
发明人： DAS SAUMITRA M , NARAYANAN VIDYA , DONDETI LARKSHMINATH R , JAYARAM RANJITH S
IPC分类号： H04L29/06 , H04L12/24 , H04L29/08
CPC分类号： H04L41/12 , H04L67/104 , H04L67/1044
摘要： Methods and apparatus for enhanced overlay state maintenance in a peer-to- peer overlay network. A first method includes inferring that a first node is leaving the overlay network, and transmitting a decrement message to decrement a size counter value. A second method includes identifying a set of nodes associated with a first node of an overlay network, obtaining a segment length associated with each node of the set of nodes, and determining a size of the overlay network by dividing the total number of nodes in the set of nodes by the sum of the segment lengths. A third method includes identifying a set of nodes associated with a first node of an overlay network, obtaining a size estimate associated with the first node and with each node of the set of nodes, and determining a size of the overlay network by averaging the size estimates.
摘要翻译：在对等覆盖网络中增强覆盖状态维护的方法和装置。第一种方法包括推断第一个节点正在离开覆盖网络，并发送递减消息来减小大小计数器值。第二种方法包括标识与覆盖网络的第一节点相关联的一组节点，获得与节点集合中的每个节点相关联的分段长度，以及通过划分覆盖网络中的节点总数来确定覆盖网络的大小节点集合的段长度之和。第三种方法包括识别与覆盖网络的第一节点相关联的一组节点，获得与该第一节点和该节点集合中的每个节点相关联的大小估计，以及通过对该覆盖网络的大小进行平均来确定覆盖网络的大小估计。

8. 发明申请

WO2008061257A3 METHODS AND APPARATUS FOR IMPLEMENTING PROXY MOBILE IP IN FOREIGN AGENT CARE-OF ADDRESS MODE 审中-公开
标题翻译：在外部代理服务器上实现代理移动IP的方法和设备 - 地址模式
公开(公告)号：WO2008061257A3
公开(公告)日：2008-07-17
申请号：PCT/US2007085066
申请日：2007-11-19
申请人： QUALCOMM INC , ULUPINAR FATIH , WANG JUN , AGASHE PARAG ARUN , HSU RAYMOND TAH-SHENG , NARAYANAN VIDYA
发明人： ULUPINAR FATIH , WANG JUN , AGASHE PARAG ARUN , HSU RAYMOND TAH-SHENG , NARAYANAN VIDYA
IPC分类号： H04L29/06
CPC分类号： H04W8/04 , H04W8/085 , H04W8/26 , H04W60/00
摘要： A method for implementing proxy mobile Internet protocol (PMIP) in mobile IP foreign agent care-of-address mode may include determining a home address of an access terminal. The method may also include communicating with a home agent in order to bind an address of the network node with the home address of the access terminal and establish a tunnel between the network node and the home agent. The method may also include receiving first packets destined for the access terminal from the home agent via the tunnel and sending the first packets to the access terminal. The method may also include receiving second packets sent by the access terminal that are destined for a correspondent node and sending the second packets to the home agent via the tunnel.
摘要翻译：用于在移动IP外地代理转交地址模式中实现代理移动互联网协议（PMIP）的方法可以包括确定接入终端的归属地址。该方法还可以包括与归属代理进行通信以便将网络节点的地址与接入终端的归属地址进行绑定，并且在网络节点和归属代理之间建立隧道。该方法还可以包括经由隧道从归属代理接收去往接入终端的第一分组并且将第一分组发送到接入终端。该方法还可以包括：接收由接入终端发送的去往对端节点的第二分组，并经由该隧道向归属代理发送第二分组。

9. 发明申请

WO2012099941A3 METHOD AND APPARATUS FOR CLASSIFYING PROXIMATE MATERIALS AND ESTIMATING RANGE 审中-公开
标题翻译：用于分类临时材料和估算范围的方法和装置
公开(公告)号：WO2012099941A3
公开(公告)日：2012-09-27
申请号：PCT/US2012021688
申请日：2012-01-18
申请人： QUALCOMM INC , GROKOP LEONARD H , NARAYANAN VIDYA
发明人： GROKOP LEONARD H , NARAYANAN VIDYA
IPC分类号： G01N21/31 , G01B11/14 , G01C3/00 , G01S17/08 , H04M1/21
CPC分类号： G01N21/31 , G01B11/026 , G01N21/35 , G01N21/3563 , G01N2201/0221 , G01S17/08 , H04M2250/12
摘要： A mobile device may determine a material-type of a surface proximate to the device and/or a distance between the device and the proximate surface, in at least one implementation. In some implementations, proximate material-type information may be used to estimate a distance between a mobile device and a proximate surface. A material class may also be determined for a proximate surface in some implementations. Various context-based applications are disclosed for material-type, material class, and/or distance information in connection with a mobile device.
摘要翻译：在至少一个实施方式中，移动设备可以确定靠近设备的表面的材料类型和/或设备和近邻表面之间的距离。在一些实施方式中，可以使用邻近材料类型信息来估计移动设备和邻近表面之间的距离。在一些实施方案中，也可以为近似表面确定材料类别。公开了与移动设备相关的材料类型，材料类和/或距离信息的各种基于上下文的应用。

10. 发明申请

WO2010105106A3 METHODS AND APPARATUS FOR MERGING PEER-TO-PEER OVERLAY NETWORKS 审中-公开
标题翻译：用于合并对等覆盖网络的方法和设备
公开(公告)号：WO2010105106A3
公开(公告)日：2010-11-04
申请号：PCT/US2010027051
申请日：2010-03-11
申请人： QUALCOMM INC , DAS SAUMITRA MOHAN , DONDETI LAKSHMINATH R , NARAYANAN VIDYA , JAYARAM RANJITH S
发明人： DAS SAUMITRA MOHAN , DONDETI LAKSHMINATH R , NARAYANAN VIDYA , JAYARAM RANJITH S
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1042 , H04L67/1044 , H04L67/1046 , H04L67/1059
摘要： Methods and apparatus for merging peer-to-peer overlay networks. A method includes receiving an advertisement from a second overlay network, determining a size of the second overlay network, performing a self search on the second overlay network based on a persistent node identifier, if the size of the second overlay network is greater than the size of a first overlay network, and joining the second overlay network if the persistent node identifier is not part of the second overlay network. An apparatus includes a transceiver to receive an advertisement from a second overlay network, and a processor coupled to the transceiver to determine a size of the second overlay network, perform a self search on the second overlay network based on a persistent node identifier, and join the second overlay network if the persistent node identifier is not part of the second overlay network.
摘要翻译：用于合并对等覆盖网络的方法和设备。一种方法包括：从第二覆盖网络接收广告;确定第二覆盖网络的大小;如果第二覆盖网络的大小大于大小，则基于持久节点标识符在第二覆盖网络上执行自搜索如果所述永久节点标识符不是所述第二覆盖网络的一部分，则加入所述第二覆盖网络。一种装置包括：收发器，用于从第二覆盖网络接收广告;以及处理器，耦合到收发器以确定第二覆盖网络的大小，基于永久节点标识符在第二覆盖网络上执行自搜索，如果所述永久节点标识符不是所述第二覆盖网络的一部分，则所述第二覆盖网络。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式