This paper investigates the synthesis of distributed algorithms to solve a class of convex games. We first propose a distributed algorithm which enables abstract decision-makers and dynamically coupled linear physical systems to asymptotically identify a Nash equilibrium. By using secure multiparty computation, we then propose a distributed information-theoretically secure algorithm such that the convergence property is maintained and simultaneously the exchanged data of a decision-maker is kept private from semi-honest decision-makers.