RSA SIGNATURE SCHEMES WITH SUBLIMINAL-FREE PUBLIC KEY

The problem of subliminal channels in the signatures was already studied in the previous literature. In this paper we focus on the problem of subliminal communication through the public verification key. We show a construction which derives a subliminal-free RSA public key. Along the construction we use a computationally binding and unconditionally hiding commitment scheme. To establish a subliminal free RSA modulus n, we have to construct the secret primes p and q. To prove p and q are primes we use Lehmann's primality test on the commitments. We show our "public key subliminal free" signature scheme is indistinguishable from "regular" RSA signature schemes. When we combine our key generation with the existing subliminal free RSA-PSS signature scheme then we get a signature scheme which is subliminal free in the sense of public key and signature.