11 Actions

Is it possible to build an unfair noisy channel from 1 out of 2 oblivious transferyes that's true... Sorry I didnt look at that quite carefully. But that's not a channel in fact and receiver does not receive anything. The key of the channel is that R receives something but R is not sure if that's right. S sends something but S can not be sure what is the output of the other end of the channel with respect to some probability..

Apr15

comment

Is it possible to build an unfair noisy channel from 1 out of 2 oblivious transferMalicious sender wants to control what bit that receiver receives and malicious receiver wants to learn the real b, but a secure noisy channel will prevent them doing so. So the answers to your first two questions are no. For the last question, hmm, I dont know why you need this step so I would say maybe... thanks for pointing that out.

How to construct a zero-knowledge proof of a number of the form $n=p^a q^b$Yes ZK for QR and QNR can be easily simulated but that is a bit wired to me in a sense that Verifier will not know which zero proof to use for a random x .. So you mean in the simulator verifier randomly picks a x and he tosses a coin. if coin = 0 then he uses simulator of ZK proof about x being QNR. and if coin = 1 he uses that for x being QR?