In　this　paper　we　mainly　focus　on　the　fraud　problem　among　the　players　and　the　shortcomings　of　multisecret　sharing　existed　in　rational　secret　sharing　schemes.　Based　on　the　exited　schemes　and　the　related　knowledge　such　as　bit　commitment　agreement,　we　proposed　a　new　rational　multi-secret　sharing　scheme　that　has　high　security.　In　our　scheme,　we　take　an　identity　authentication　for　the　dealer　in　distribution　phase.　Players　can　verify　the　correctness　of　the　identity　of　the　dealer.　In　this　way,　it　is　feasible　to　prevent　the　forger　from　cheating.　Based　on　the　discrete　logarithm　problem,　the　player　can　also　verify　the　correctness　of　the　secret　share.　At　the　same　time　the　secret　shares　are　divided　into　groups　so　that　the　distribution　phase　is　well　designed　for　the　multi-secret　sharing.　Additional　the　game　theory　model　is　also　adopted　to　realize　the　rational　multi　secret　sharing.　The　Execution　efficiency,　security　and　the　feasibility　has　been　remarkably　improved　in　this　our　scheme　compared　with　the　traditional　secret　sharing　schemes.　©　2012　ACADEMY　PUBLISHER.