We study Nash implementation of the bargaining solutions in a cake sharing set up. We argue that the minimal Pareto optimal, symmetric and Nash implementable SBS is the one inducing all Pareto optimal and midpoint-dominating utility vectors in each state.