A certified dominating set is a refinement of the classical dominating set in graph theory, introduced to ensure that each dominating vertex dominates at least two vertices outside the set. This paper studies the derivation and properties of certified dominating sets in bipartite graphs. We present definitions, theoretical results, illustrative examples, and discuss bounds and applications.