Based　on　the　intractable　problem　of　discrete　logarithm　in　ECC　and　the　intractability　of　reversing　a　one-way　hash　function,　this　paper　presents　a　signcryption　scheme　with　public　verifiability　and　forward　security.　In　the　process　of　security　proof,　the　unforgeability　ensures　that　the　attacker　can’t　create　a　valid　ciphertext.　We　verify　the　cipher　text　instead　of　the　plain　text　in　verification　phase.　We　protect　the　plain　text　which　makes　the　proposed　scheme　confidential.　Thus,　the　proposed　scheme　has　the　property　of　public　verification.　And　the　scheme　ensures　that　if　the　sender’s　private　key　is　compromised,　but　the　attacker　can’t　recover　original　message　from　cipher　text　By　the　performance　analysis,　our　proposed　scheme　mainly　uses　the　model　multiplication.　Compared　with　Zhou　scheme,　the　number　of　model　multiplication　has　lost　one　time　in　signcryption　phase,　which　leads　to　the　significant　increase　in　calculation　rate.　Moreover,　the　signature　length　has　lost　compared　with　Zhou　scheme.　In　other　words,　the　minimum　value　of　complexity　is　reached　in　theory.　This　makes　the　scheme　have　higher　security　and　wider　applications.　©　2019,　ICST　Institute　for　Computer　Sciences,　Social　Informatics　and　Telecommunications　Engineering.