The current study is intended to present an in-depth analysis of literature relative to privacy preserving multi-keyword search over encrypted cloud data. The multi-keyword ranked search that the study proposes has the capacity to post the exact matching documents only. This paper essentially seeks to fill the perceived research gaps from previous studies in multi-keyword search in cloud computing. To be precise, the current paper considers three peer-reviewed research articles concerning multi-keyword search in cloud computing. As such, it analyses the methods, approaches and techniques that have been proposed in each of the three studies while presenting viewing these aspects in a critical limelight. The central problem focused by each of the three selected articles is keyword privacy. This draws from the fact that despite the capacity of perceived approaches to generate cryptic trapdoors which conceals keywords, there is a possibility that cloud service providers through statistical analysis can estimate the keywords. The second concern that has been discussed in these research articles is trapdoor un-linkability. This arises mostly from deterministic trapdoor generation functions which gives the cloud service provider an easy avenue of accumulating keyword frequency. Lastly, surveyed studies also reveal concerns relating to access patterns whereby although a many of encryption techniques can be deployed to conceal the access pattern, there remains efficiency concerns with such encryption.