This document proposes a technique for fast phrase search on encrypted documents stored in the cloud. It presents a phrase search method based on Bloom filters that is faster than existing solutions, with similar or lower storage and communication costs. The technique uses a series of n-gram filters to support phrase searching functionality. It exhibits a tradeoff between storage size and false positive rate, and can defend against inclusion-relation attacks. The design approach is adaptable based on an application's target false positive rate. The system aims to provide secure and efficient phrase search on encrypted documents outsourced to cloud storage.