PATENTSCOPE will be unavailable a few hours for maintenance reason on Tuesday 19.11.2019 at 4:00 PM CET
Search International and National Patent Collections
Some content of this application is unavailable at the moment.
If this situation persists, please contact us atFeedback&Contact
1. (IN1072/MUMNP/2011) “SECURE NODE IDENTIFIER ASSIGNMENT IN A DISTRIBUTED HASH TABLE FOR PEER-TO-PEER NETWORKS”

Office : India
Application Number: 1072/MUMNP/2011 Application Date: 26.05.2011
Publication Number: 1072/MUMNP/2011 Publication Date: 30.12.2011
Publication Kind : A
Prior PCT appl.: Application Number:PCTUS2009069113 ; Publication Number:WO2010075338 Click to see the data
IPC:
H04L 29/06
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
L
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
29
Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/-H04L27/136
02
Communication control; Communication processing
06
characterised by a protocol
Applicants: QUALCOMM INCORPORATED
Inventors: XIAO  Lu
NARAYANAN  Vidya
HARDIE  Edward  Thomas  Lingham
JAYARAM  Ranjith  S.
SUBRAMANIAN  Ramachandran
DONDETI  Lakshminath  Reddy
Priority Data: 12/342,021 22.12.2008 US
Title: (EN) “SECURE NODE IDENTIFIER ASSIGNMENT IN A DISTRIBUTED HASH TABLE FOR PEER-TO-PEER NETWORKS”
Abstract:
(EN) 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.
Also published as:
EP2380324JP2012512617CN102265581KR1020110098855WO/2010/075338