A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the ciphertext of a message. It is constructed using bi-linear pairings. Its security is based on the intractability of the computational bilinear Diffie-Hellman problem. The scheme possesses chosen-plaintext security in the random oracle model.