157 reputation
7
bio website
location
age
visits member for 9 months
seen Mar 19 at 11:46

Jan
27
awarded  Popular Question
Jul
8
comment Snowden Challenge II: Can we solve Snowden challenge quantumly?
Sure, there are two excellent answers and all comments are highly appreciated. But all of them are negative. They have not been accepted because I am waiting for possible positive answers. I think nothing is impossible. Even if current knowing cryptographic methods cannot solve this problem, we have no reason to exclude future possibility, say after 2050.
Jul
8
comment How to compute the attacker's probability?
Thanks for your excellent answer. Why do you think the approximate attack would succeed with higher probability? Would you like give me a detailed analysis?
Jul
6
comment Cryptographic Challenge: How to Say Something Confidentially to Snowden?
My suggestion does not contract to yours. After Maduro announced his public key to Snowden via public media, Snowden is still an non-verifiable endpoint. He should at first confidentially tell Maduro something (denoted by X). Suppose that X is a very privacy story that is known only to Snowden and his mother. Then, Maduro (in person) contacts Snowden's mother to verify it. If it is true, then k=SHA256(X) can be used as the session key between Snowden and Maduro and a bidirectional secure channel is built. Does this solve Snowden Challenge?
Jul
6
comment Snowden Challenge II: Can we solve Snowden challenge quantumly?
No! I think it is not a duplicated question. I think in quantum world, something would be much different. For example, what if one can build entangled status with Snowden? At present, I know it is difficult, but it is not impossible.
Jul
6
awarded  Nice Question
Jul
6
revised Snowden Challenge II: Can we solve Snowden challenge quantumly?
added 22 characters in body
Jul
6
asked Snowden Challenge II: Can we solve Snowden challenge quantumly?
Jul
6
comment Cryptographic Challenge: How to Say Something Confidentially to Snowden?
I agree with March Ray: We can use what we have -- media reports. For example, Maduro, the president of Venezuela, can now announce a RSA modulus N publicly so that N is very long, say 10000 digits. Now, everyone, including Snowden, can send messages confidentially to Maduro, say by using the identity-based encryption schemes Cocks01 and BGH07. The left problem is for Snowden to prove himself to Maduro based on this unidirectional secure channel. If so, then a bidirectional secure channel would be built. Is it possible?
Jul
6
revised How to compute the attacker's probability?
deleted 8 characters in body
Jul
6
asked How to compute the attacker's probability?
Jul
5
comment Cryptographic Challenge: How to Say Something Confidentially to Snowden?
Yes, you pin down the core of my question. I know that current knowing concepts of cryptography is insufficient for solving Snowden Chanllenge. I true meaning is to ask: Can we find some NEW CONCEPT or some NEW PRIMITIVES to solve this chanllenge.
Jul
4
revised Cryptographic Challenge: How to Say Something Confidentially to Snowden?
added 141 characters in body
Jul
4
awarded  Editor
Jul
4
awarded  Supporter
Jul
4
revised Cryptographic Challenge: How to Say Something Confidentially to Snowden?
improved formatting
Jul
4
comment Cryptographic Challenge: How to Say Something Confidentially to Snowden?
My meaning is that at the beginning, Snowden does not trust anyone. But after building such a secure channel, if possible, then you can confidentially prove you to Snowden that you are trustable.
Jul
4
awarded  Student
Jul
4
asked Cryptographic Challenge: How to Say Something Confidentially to Snowden?
Jul
3
awarded  Revival