Signcryption 是一条很快新兴的有效途径完成真实性;在逻辑单身者步以内的机密。然而,认识到 signcryption 的公共可证实性在仍然是一个困难的问题一有效;安全方法。这里,我们在场基于二次的残余认识到公共可证实性的一个通用答案。
Signcryption has been a rapidly emerging efficient approach to achieve authenticity and confidentiality within a logic single step. However, it is still a difficult problem to realize public verifiability of signcryption in an efficient and secure way. Here, we present a generic solution to realize public verifiability based on quadratic residue.