Although 'quantum contextuality' is one of the most fundamental non-classical feature, its generic role in information processing and computation is an open quest. In this article, we present a family of distributed computing tasks pertaining to every logical proof of Kochen-Specker (KS) contextuality in two different one-way communication scenarios: (I) communication of bounded dimensional system, (II) communication of unbounded dimensional system while keeping certain information oblivious, namely, oblivious communication (OC). As the later remains largely unexplored, we introduce a general framework for OC tasks and provide a methodology for obtaining an upper bound on the success of OC tasks in classical communication. We show that quantum communication comprised of every KS set of vectors outperforms classical communication and perfectly accomplish the task in both the aforementioned scenarios. We explicitly discuss the communication tasks pertaining to the simplest state independent contextuality sets of dimension three and four. Our results establish an operational significance to single system contextuality and open up the possibility of semi-device independent quantum information processing based on that. Alongside, we identify any advantage in OC tasks as a witness of preparation contextuality. communicated system (classical or quantum) is restricted to certain value, and (II) oblivious communication (OC) upon the constraint that certain information about the sender's input is unrevealed in communication. As the later remains largely unexplored, we provide a method to obtain optimal bounds on the success probability of OC tasks in classical communication. Moving to the central part of the article we introduce a family of oneway communication tasks, which we refer to as vertex equality problem, based on the orthogonal graphs of vector sets with SIC property. We show that quantum communication comprised of every KS set of vectors outperforms classical communication in both the aforementioned scenarios. While the result holds for any SIC proof involving rank-one projectors in the former scenario, we extend this result for the simplest SIC proof in the later scenario. Significantly, OC does not impose any restriction on the dimension of the communicated system. This implies that even unbounded classical resource cannot reproduce quantum contextual statistics satisfying certain oblivious conditions. We explicitly derive the optimal classical strategies for the vertex equality problem pertaining to Cabello-Estebaranz-GarciaAlcaine (CEG-18) [26] and Yu-Oh (YO-13) [6] vector sets. Nevertheless, we provide the analytical expression of the optimal success probability in classical communication, applicable to a general vertex equality problem. We also study the robustness of quantum communication advantage with respect to white noise and discuss the applicability of quantum contextuality in semi-device independent information processing [27,28]. Besides, we generalize the observation made in [13] that preparation ...