31 reputation
2
bio website
location
age
visits member for 2 years, 5 months
seen Apr 16 '12 at 15:57

Apr
16
comment Is it possible to build an unfair noisy channel from 1 out of 2 oblivious transfer
yes 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..
Apr
15
comment Is it possible to build an unfair noisy channel from 1 out of 2 oblivious transfer
Malicious 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.
Apr
15
comment Is it possible to build an unfair noisy channel from 1 out of 2 oblivious transfer
Hi thanks for your comment. The objective of this kind of channel is that sender does not know what value that receiver receives and receiver does not know what value that sender sends. Regarding to Ilmari's post, receiver knows the value which sender sends so it is not a secure one...
Apr
14
asked Is it possible to build an unfair noisy channel from 1 out of 2 oblivious transfer
Feb
28
awarded  Scholar
Feb
28
accepted How to construct a zero-knowledge proof of a number of the form $n=p^a q^b$
Feb
28
comment How to construct a zero-knowledge proof of a number of the form $n=p^a q^b$
oh yes now all pieces are put together... Thanks!
Feb
28
comment 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?
Feb
28
comment How to construct a zero-knowledge proof of a number of the form $n=p^a q^b$
Thanks for your help very much. But at your 3rd point I am a bit confused about the role of provider. Is it actually verifier that randomly picks a series of $x$'s? But if that is the case and we reply that "not a QR" or "it's a QR" then it won't be zero knowledge right?
Feb
27
awarded  Student
Feb
27
asked How to construct a zero-knowledge proof of a number of the form $n=p^a q^b$