The security of publick-key cryptographic protocols are reduced to the infeasibility of underlying mathematical problems. More cryptographic protocols have been designed, more new mathematical problems have been introduced. Especially in paring-based protocols, a various problems related to the Diffie-Hellman problem (Diffie-Hellman related problems) have been used. Compared to the fundamental mathematical problems such as the integer factoring problem or the discrete logarithm problem, the infeasibility of these newly introduced problems are not fully evaluated yet. In 2006, Cheon proposed an algorithm to solve the discrete logarithm problem with auxiliary input (DLPwAI), however, since the problem is tightly related to the Diffie-Hellman related problems, Cheon's algorithm also solves Diffie-Hellman related problems. This manuscript discusses the relation between the security of cryptographic protocols based on Diffie-Hellman related problems and Cheon's algorithm.