US7007040B1 - Method and apparatus for storing and updating information in a multi-cast system - Google Patents
Method and apparatus for storing and updating information in a multi-cast system Download PDFInfo
- Publication number
- US7007040B1 US7007040B1 US10/004,126 US412601A US7007040B1 US 7007040 B1 US7007040 B1 US 7007040B1 US 412601 A US412601 A US 412601A US 7007040 B1 US7007040 B1 US 7007040B1
- Authority
- US
- United States
- Prior art keywords
- node
- leaf
- keys
- users
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime, expires
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000001010 compromised effect Effects 0.000 claims description 38
- 238000007796 conventional method Methods 0.000 description 11
- 230000008859 change Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000004044 response Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1886—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99932—Access augmentation or optimizing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99951—File or database maintenance
- Y10S707/99952—Coherency, e.g. same view to multiple users
- Y10S707/99953—Recoverability
Definitions
- the present invention relates to a method and apparatus for updating and storing information in a multi-cast system and, more particularly, to using a redundant path tree to minimize the number of messages that need to be sent to update users with changes to the system.
- One-way communication has always served a fundamental role in society.
- One-way communication allows one party to send messages or information to one or more receiving parties.
- An example of one-way communication is subscription television service, wherein a broadcaster sends its content to many customers.
- Subscription television typically is a fee-based service. Therefore, a subscription television system operator wants to ensure that only paying customers receive its signal.
- a broadcaster could effect a secure system wherein only paying customers can use the service by maintaining its own network and physically adding or removing user connections, but such a system would be unduly burdensome and impractical to implement.
- a popular alternative is the use of encryption as a means for providing secure transmissions. Using encryption, a broadcaster can use its own equipment or a public network to send information. Any person with access to the network would be able to receive the encrypted signal, but would require a key to decipher the encrypted signal. The broadcaster provides keys to only the authorized users. Although an unintended recipient may receive the signal, the signal typically would be useless without the appropriate key.
- Encrypting signals creates additional challenges for the broadcaster.
- the broadcaster needs a way to manage, update, or change keys every time there is a change to the intended group of recipients, e.g. whenever customers are added or deleted. Otherwise, an unauthorized recipient could still decrypt the signal.
- One solution would be for the broadcaster to send new keys to each authorized customer each time the group of authorized recipients is altered. This solution would require the broadcaster to send a unique message including new keys to each customer. For a system of n users, this would require the broadcaster to send n messages to update the system. Unauthorized users would not receive new keys and thus would not be able to decrypt signals. This system may be practical where there is a relatively small number of authorized users. However, as the list of authorized users grows, it can become very burdensome to send a new key to each authorized user every time the system needs to be updated.
- this method is based on a balanced binary tree 100 .
- a balanced tree is a tree wherein each node has the same number of children.
- a balanced binary tree is a tree wherein each node has exactly two children.
- Root 110 of tree 100 represents the server (broadcaster), and each leaf 160 – 167 represents a user (customer). An authorized user would hold the keys associated with each node on the path from the root to that user.
- the server would select a set of subtrees of the main tree that contain only those users.
- the nodes of the tree that are on the paths from the root to the select group of users are referred to as the common ancestor tree nodes for those users.
- the server When the broadcaster no longer wants a certain user to be able to decrypt the signal, the server must replace each key that the user held. Users who no longer are authorized recipients are referred to as compromises. New keys must be delivered to each of the authorized users in the system. When the server wants to exclude one user, the number of messages that must be sent to deliver the new keys is on the order of d, where d is the depth of the tree. In addition, some authorized users might not receive the initial update signal, so additional messages must be sent to ensure that the authorized users are properly updated and not erroneously treated as compromises. This is known as the late entry problem. As the number of updates increases, so does the number of late entries. If k updates are needed for a tree of depth d, approximately d*k update messages are sent.
- a large communication system may not be able to update its keys fast enough to provide adequate service to its customers while stopping unauthorized recipients from using proprietary information.
- the number of messages needed can grow exponentially with the number of users. Even though methods such as linear key hierarchy and others known in the art are an improvement over uni-cast systems, there is a need to further reduce the number of messages that must be sent when updating a system.
- the present invention is a method and apparatus for delivering information from a single source, such as a server, to multiple destinations in a system.
- the present invention reduces the number of messages the server must send to update information in the system, compared to known systems.
- the present invention is an advance over conventional methods such as linear key hierarchy.
- the present invention uses the data structure of a tree to organize the delivery of information. While conventional methods typically use a balanced binary tree, the present invention works well with binary trees and trees with more than two children per node because it does not need to rely on the unique properties of a binary tree. The ability to increase the number of children per node can reduce the overall depth of the tree. With a shorter tree, according to the present invention, the number of messages needed to update the nodes can be reduced.
- the present invention also changes the amount and type of information that each node stores. Specifically, the present invention stores more keys at each node than conventional methods. When a node is compromised, not all of the compromised keys need to be replaced. Instead, the server no longer uses the compromised keys when sending out information. The server can use one of the many other keys held by authorized users that are not held by unauthorized users to deliver subsequent information. Because there are multiple ways to deliver information to the authorized users, this type of structure is referred to as a redundant path tree.
- the server When a user is compromised, the server no longer uses the keys that the compromised user held. Using this method, updating the system requires fewer messages.
- the present invention is effective regardless of whether it is updating the system for a single compromise or a group of compromises. Furthermore, when compared to conventional methods, the present invention reduces the number of messages needed to remedy late entries. Also, the present method is more effective because it may be used with a variety of different systems, including systems in which gross variations in the number of users are encountered.
- an m-ary tree to manage the information sent through a multi-cast system.
- An m-ary tree is a tree wherein the maximum number of children per node is m.
- the root of the tree is the server.
- the server sends out its signal encrypted with a master key. Every authorized user has a copy of the master key to decrypt the signal. When the server no longer wishes a particular user to decrypt messages, it stops using that particular master key.
- the server sends update messages containing a new master key to the authorized users. Each update message is encrypted with a secondary key.
- Each non-leaf node in the tree has a set of secondary keys defined such that each secondary key corresponds to one of the possible subsets of children of the node.
- Each leaf (user) has a set of keys associated with each node on the path from the leaf to the root.
- the server Before an authorized user can use a new master key, the server must send a copy of the new master key to the authorized users.
- the server will use the secondary keys associated with only the authorized users to encrypt messages that contain the new master key. Because the no-longer authorized uses do not have the appropriate secondary key, they cannot decrypt the message to receive the new master key.
- the server typically will determine the minimum number of messages it needs to send to update the system by analyzing the secondary keys associated with the authorized users. The server will send these messages, and the system will be updated with the new master key.
- FIG. 1 is a schematic diagram of a prior art balanced binary tree
- FIG. 2 is a schematic diagram of a prior art common ancestor tree
- FIG. 3 is a schematic diagram of a redundant path tree
- FIG. 4 is a schematic diagram of a redundant path tree with one compromise.
- FIG. 5 is a schematic diagram of a redundant path tree with three compromises.
- the present invention is a method and apparatus for delivering and updating information in a system using fewer communications than used by conventional methods.
- the present invention is implemented in a secure multi-cast system that sends an encrypted signal to many users.
- TEK traffic encryption key
- a user who is no longer deemed an authorized user is referred to as a compromise.
- the server typically will transition to a different TEK so that the compromise's TEK can no longer decrypt the signal.
- Key encryption keys (“KEK”) are stored by each node and are used to encrypt signals containing keys.
- KEKs are used to deliver a new TEK to the authorized users in the system.
- the server will send a number of messages through the system to update the authorized users with a new TEK.
- the system uses a common TEK for all authorized users, but the system may use many KEKs to update the authorized users with a new common TEK.
- the use of KEKs in the system dictates the number and manner in which the update messages will be sent.
- the root and leaves of a tree are specific types of nodes that have special properties.
- the root is a node without a parent node, and the leaves are nodes that do not have any child nodes.
- Internal nodes have both a parent and children, i.e. they are nodes that are neither a root nor a leaf.
- this invention will work with most types of trees, the preferred embodiment uses an m-ary tree, where m is the maximum number of children per node.
- the “depth” of a tree is the maximum number of levels in that tree.
- the root is at level zero.
- the level of any other node is numbered one plus the level of its parent.
- tree 300 is an m-ary tree where m equals three, meaning that each node can have at most three children.
- Tree 300 has a depth of two.
- a tree can have more or fewer than three children per node, but three or more children per node is preferred.
- the overall depth, d, of the tree is less than that of a binary tree with an equal number of users. Generally, the shallower the tree, the lower the number of messages needed to react to a compromise.
- the tree is initially constructed as a balanced tree (i.e. all nodes have the same number of children, preferably the maximum).
- Root 310 of the tree represents the server, which distributes the signal, and each leaf, 351 – 359 , represents a user.
- the internal nodes e.g. nodes 320 , 325 , and 327 , do not correspond to any physical device.
- the internal nodes are abstractions which facilitate information processing. Physically, messages are sent directly from root 310 to leaves 351 – 359 . Where m is the maximum number of children per node and d is the depth of the tree, the maximum number of users that the present invention typically could serve would be m d .
- a preferred embodiment of the present invention also defines a set of KEKs for each non-leaf node.
- Each key in a set of KEKs associated with a non-leaf node is held by one of the subsets of the corresponding node's children.
- the total number of KEKs associated with an internal node is usually 2 m ⁇ 1.
- one common KEK typically is held by all of the node's children. Because this common KEK may not be necessary in certain embodiments, the nodes in such embodiments might use only 2 m ⁇ 2 KEKs.
- a leaf holds all of the KEKs associated with that leaf for all of the nodes on the path from that leaf to the root.
- a leaf In general, for a tree of depth d, a leaf would hold d*(2 m-1 ⁇ 1) KEKs. In this embodiment of the present invention, there are multiple ways to deliver a TEK to the users. Accordingly, this type of structure is referred to as a redundant path tree.
- internal nodes 320 , 325 , and 327 and root 310 would each have six keys.
- root 310 would have three KEKs, one known by each internal node (i.e., internal nodes 320 , 325 , and 327 ).
- root 310 would have three more KEKs known by a combination of its children: one known by node 320 and node 325 , another known by node 325 and node 327 , and yet another known by node 320 and node 327 .
- each user would know of every key on the path from that user to the root.
- root 310 could have a KEK known by all of its children, but that KEK typically would not be effective in dealing with a compromise.
- a KEK known by all the children may have alternative uses within the system other than handling a compromise.
- Each authorized user in FIG. 3 would typically have six KEKs.
- user 351 would have the following KEKs: the KEK known individually by internal node 320 ; the KEK known jointly by nodes 320 and 325 ; the KEK known jointly by nodes 320 and 327 ; the KEK known jointly by users 351 and 352 ; the KEK known jointly by users 351 and 353 ; and, finally, the KEK known individually by user 351 .
- root 310 In addition to the KEKs defined in the tree, root 310 typically uses a common TEK for all the authorized users. The TEK is used to encrypt and decrypt the main traffic sent by root 310 . For security purposes, when a user is compromised, the TEK used by the system typically is changed. Root 310 will send one or more messages with each message encrypted by a different KEK, but each message typically will contain the same TEK. The number of messages sent and the KEKs used will determine which users receive the new common TEK. Even though each node has many KEKs, only one of its KEKs will be used to decrypt the signal with the new common TEK.
- root 310 When root 310 needs to update the TEK, it will determine the minimum number of messages it needs to send by identifying the common ancestor tree nodes for the authorized users. When a set of authorized users shares a common KEK not held by a compromised user, root 310 can send the TEK to that set of authorized users in a single message, encrypted in a single KEK. Root 310 typically will find the largest set of users that can use the same KEK. For example, assume user 351 becomes a compromise. Internal nodes 325 and 327 and their descendent users would all have at least one KEK in common that the compromised user 351 does not have.
- root 310 can use that one common KEK to encrypt a message containing a new TEK that only users 354 – 359 could decrypt.
- Root 310 would have to send individual update messages to each of users 352 and 353 because the KEK they have in common with users 354 – 359 is also known by compromised user 351 .
- root 310 would send just enough encrypted messages to ensure that the remaining authorized users will receive the new TEK.
- the maximum number of messages that must be sent equals the number of compromises multiplied by d, the depth of the tree. However, because many nodes share some KEKs and the same compromised KEKs, when several compromises are to be dealt with at one time, the required number of messages is likely to be less than the maximum.
- the server determines the number of messages needed by analyzing the common ancestor tree nodes. A single message can update those authorized users who share a common ancestor tree node that is not shared by a compromise. Accordingly, the server will find the common ancestor tree nodes that have the greatest number of users that do not contain a compromise.
- the server will find the highest (i.e., closest to the root) common ancestor tree node that leads only to authorized users, and use a key from that node to reach those authorized users.
- the server typically can quickly determine the minimum number of messages that need to be sent to update the system.
- root 310 would send four messages. That is, when user 351 became compromised, root 310 would send one message to update users 354 – 359 and another message to update users 352 – 353 . Then, when user 353 became compromised, root 310 would send a third message to update users 354 – 359 and a fourth message to update user 352 . However, if root 310 were to handle both compromises at the same time, only two messages would need to be sent. One message would update users 354 – 359 with the new common TEK and another message would update user 352 with the new common TEK. In the present invention, handling more than one compromise at a time can reduce the number of messages because the KEKs at each node do not necessarily change with each compromise and because more KEKs are available to reach various sets of users.
- the present invention uses fewer messages to resolve late entries when compared with conventional methods.
- the number of messages required to react to multiple compromises, occurring either singularly or as a group typically is much lower when compared with conventional methods.
- the number of messages the server needs to send varies depending on the relative location and number of compromises.
- the number of messages sent typically will be between one and m d-1 . If m is greater than two, the number of messages sent will be less than that required for a binary tree. As m increases, the number of messages the server needs to send decreases, but the complexity of the system increases. As discussed above, each user typically has to store d*(2 m-1 ⁇ 1) KEKs. If m is very large, each user will have to be able to store a large number of keys.
- FIG. 4 shows one compromise, specifically compromised user 480 .
- every authorized user will need a new common TEK.
- the new common TEK is delivered by using the KEKs known by the non-compromised nodes.
- Users 420 share only one KEK with compromised user 480 . Therefore, only one message typically needs to be sent to replace the TEK for users 420 .
- root 410 can send a message encrypted by a common KEK known by users 420 and not known by compromised user 480 .
- Users 430 , 440 , and 450 cannot use the message sent to users 420 because the only KEK they have in common with users 420 is also known by the compromised user 480 .
- Each group of users 430 , 440 , and 450 have at least one common KEK among them not known by compromised user 480 . Users 430 , 440 and 450 cannot use the same message because the KEKs they have in common are also known by compromised user 480 .
- root 410 can send three update messages with a new common TEK each encrypted by a KEK that is known only by users 430 , 440 , and 450 , respectively. As discussed, each message is formatted in such a way and has the necessary information to allow only its intended recipients to update those recipients' TEK.
- FIG. 5 shows three compromised users, specifically users 520 , 525 , and 530 .
- each authorized user must receive a new common TEK.
- Users 560 that share only one common KEK with the compromises will receive a new TEK via a single message encrypted with a KEK known only by users 560 .
- a KEK only known by node 575 and its descendants can be used to replace the TEK for users 560 .
- Users who do not have a KEK in common with users 560 will receive the new TEK via other messages encrypted with KEKs known only to those users.
- users 540 each share at least one KEK not known by compromises 520 , 525 , or 530 .
- users 540 can use the same message encrypted by the KEK to replace the common TEK.
- Users 550 also each share at least one KEK not known by compromises 520 , 525 , or 530 .
- any KEK common to both users 540 and 550 usually will also be common to at least one of compromises 520 , 525 , or 530 .
- users 540 and 550 will not be able to use the same KEK to update the new common TEK.
- Root 510 will have to send two different messages, each encrypted with a different KEK—one to update users 540 and another message to update users 550 .
- the message sent to update users 540 could use a KEK known only by node 580 , node 585 , and their descendant users
- the message sent to update users 550 could be a KEK known only by node 570 and its descendant users.
- the server can determine the minimum number of messages it needs to send. Theoretically, the server could send a different message for each of the remaining authorized users. However, it is more likely that the present invention will use less than the theoretical maximum. For example, because the depth of tree 500 is four, as shown in FIG. 5 , four different messages can be sent to properly update the authorized users in response to a single compromise. When the server responds to multiple compromises, fewer than four messages per compromise might be needed. Generally, the higher in the tree (i.e.
- node 575 which is a common ancestor tree node for users 560
- node 570 which is a common ancestor tree node for users 550 .
- server 510 will be able to update a greater number of users, twenty-seven, in a single message than if it were to use a common ancestor tree node located in a lower level, such as node 570 which would only update nine users.
- the server determines which groups of authorized users share a parent node with a group of compromised users. Each group of authorized users that share a parent node with a group of compromised users can use a key from a non-shared parent or its own unique key to receive a message. In the FIG. 5 example, only nine messages (instead of twelve or more messages) were used to update the system after three compromises.
- compromised KEKs are not re-used.
- the need to schedule a system wide KEK replacement typically depends on the number of compromises that have occurred in the system. Once the need arises, every KEK in the tree should be replaced. Typically, the KEKs should be replaced on a schedule consistent with their use. The more often a system reacts to compromises, the sooner the KEK replacement should be done. The manner and scheduling of the replacement of the KEKs in a tree is outside the scope of this invention.
- the system would replace every KEK in the tree using an out of band method as would be known to one skilled in the art.
- a novel method for storing and updating information in a multi-cast system focuses on a system that uses a tree data structure to manage information.
- the information stored and updated can be virtually anything.
- a specific embodiment was described where a TEK was needed to decrypt a signal from a server.
- Different KEKs are associated with each node.
- this specific embodiment used the KEKs to deliver the new TEK to only those users who are intended recipients.
- the TEK is updated whenever a user is to no longer to be able to use the signal but is still part of the physical system.
- the present invention works well on a variety of systems of different types and sizes. By changing how keys are stored, used, and sent, the present invention reduces the number of messages needed to update the system, compared to over conventional methods.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims (14)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/004,126 US7007040B1 (en) | 2001-12-04 | 2001-12-04 | Method and apparatus for storing and updating information in a multi-cast system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/004,126 US7007040B1 (en) | 2001-12-04 | 2001-12-04 | Method and apparatus for storing and updating information in a multi-cast system |
Publications (1)
Publication Number | Publication Date |
---|---|
US7007040B1 true US7007040B1 (en) | 2006-02-28 |
Family
ID=35922937
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/004,126 Expired - Lifetime US7007040B1 (en) | 2001-12-04 | 2001-12-04 | Method and apparatus for storing and updating information in a multi-cast system |
Country Status (1)
Country | Link |
---|---|
US (1) | US7007040B1 (en) |
Cited By (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050220304A1 (en) * | 2002-06-17 | 2005-10-06 | Koninklijke Philips Electronics N.V. | Method for authentication between devices |
US20050220054A1 (en) * | 2002-11-26 | 2005-10-06 | Robert Meier | Wireless local area network context control protocol |
US20080077710A1 (en) * | 2002-10-28 | 2008-03-27 | Cisco Technology, Inc. | RPF multi-party reliable transport |
US20080118068A1 (en) * | 2006-11-16 | 2008-05-22 | Samsung Electronics Co., Ltd. | Method and apparatus for local domain management using device with local authority module |
US20080170692A1 (en) * | 2007-01-17 | 2008-07-17 | Matsushita Electric Works, Ltd. | Systems and methods for distributing updates for a key at a maximum rekey rate |
US20080273474A1 (en) * | 2007-03-30 | 2008-11-06 | Brother Kogyo Kabushiki Kaisha | Network system, information processor, and information processing program recording medium |
US20090052448A1 (en) * | 2007-08-24 | 2009-02-26 | At&T Intellectual Property I, L.P. | Methods and systems to store state used to forward multicast traffic |
US7664125B1 (en) * | 2006-01-03 | 2010-02-16 | Emc Corporation | Indication forwarding in a distributed environment |
US20100105314A1 (en) * | 2002-07-12 | 2010-04-29 | Nokia Corporation | Announcing information service through broadcasting or multicasting |
CN101296133B (en) * | 2008-06-24 | 2011-01-26 | 清华大学 | Speculation method for link packet loss rate |
US20140289512A1 (en) * | 2013-03-20 | 2014-09-25 | Industrial Technology Research Institute | Method for certificate generation and revocation with privacy preservation |
US9212962B2 (en) | 2012-07-11 | 2015-12-15 | Robert Bosch Gmbh | Self-powered pressure sensor assembly |
CN108063756A (en) * | 2017-11-21 | 2018-05-22 | 阿里巴巴集团控股有限公司 | A kind of key management method, device and equipment |
US20230177033A1 (en) * | 2021-12-06 | 2023-06-08 | Unisys Corporation | Method of building and appending data structures in a multi-host environment |
Citations (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4309569A (en) | 1979-09-05 | 1982-01-05 | The Board Of Trustees Of The Leland Stanford Junior University | Method of providing digital signatures |
US4771461A (en) | 1986-06-27 | 1988-09-13 | International Business Machines Corporation | Initialization of cryptographic variables in an EFT/POS network with a large number of terminals |
US4771459A (en) | 1985-04-29 | 1988-09-13 | U.S. Philips Corp. | System for storing and distributing keys for cryptographically protected communication |
US4912762A (en) | 1987-04-22 | 1990-03-27 | International Business Machines Corporation | Management of cryptographic keys |
US4941176A (en) | 1988-08-11 | 1990-07-10 | International Business Machines Corporation | Secure management of keys using control vectors |
US5224163A (en) | 1990-09-28 | 1993-06-29 | Digital Equipment Corporation | Method for delegating authorization from one entity to another through the use of session encryption keys |
US5270712A (en) * | 1992-04-02 | 1993-12-14 | International Business Machines Corporation | Sort order preserving method for data storage compression |
US5432852A (en) | 1993-09-29 | 1995-07-11 | Leighton; Frank T. | Large provably fast and secure digital signature schemes based on secure hash functions |
US5434919A (en) | 1994-01-11 | 1995-07-18 | Chaum; David | Compact endorsement signature systems |
US5717758A (en) | 1995-11-02 | 1998-02-10 | Micall; Silvio | Witness-based certificate revocation system |
US5717757A (en) | 1996-08-29 | 1998-02-10 | Micali; Silvio | Certificate issue lists |
US5758353A (en) * | 1995-12-01 | 1998-05-26 | Sand Technology Systems International, Inc. | Storage and retrieval of ordered sets of keys in a compact 0-complete tree |
US5793868A (en) | 1996-08-29 | 1998-08-11 | Micali; Silvio | Certificate revocation system |
US5841865A (en) | 1994-01-13 | 1998-11-24 | Certco Llc | Enhanced cryptographic system and method with key escrow feature |
US5903651A (en) | 1996-05-14 | 1999-05-11 | Valicert, Inc. | Apparatus and method for demonstrating and confirming the status of a digital certificates and other data |
US5905799A (en) | 1994-07-20 | 1999-05-18 | Bell Atlantic Network Services, Inc. | Programmed computer for identity verification, forming joint signatures and session key agreement in an RSA public cryptosystem |
US5960083A (en) | 1995-10-24 | 1999-09-28 | Micali; Silvio | Certificate revocation system |
US6097811A (en) | 1995-11-02 | 2000-08-01 | Micali; Silvio | Tree-based certificate revocation system |
US6125185A (en) | 1997-05-27 | 2000-09-26 | Cybercash, Inc. | System and method for encryption key generation |
US6212637B1 (en) | 1997-07-04 | 2001-04-03 | Nippon Telegraph And Telephone Corporation | Method and apparatus for en-bloc verification of plural digital signatures and recording medium with the method recorded thereon |
US6233341B1 (en) | 1998-05-19 | 2001-05-15 | Visto Corporation | System and method for installing and using a temporary certificate at a remote site |
-
2001
- 2001-12-04 US US10/004,126 patent/US7007040B1/en not_active Expired - Lifetime
Patent Citations (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4309569A (en) | 1979-09-05 | 1982-01-05 | The Board Of Trustees Of The Leland Stanford Junior University | Method of providing digital signatures |
US4771459A (en) | 1985-04-29 | 1988-09-13 | U.S. Philips Corp. | System for storing and distributing keys for cryptographically protected communication |
US4771461A (en) | 1986-06-27 | 1988-09-13 | International Business Machines Corporation | Initialization of cryptographic variables in an EFT/POS network with a large number of terminals |
US4912762A (en) | 1987-04-22 | 1990-03-27 | International Business Machines Corporation | Management of cryptographic keys |
US4941176A (en) | 1988-08-11 | 1990-07-10 | International Business Machines Corporation | Secure management of keys using control vectors |
US5224163A (en) | 1990-09-28 | 1993-06-29 | Digital Equipment Corporation | Method for delegating authorization from one entity to another through the use of session encryption keys |
US5270712A (en) * | 1992-04-02 | 1993-12-14 | International Business Machines Corporation | Sort order preserving method for data storage compression |
US5432852A (en) | 1993-09-29 | 1995-07-11 | Leighton; Frank T. | Large provably fast and secure digital signature schemes based on secure hash functions |
US5434919A (en) | 1994-01-11 | 1995-07-18 | Chaum; David | Compact endorsement signature systems |
US5841865A (en) | 1994-01-13 | 1998-11-24 | Certco Llc | Enhanced cryptographic system and method with key escrow feature |
US5905799A (en) | 1994-07-20 | 1999-05-18 | Bell Atlantic Network Services, Inc. | Programmed computer for identity verification, forming joint signatures and session key agreement in an RSA public cryptosystem |
US5960083A (en) | 1995-10-24 | 1999-09-28 | Micali; Silvio | Certificate revocation system |
US5717758A (en) | 1995-11-02 | 1998-02-10 | Micall; Silvio | Witness-based certificate revocation system |
US6097811A (en) | 1995-11-02 | 2000-08-01 | Micali; Silvio | Tree-based certificate revocation system |
US5758353A (en) * | 1995-12-01 | 1998-05-26 | Sand Technology Systems International, Inc. | Storage and retrieval of ordered sets of keys in a compact 0-complete tree |
US5903651A (en) | 1996-05-14 | 1999-05-11 | Valicert, Inc. | Apparatus and method for demonstrating and confirming the status of a digital certificates and other data |
US5793868A (en) | 1996-08-29 | 1998-08-11 | Micali; Silvio | Certificate revocation system |
US5717757A (en) | 1996-08-29 | 1998-02-10 | Micali; Silvio | Certificate issue lists |
US6125185A (en) | 1997-05-27 | 2000-09-26 | Cybercash, Inc. | System and method for encryption key generation |
US6212637B1 (en) | 1997-07-04 | 2001-04-03 | Nippon Telegraph And Telephone Corporation | Method and apparatus for en-bloc verification of plural digital signatures and recording medium with the method recorded thereon |
US6233341B1 (en) | 1998-05-19 | 2001-05-15 | Visto Corporation | System and method for installing and using a temporary certificate at a remote site |
Non-Patent Citations (8)
Title |
---|
Bob Briscoe & Ian Fairman, "Nark: Receiver-Based Multicast Non-Repudiation And Key Management", BT Research, Ipswich, England, (rbriscoe/ifairman)@jungle.bt.co.uk. |
D. Wallner, E. Harder, R. Agee, National Security Agency, "Key Management For Multicast: Issues And Architectures", (C)The Internet Society, Jun. 1999. |
Dalit Naor, Moni Naor & Jeff Lotspiech, "Revocation And Tracing Schemes For Stateless Receivers", Advances In Cyptology-CRYPTO 2001, 21<SUP>st </SUP>Annual International Cyptology Conference, Santa Barbara, CA, Aug. 19-23, 2001 Proceedings. |
Dalit Naor, Moni Naor & Jeff Lotspiech, "Revocation And Tracing Schemes For Stateless Receivers", IBM Almaden Research Center and Department of Computer Science and Applied Math, Weizmann Instutute, Feb. 24, 2001. |
Dalit Naor, Moni Naor & Jeff Lotspiech, "Revocation And Tracing Schemes For Stateless Receivers", IBM Almaden Research Center, San Jose, CA and Department of Computer Science and Applied Math, Weizmann Instutute, Rehovot, Israel, Jul., 2001. |
David A. McGrew & Alan T. Sherman, "Key Establishment In Large Dynamic Groups Using One-Way Function Trees", Cryptographic Technologies Group, Glenwood, MD, May 20, 1998. |
Jacques Stern, "Advances In Cryptology-EUROCRYPT '99", International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999 Proceedings. |
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor & Benny Pinkas, "Multicast Security, A Taxonomy And Some Efficient Constructions", Secure Multicast Group (SmuG), (C)1999 iEEE. |
Cited By (30)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050220304A1 (en) * | 2002-06-17 | 2005-10-06 | Koninklijke Philips Electronics N.V. | Method for authentication between devices |
US8032127B2 (en) * | 2002-07-12 | 2011-10-04 | Nokia Corporation | Announcing information service through broadcasting or multicasting |
US20100105314A1 (en) * | 2002-07-12 | 2010-04-29 | Nokia Corporation | Announcing information service through broadcasting or multicasting |
US7546380B2 (en) * | 2002-10-28 | 2009-06-09 | Cisco Technology, Inc. | RPF multi-party reliable transport |
US20080077710A1 (en) * | 2002-10-28 | 2008-03-27 | Cisco Technology, Inc. | RPF multi-party reliable transport |
US20050220054A1 (en) * | 2002-11-26 | 2005-10-06 | Robert Meier | Wireless local area network context control protocol |
US7561549B2 (en) * | 2002-11-26 | 2009-07-14 | Cisco Technology, Inc. | Wireless local area network context control protocol |
US7664125B1 (en) * | 2006-01-03 | 2010-02-16 | Emc Corporation | Indication forwarding in a distributed environment |
US20080118068A1 (en) * | 2006-11-16 | 2008-05-22 | Samsung Electronics Co., Ltd. | Method and apparatus for local domain management using device with local authority module |
US8270614B2 (en) | 2006-11-16 | 2012-09-18 | Samsung Electronics Co., Ltd. | Method of updating group key and group key update device using the same |
CN101636964B (en) * | 2007-01-17 | 2012-12-12 | 松下电器产业株式会社 | Systems and methods for distributing updates for a key at a maximum rekey rate |
US20080170692A1 (en) * | 2007-01-17 | 2008-07-17 | Matsushita Electric Works, Ltd. | Systems and methods for distributing updates for a key at a maximum rekey rate |
US8059819B2 (en) * | 2007-01-17 | 2011-11-15 | Panasonic Electric Works Co., Ltd. | Systems and methods for distributing updates for a key at a maximum rekey rate |
US20080273474A1 (en) * | 2007-03-30 | 2008-11-06 | Brother Kogyo Kabushiki Kaisha | Network system, information processor, and information processing program recording medium |
US7970935B2 (en) * | 2007-03-30 | 2011-06-28 | Brother Kogyo Kabushiki Kaisha | Network system, information processor, and information processing program recording medium |
US20090052449A1 (en) * | 2007-08-24 | 2009-02-26 | At&T Intellectual Property I, L.P. | Multicast with adaptive dual-state |
US8750168B2 (en) * | 2007-08-24 | 2014-06-10 | At&T Intellectual Property I, Lp | Methods and systems to store and forward multicast traffic |
US8064446B2 (en) * | 2007-08-24 | 2011-11-22 | At&T Intellectual Property I, L.P. | Multicast with adaptive dual-state |
US8295203B2 (en) * | 2007-08-24 | 2012-10-23 | At&T Intellectual Property I, L.P. | Methods and systems to store state used to forward multicast traffic |
US20090052448A1 (en) * | 2007-08-24 | 2009-02-26 | At&T Intellectual Property I, L.P. | Methods and systems to store state used to forward multicast traffic |
US20130044642A1 (en) * | 2007-08-24 | 2013-02-21 | At&T Intellectual Property I, Lp | Methods and systems to store and forward multicast traffic |
US8649377B2 (en) | 2007-08-24 | 2014-02-11 | At&T Intellectual Property I, Lp | Methods and systems to store state used to forward multicast traffic |
CN101296133B (en) * | 2008-06-24 | 2011-01-26 | 清华大学 | Speculation method for link packet loss rate |
US9212962B2 (en) | 2012-07-11 | 2015-12-15 | Robert Bosch Gmbh | Self-powered pressure sensor assembly |
US20140289512A1 (en) * | 2013-03-20 | 2014-09-25 | Industrial Technology Research Institute | Method for certificate generation and revocation with privacy preservation |
US9425967B2 (en) * | 2013-03-20 | 2016-08-23 | Industrial Technology Research Institute | Method for certificate generation and revocation with privacy preservation |
CN108063756A (en) * | 2017-11-21 | 2018-05-22 | 阿里巴巴集团控股有限公司 | A kind of key management method, device and equipment |
US10931651B2 (en) | 2017-11-21 | 2021-02-23 | Advanced New Technologies Co., Ltd. | Key management |
US20230177033A1 (en) * | 2021-12-06 | 2023-06-08 | Unisys Corporation | Method of building and appending data structures in a multi-host environment |
US11899640B2 (en) * | 2021-12-06 | 2024-02-13 | Unisys Corporation | Method of building and appending data structures in a multi-host environment |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7007040B1 (en) | Method and apparatus for storing and updating information in a multi-cast system | |
US8369527B2 (en) | Access control over multicast | |
EP1354443B1 (en) | Method for broadcast encryption | |
US7949135B2 (en) | Key distribution in systems for selective access to information | |
US5719938A (en) | Methods for providing secure access to shared information | |
US8077870B2 (en) | Cryptographic key split binder for use with tagged data elements | |
US7178021B1 (en) | Method and apparatus for using non-secure file servers for secure information storage | |
US7770023B2 (en) | Exclusive encryption | |
US7715565B2 (en) | Information-centric security | |
CN101938497B (en) | Multistage security file structure as well as file access control and secret key management user terminal, service terminal, system and method thereof | |
US20040054891A1 (en) | Secure encryption key distribution | |
US7450722B2 (en) | Subset difference method for multi-cast rekeying | |
BRPI0610402A2 (en) | method, receiver, and program product for key group generation | |
EP2547035A1 (en) | Tag generation method in broadcast encryption system | |
US20100054479A1 (en) | Drm key management system using multi-dimensional grouping techniques | |
KR100640058B1 (en) | Method of managing a key of user for broadcast encryption | |
US20100174899A1 (en) | Data distribution system, key management device, and key management method | |
CA2446364C (en) | Secure group secret distribution | |
Mahmoud et al. | Encryption based on multilevel security for relational database EBMSR | |
KR101146510B1 (en) | System for encrypting synchronization database and method therefor | |
US8594334B2 (en) | Key management method | |
EP1875660B1 (en) | Tag generation method in broadcast encryption system | |
JP2002300149A (en) | Key management system for broadcast distribution | |
CN116009854A (en) | Data encryption and decryption processing method and encryption and decryption tool | |
Patil et al. | ON THE SECURITY OF COMBINATORIAL DESIGN BASED GROUP KEY MANAGEMENT SCHEME. |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: GENERAL DYNAMICS COMMUNICATIONS SYSTEMS, MARYLAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DUKE, ANDREW;STEPHENS, GEORGE;REEL/FRAME:012490/0042 Effective date: 20011119 |
|
AS | Assignment |
Owner name: GENERAL DYNAMICS GOVERNMENT SYSTEMS CORPORATION, M Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DUKE, ANDREW;STEPHENS, GEORGE;REEL/FRAME:013206/0006 Effective date: 20020813 |
|
AS | Assignment |
Owner name: GENERAL DYNAMICS C4 SYSTEMS, INC., MASSACHUSETTS Free format text: CONTRIBUTION AGREEMENT;ASSIGNOR:GENERAL DYNAMICS GOVERNMENT SYSTEMS CORPORATION;REEL/FRAME:016923/0102 Effective date: 20030101 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553) Year of fee payment: 12 |