Friend based Ad-hoc routing using Challenges to Establish Security (FACES) is an algorithm to provide secure routing in ad-hoc mobile networks. The scheme proposed has been drawn from a network of friends in real life scenarios. The algorithm is divided into four stages, viz. Challenge your neighbour, Rate Friends, Share Friends and Route through Friends. One of the major advantages of this scheme is that the nodes do not need to promiscuously listen to the traffic passing through their neighbours. The information about the malicious nodes is gathered effectively by using Challenges, which reduces the overhead on networks. As a result of this scheme of operation, the network is able to effectively isolate the malicious nodes which are left with no role to play in the ad-hoc network. One major benefit of this scheme is that the nodes do not need to promiscuously listen to the traffic passing through their neighbours. The information about the malicious nodes is gathered effectively by using Challenges. This reduces the overhead on the network significantly. Through extensive simulation analysis it was inferred that this scheme provides an efficient approach towards security and easier detection of malicious nodes in the mobile ad-hoc network.