225 reputation
28
bio website
location
age
visits member for 1 year, 9 months
seen Sep 26 '12 at 5:40
stats profile views 19

Jan
31
awarded  Notable Question
Sep
23
awarded  Yearling
Sep
6
awarded  Nice Question
May
16
awarded  Popular Question
Dec
10
accepted Is the following statement about PRG true or false?
Nov
2
comment Randomized Oblivious Transfer
Thanks, phocho, so if I do the modification for random OT as following:Alice gets random bits $(S_A, P_A)$ and Bob gets random bits $(S_B, P_B)$ with one condition that is $S_A+S_B=P_A P_B$, how should the protocol be modified to realize OT? I think with that condition $(S_A,P_A)$ and $(S_B,P_B)$ can be mapped into $(z_0,z_1)$ and $(c,z_c)$ one by one, but I couldn't really write the mapping out explicitly. Do you have any idea about that?
Nov
2
accepted Randomized Oblivious Transfer
Nov
2
asked Randomized Oblivious Transfer
Oct
23
accepted Why doesn't preimage resistance imply the second preimage resistance?
Oct
21
asked Why doesn't preimage resistance imply the second preimage resistance?
Oct
4
awarded  Benefactor
Oct
4
accepted SIM security for two messages
Oct
3
comment SIM security for two messages
Eve receives notification that a message was sent through the channel (but does not receive a ciphertext). (Here we assume that the messages come from a finite message space. Otherwise, Eve is notified the length of the message as well.) Eve continues to arbitrarily interact with the environment. The environment outputs a bit (whether Eve caused a particular observable effect on the environment). The adversary is said to "succeed" in the experiment if the environment outputs 1.
Oct
3
comment SIM security for two messages
Actually, the ideal world is defined as following: Ideal world experiment: Repeatedly do: The adversary Eve arbitrarily interacts with the environment. The environment sends a message m to Alice. Alice sends the message m to Bob through a secure channel.
Oct
2
awarded  Promoter
Oct
2
revised SIM security for two messages
added 97 characters in body
Oct
1
accepted Can a computationally unbounded adversary break any public-key encryption scheme?
Oct
1
awarded  Supporter
Oct
1
awarded  Scholar
Oct
1
accepted How long does it take to crack DES and AES?