IP Library Granted Patent US 7,512,240
Granted Patent B2
US 7,512,240 · App. 10/694,824 · Granted Mar 31, 2009

Management of security key distribution

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,512,240
App. No.
10/694,824
Granted
Mar 31, 2009
Kind
B2
Abstract

Security keys for the provision of a secure service such as content provision are generated in an ancestral hierarchy, so that invalidation of a key in the hierarchy results in a need to reconfigure all other keys in the hierarchy to the extent they share common ancestry. When a user subscription to the service lapses, a decision on invalidation of their key is based in a determination of whether it's more costly to the subscriber to invalidate the key, or continue providing an unpaid-for service. Keys can be allocated to users from domains of the hierarchy on the basis of their economic value to the provider, with higher value users being allocated keys from domains which share fewer common ancestors with other users of other domains than those users share with each other, to minimise inconvenience to high value users of key reconfiguration.

Claims (18)

1. A method for security keys management, the method comprising:

managing security keys generated from a tree-structured ancestral hierarchy and issued by or on behalf of a service provider in order to provide selective access to provision of a service, wherein invalidation of a key necessitates reconfiguration of each other key within the hierarchy to the extent another key and an invalidated key share common ancestry;

defining at least two groups of users of the service;

allocating within the hierarchy a distinct subtree for each group of users; and

issuing keys to users from subtrees within the hierarchy upon the basis of their grouping,

wherein the at least two groups of users are defined upon the basis of a predetermined policy which provides that users are grouped according to their perceived value to a provider of the service, and

wherein a first user group having the highest perceived value to the provider are allocated keys from a first subtree, and wherein keys from the first subtree share fewer ancestors with keys from other subtrees than said keys from other subtrees share with each other, and

wherein keys from the first subtree share only one ancestor with said keys from other subtrees.

2. A method according to claim 1 wherein the ancestral hierarchy has a binary tree architecture.

3. A method according to claim 1 wherein varying levels of service are available and a group of users of a low-service level are allocated dummy keys providing no security, thereby to obviate a need to reconfigure other user's keys upon their invalidation.

4. A method according to claim 3 wherein the service is a dynamic service and its value is ephemeral and based upon its contemporaneous nature.

5. A method for security key management, the method comprising:

managing security keys generated from a tree-structured ancestral hierarchy and issued by or on behalf of a service provider in order to provide selective access to provision of a service, wherein invalidation of a key necessitates reconfiguration of each other key within the hierarchy to the extent another key and an invalidated key share common ancestry;

defining at least two groups of users of the service;

allocating within the hierarchy a distinct subtree for each group of users; and

issuing keys to users from subtrees within the hierarchy upon the basis of their grouping,

wherein the at least two groups of users are defined upon the basis of a predetermined policy which provides that users are grouped according to a perceived susceptibility of them ceasing to require the service, and a first user group having the highest perceived susceptibility are allocated keys from a first subtree, and wherein keys from the first subtree share fewer ancestors with keys from other subtrees than said keys from other subtrees share with each other,

wherein keys from the first subtree share only one ancestor with said keys from other subtrees.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 6, 2021
From: OT PATENT ESCROW, LLC
To: VALTRUS INNOVATIONS LIMITED
Reel/Frame 056157/0492 →
PATENT ASSIGNMENT, SECURITY INTEREST, AND LIEN AGREEMENT Recorded Jan 26, 2021
From: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP; HEWLETT PACKARD ENTERPRISE COMPANY
To: OT PATENT ESCROW, LLC
Reel/Frame 055269/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 9, 2015
From: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 037079/0001 →