Public key encryption for groups
A system is comprised of a user and a group, wherein the group is comprised of a group leader and a group of M members where M is equal to or greater than one. The group leader generates a group public key and a group leader “master” private key. The group leader creates a personalized watermarked or decryption key, also referred to as an individual private key, for each group member. The individual private key uniquely identifies each group member. The group leader distributes the individual private keys to each of the group members. Each group member receives from a user a message encrypted using the group public key. Each of the group members uses its individual private key to decrypt the encrypted message sent by the user to the group.
1. A method for public key encryption for groups, the method comprising:
generating a group public key and a group leader private key by a group leader of a group having at least one group member.,
creating an individual private key for each group member by the group leader,
distributing the individual private key to each group member by the group leader,
receiving by the group from a user a message encrypted using the group public key wherein the message is encrypted using RSA asymmetric encryption, and
decrypting the encrypted message received by the group from the user by at least one group member using its individual private key, independently of the other group members,
wherein the individual private key is created for each group member according to formula (5):
d i =d +HASH 32 ( d, N, e , ID i , Z )φ( N ) (5)
wherein
d i is the individual private key for group member i where i equals 1 to M,
M is the number of members in the group,
d is a private exponent,
e is a public exponent,
p is a prime number,
q is a prime number,
ID i , is the identification for group member i,
Z is a data string that is shared among all group members,
N =p·q, and
φ(N) is =(p−1 )(q−1 ).
2. The method according to claim 1 , wherein the message is decrypted using asymmetric decryption.
3. The method according to claim 2 , wherein the asymmetric decryption is selected from the group consisting of RSA, Rabin, variants of RSA, and variants of Rabin.
4. The method according to claim 3 , wherein the asymmetric decryption is RSA.
5. A method for public key encryption for groups, the method comprising:
generating a group public key and a group leader private key by a group leader of a group having at least one group member,
creating an individual private key for each group member by the group leader,
distributing the individual private key to each group member by the group leader,
receiving by the group from a user a message encrypted using the group public key, and
decrypting using RSA asymmetric decryption the encrypted message received by the group from the user by at least one group member using its individual private key, independently of the other group members,
wherein the individual private key is decrypted by the group member according to formula (9 ):
T=C di mod N (9 )
wherein
T is the unencrypted message,
C is the encrypted message,
d i is the individual private key for group member i where i equals 1 to M,
M is the number of members in the group,
p is a prime number,
q is a prime number, and
N =p·q.