A generic solution to realize public verifiability of signcryption

Chaos Based Direct Public Verifiable Signcryption Scheme

“…Quadratic residue: Let N be an integer, and Z n + = {k € Z n │ (k,N)=1 }, a € Z n + is said to be quadratic residue modulo N, if there exist an x € Z n + such that x 2 ≡ a mod N. It is infeasible to compute x from x 2 ≡ a mod N. if modulo N cannot be factorised [17].…”

“…Hence, Bao-Deng's scheme [18] evidently violates the rule of confidentiality. In order to achieve the public verifiability , In 2006 LEI Feiyu , CHEN Wen , CHEN Kefei [17] analyzed the structure of signcryption and develop a generic solution based on quadratic residue. And the proposed solution is shown to be straightforward and efficient.…”