LizaMoly
asked on
One file encryption, multiple user decryption?
I need a system such that a given message can be encrypted once and every member of the recipient group can decrypt it independently of all others. This will work for a broadcast scheme.
ASKER
I mean, the distribution will be for a subset of users "n" from main group "N". Each time the subset "n" changed, no one out of "n" can decrypt the file.
ASKER
Dear ozo , what you mentioned is secret sharing scheme or secret splitting like Shamir's secret sharing. These schemes need the users to corporate to reconstruct the secret. But in my situation no communication between the subset users accrue after cipher broadcast. This is an offline file sharing.
Maybe we are misunderstanding the question. Can you clarify how your situation differs from trivial (1,n) secret sharing?
ASKER
My situation is that i have N group of users can share secret once "the first time",then the it turned to offline. One user needs to encrypt message for (n,N) users. The other users have no right to read that message, just the subset n. No cob-oration between those n users done to reconstruct the key. Each should be able to decrypt the message.
Note: in threshold schemes users must cob-orate for constructing the key, in my situation this not allowed due to offline communication.
Note: in threshold schemes users must cob-orate for constructing the key, in my situation this not allowed due to offline communication.
Can you clarify why is this not solved by the trivial (1,n) secret sharing method of giving a password to the subset of n users?
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Alternatively you could set up a key exchange system but that would be a lot more work.