Anonymous Subliminal Channel Scheme Based on (t,n) Threshold Cryptosystem
Yupu Hu · Jisuanji gongcheng · 2007
Security threats and system weakness of present subliminal channel schemes are analyzed. Combining Shamir Lagrange interpolation formula based secret-sharing scheme and subliminal channel, a threshold subliminal channel scheme with conditional anonymity based on (t, n) threshold cryptosystem is presented. The threshold secret-sharing of the scheme enables the subliminal message to be recoverable only by no less than t members of the n receivers, and the secret piece of each member can remain valid and secure after subliminal message recovering, so the scheme achieves multi-secret sharing. The probabilistic encryption algorithm and identity blinding make the subliminal message sender indistinguishable with other ordinary signers for secrecy protection, and the anonymity can also be conveniently revoked if necessary. The scheme prevents coalition attack and generalized signature forgery, avoids the misuse of subliminal message producing and recovering. Further detailed analyses also justify its brevity, security, high efficiency, and thus considerable improvement on system overheads regarding software and hardware application.