The research network has lately seen a surge in interest in distributed computing due to its many advantages; nevertheless, this trend has also brought up concerns about privacy and security. The availability and storage space for sensitive information has been a major issue for the zone. In particular, several researchers combed through encrypted files kept on remote servers in the cloud for answers. There have been a number of approaches to conjunctive catch-all searches, but less research into targeted system searches. With storage and communication costs that are either equal to or better than prior arrangements, we demonstrate a Bloom-based expression search procedure in this study that is much quicker. Using a succession of n-gram channels, our strategy enhances the utility. The approach is flexible enough to withstand consideration connection assaults, and it shows a trade-off between capacity and false positive rate. Also shown is a structural approach that take