The matter of sharing unique individual genomic grouping courses of action without giving the security of their data to help vast scale biomedical research ventures. Regardless, extends the results in different types. This approach is demonstrated powerful in keeping up the protection requirement against antagonistic server. We present a cryptographic security for questions that permits playing out most widely recognized DNA based personality. The limit is more affordable than figuring in current dispersed registering assessing plans. This point is spurred by the way that capacity is less expensive than calculation in current distributed computing evaluating plans. In addition, encoding the information makes it workable for us to deal with more extravagant arrangement of the inquiries the coordinating between the inquiry and grouping of the database, including: (1) A certain is the quantity that matches between question images and a succession; (2) Consistent OR matches where a question image is permitted to coordinate a subset of the letters in order along these lines making it conceivable to deal with (as an uncommon case) a "not equivalent to" necessity for an inquiry image ("not a G"); (3) Bolster for the expanded letter set of nucleotide base codes that envelops ambiguities in DNA groupings; (4) Inquiries that determine the quantity of events of every sort of image in the predetermined arrangement positions. (5) A begin question whose answer is "yes" if the quantity of matches surpasses a question indicated edge. (6) All inquiry composes we can conceal appropriate responses from the unscrambling server, with the goal that just the customer takes in the appropriate response. (7) The customer deterministically adapts just the question's answer, with the exception of inquiry compose (v) where we measure the (simple little) factual spillage to customer of real check.