Hybrid broadcast encryption method

Abstract

A hybrid broadcast encryption method is provided. The hybrid broadcast encryption method includes setting initialization values, generating a node secret using the initialization values; generating a private secret using the node secret; sending the node secret and the private secret; generating a broadcast message based on a revoked group; encrypting a session key using a key encryption key (KEK) which is allocated to every user group and the broadcast message; and broadcasting to every user the encrypted session key and the broadcast message.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS[0001]This application claims priority from Korean Patent Application No. 2005-09820, filed on Feb. 3, 2005, the entire contents of which are incorporated herein by reference.BACKGROUND OF THE INVENTION[0002]1. Field of the Invention:[0003]Methods consistent with the present invention relate to a broadcast encryption (BE) method, and more particularly, to a hybrid broadcast encryption method using Rivest-Shamir-Adleman (RSA) calculations, combinations, and tree structures together.[0004]2. Description of the Related Art:[0005]In general, encryption systems are classified into a symmetric key (or referred to as a secret key) encryption system and an asymmetric key (or referred to as a public key) encryption system depending on encryption-key management schemes. The symmetric key encryption system is the encryption system that was mainly used before the public key encryption system emerged, which is the system using the same key for encryptions a...

AI Technical Summary

Benefits of technology

[0043]An aspect of the present invention is to provide a hybrid broadcast encryption method which is secure against collusion attacks, capable of reducing the overhead of transmissions and calculations, and provided with risk distribution functions, compared to the existing Fiat method.

Problems solved by technology

Thus, the receiver has to exchange keys safely prior to the encrypted communications, and a third party who attempts to look at the encrypted communications cannot read the original message without the keys that the sender and receiver have used.

However, problems in key managements and exchanges can occur since, if encrypted communications are intended with lots of parties, the number of keys to be managed accordingly increases.

Therefore, one issue in the broadcast system is the method of producing a certain group key in order for only the privileged users 130 to decrypt the encrypted broadcast message.

However, the calculation is practically impossible due to a problem of ‘difficult prime factorization of N’.

However, the above Fiat algorithm causes a serious security problem when two users, for example, usr1, and usr2, share the secret information with each other.

On the other hand, Fiat proposes a k-resilient system based on the 1-resilient system, but the k-resilient system has a problem of high inefficiency.

However, the method needs a relatively long message, relatively many keys stored in a receiver, and more decryption operations than one by each receiver.

Further, the method does not take a stateless receiver scenario into consideration.

On the other hand, the other systems like the Fiat system do not provide the stateless receiver scenario, so that the other systems cannot be effectively applied to the protection of content on recording media.

Images