Ciphertext-Policy Attribute-Based Searchable Encryption (CP-ABSE) is essential for fine-grained search authorization in multi-user data sharing, with notable practical application value. However, existing CP-ABSE schemes have prominent performance problems. Their encryption and search overhead rise linearly as the number of attributes increases, leading to obvious search latency. Furthermore, it is still difficult to balance the strong expressiveness of Linear Secret Sharing Scheme (LSSS) access structures with system scalability. This issue limits the large-scale practical deployment of those schemes. To solve these problems, this paper designs an efficient CP-ABSE scheme that retains LSSS-based fine-grained access control capability. This scheme simultaneously takes into account both attribute scale growth and performance degradation, and the computational efficiency gets better while ensuring access control expressiveness. The security proof shows that it can resist Chosen Keyword Attacks (CKA). Experimental results show that compared with existing schemes, our scheme reduces the cost of key generation by 40%–50%, encryption by 25%–40%, trapdoor generation by 50%–60%, and search operation by 30%–45%. In addition, its performance overhead grows more slowly with the increase of attributes, and the search latency remains stable. These advantages confirm its good scalability and high practicability in large-scale user data sharing scenarios.