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.
Who is Participating?

[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More

I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Russ SuterSenior Software DeveloperCommented:
You could use RSA encryption. Encrypt the file using a private key then make sure you only distribute the public key to the members you want to be able to decrypt.

Alternatively you could set up a key exchange system but that would be a lot more work.
LizaMolyAuthor Commented:
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.
Rowby Goren Makes an Impact on Screen and Online

Learn about longtime user Rowby Goren and his great contributions to the site. We explore his method for posing questions that are likely to yield a solution, and take a look at how his career transformed from a Hollywood writer to a website entrepreneur.

LizaMolyAuthor Commented:
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?
LizaMolyAuthor Commented:
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.
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?
Dave HoweSoftware and Hardware EngineerCommented:
Sounds *exactly* like the problem the hybrid scheme of pgp (or gnupg) was designed to solve. encrypt the file *once* to a symmetric key, then append a block with the symmetric key encrypted to the public key(s) of the recipients. any recipient in the keyblock can decrypt the symmetric key, and hence the file.

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today

From novice to tech pro — start learning today.