The paper proposes a Multi-Authority Attribute-Based Encryption (ABE) system where any party can become an authority without requiring global coordination beyond the creation of initial common reference parameters. Users can encrypt data using boolean formulas over attributes from any chosen set of authorities, and the system does not rely on a central authority. The main technical challenge is making the system collusion-resistant, which is achieved by tying key components together using a hash function on the user's global identifier. The security of the system is proven using the dual system encryption methodology, following a variant of the technique by Lewko and Waters, and building on bilinear groups of composite order. The proof involves converting challenge ciphertexts and private keys to a semi-functional form and then arguing security. The system avoids the performance bottleneck and absolute trust in a central authority, making it more scalable and robust.The paper proposes a Multi-Authority Attribute-Based Encryption (ABE) system where any party can become an authority without requiring global coordination beyond the creation of initial common reference parameters. Users can encrypt data using boolean formulas over attributes from any chosen set of authorities, and the system does not rely on a central authority. The main technical challenge is making the system collusion-resistant, which is achieved by tying key components together using a hash function on the user's global identifier. The security of the system is proven using the dual system encryption methodology, following a variant of the technique by Lewko and Waters, and building on bilinear groups of composite order. The proof involves converting challenge ciphertexts and private keys to a semi-functional form and then arguing security. The system avoids the performance bottleneck and absolute trust in a central authority, making it more scalable and robust.