Trusted content access management using multiple social graphs across heterogeneous networks

• US 8,561,101 B2
• Filed: 08/25/2011
• Issued: 10/15/2013
• Est. Priority Date: 08/25/2011
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: De, Pradipta, Dey, Kuntal, Jain, Nikhil, Madduri, Venkateswara R.
• Primary Examiner(s): Goodarzi, Nasser
• Assistant Examiner(s): Peng, Fred
• Application Number:
  US13/217,445
• Publication Number:
  US 20130055302A1
• Time in Patent Office: 782 Days
• Field of Search: 725/25, 709223-225
• US Class Current: 725/25
• CPC Class Codes: G06F 21/10 Protecting distributed programs or content, e.g. vending or licensing of copyrighted material protection in video systems or pay television H04N7/16 ; Digital rights management [DRM]
• CPC Class Codes: H04L 63/0272 Virtual private networks
• CPC Class Codes: H04L 63/104 Grouping of entities
• CPC Class Codes: H04N 21/252 Processing of multiple end-users' preferences to derive collaborative data
• CPC Class Codes: H04N 21/2541 Rights Management protecting software against unauthorised usage in a vending or licensing environment G06F21/10; security in data switching network management H04L41/28; security management or policies for network security H04L63/20; access security in wireless networks H04W12/08
• CPC Class Codes: H04N 21/25875 involving end-user authentication restricting access to computer systems by authenticating users using a predetermined code G06F21/33; arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system H04L9/32; networks authentication protocols H04L63/08; authentication in wireless network security H04W12/06
• CPC Class Codes: H04N 21/25891 being end-user preferences retrieval of video data in a video database based on user preferences G06F16/739; arrangements for recognizing users' preferences H04H60/46; user profiles in network data switching protocols H04L67/306; processing of user preferences or user profiles in wireless networks H04W8/18

Abstract

A method, system, and computer readable storage device (that stores the method) extract connectivity information from multiple telecommunication services, provided by a single multiple service provider. The method, system, and device merge the separate connectivity information from each service in a unified graph of telephone service users and digital service users (including common users of both services). The method, system, and device assigne trust values based on the connectivity information and shared data content between users. The method, system, and device may also issue a proxy certificate of authority (CA), by a trusted CA residing within the digital service, to provide digital service to a user of the telephone service in the unified graph, when the trusted CA is a nearest trusted CA in the unified graph.

Claims

1. A computer-implemented method comprising:

determining, by a computer, connectivity graphs among users for each service provided by a single multi-service provider, which provides telephone service, including at least one of a landline telephone service and a cellular telephone service, and digital service, including at least one of a digital broadband service and a digital cable service, said connectivity graphs for said telephone service and said digital service including a number of common users represented as nodes in said connectivity graphs;

creating, by said computer, a unified graph that merges said connectivity graphs for said telephone service and said digital service, said creating of said unified graph comprising;

identifying a direct connectivity between a first node and a second node when said first node is connected to said second node by a first edge in said unified graph, and a duration of said direct connectivity;

identifying a common friend connectivity between a third node and a fourth node when said third node is connected by a second edge to a first intermediary node, which is connected by a third edge to said fourth node in said unified graph, and a duration of said common friend connectivity; and

identifying a community connectivity including a clique connectivity further including a fifth node, a sixth node, a second intermediary node, and a third intermediary node, when said fifth node and said sixth node are identified by said direct connectivity, said second intermediary node and said third intermediary node are identified by said direct connectivity, and said second intermediary node and said third intermediary node, respectively, are both identified by said common friend connectivity between said fifth node and said sixth node, and a duration of said community connectivity;

assigning, by said computer, a first trust value between said each pair of users, based on values associated with each of said direct connectivity, said common friend connectivity, and said community connectivity, and durations of each of said direct connectivity, said common friend connectivity, and said community connectivity;

determining, by said computer, a number of shared areas of interest between each pair of users in said unified graph, based on identification of any of;

file names, key words, and metadata from digital data transmitted to said each pair of users;

determining, by said computer, a number of shared contents between said each pair of users in said unified graph, based on identification of any of TV programs, movies, or video clips digitally transmitted to said each pair of users;

assigning, by said computer, a second trust value to said each pair of users, based on said number of shared areas of interest and said number of shared contents between said each pair of users;

creating a trust matrix, each element of said trust matrix corresponding to a node of said unified graph that has a third trust value based on said first trust value and said second trust value; and

identifying, by said computer, peers in said unified graph, based on similarities of said third trust value.

2. The method of claim 1, a combination of said first trust values associated with any of said direct connectivity, said common friend connectivity, and said community connectivity, and with any of said durations of each of said direct connectivity, said common friend connectivity, and said community connectivity, being normalized.

3. The method of claim 2, connectivity in said unified graph being determined by exceeding a threshold value of said normalized combination of said first trust values associated with any of said direct connectivity, said common friend connectivity, and said community connectivity, and with any of said durations of each of said direct connectivity, said common friend connectivity, and said community connectivity.

4. The method of claim 1, said third trust value being normalized and being divided into ranges, corresponding to one of quartiles and quintiles.

5. The method of claim 4, each of said ranges identifying a corresponding one of said peers.