【摘要】 基于分解困难性及离散对数问题,给出一个在Schnorr签名中构造潜信道的方案.方案中,被Schnorr签名所掩盖的潜信息的安全性依赖于分解困难性,签名的不可伪造性依赖于Schnorr签名的安全性.同时,潜信息的接收者伪造一个签名者有效的签名是困难的.更多还原

【Abstract】 Based on the factoring difficulty and discrete logarithm problem, a way to construct subliminal channel in the Schnorr signature scheme is proposed. In this scheme, the security of the subliminal message covered by the Schnorr signature depends on the factoring difficulty, and the security of the signature against forgery depends on the security of Schnorr signature. At the same time, it is hard for the subliminal receiver to forge a valid signature of the signer.更多还原