1,254 reputation
717
bio website
location
age
visits member for 3 years
seen 6 mins ago

Jan
21
comment What does it mean that $BW_N$ is a permutation over the squares mod N?
Suppose that you have a set of numbers $S$ in a specific order.Then randomly rearranging the elements means that you permute the elements.Now in a trapdoor permutation you have a key. Once you know the key you can reinverse the set in its original form.Suppose i.e that i permute by shifting one element at my right.This is the key.Now in your case the trapdoor of the permutation is the integer factorization problem.
Jan
21
revised What does it mean that $BW_N$ is a permutation over the squares mod N?
added 137 characters in body
Jan
21
answered What does it mean that $BW_N$ is a permutation over the squares mod N?
Jan
18
comment How to ensure that a “received value” is not altered?
MAC considers a symmetric setting in which two clients have agreed on a secret key
Jan
18
answered How to ensure that a “received value” is not altered?
Jan
16
comment Where can I find source code for ideal world simulation?
People from theoritical cryptography would commit suicide if they ever discover code for simulation based security
Jan
15
comment How to understand the Bilinear mapping with an example
You don't need to prove. You need to evaluate its correctness, i guess
Jan
10
comment How to prove that a ciphertext is encrypting multiplication of two values?
What do you mean by generic proof argument? How i can convince that the non-DLP encrypted value lies in predefined range?I just make a huge assumption that the encrypted values is the witness for a proof that is submitted independent from the ciphertext?
Jan
8
accepted Are those two distributions indistinguishable?
Jan
6
comment Open source implementations of Symmetric Searchable Encryption and Order Preserving Encryption
We are waiting for the link :)
Dec
26
comment How to prove that a ciphertext is encrypting multiplication of two values?
Yes but what if you don't want to use DLP based public key encryption schemes?
Dec
25
revised How to prove that a ciphertext is encrypting multiplication of two values?
added 24 characters in body
Dec
25
revised How to prove that a ciphertext is encrypting multiplication of two values?
added 24 characters in body
Dec
25
asked How to prove that a ciphertext is encrypting multiplication of two values?
Dec
24
comment Difference between computational and statistical indistinguishabilities
Also statistical indistinguishability is stronger than computational indistinguishability as there is not restriction on the computational power. So it might be the case that a scheme preserves computational indistinguishability but not the statistical indistinguishability
Dec
19
comment Are those two distributions indistinguishable?
$f(x)$ is defined $mod N^2$ as well
Dec
19
revised Are those two distributions indistinguishable?
added 6 characters in body
Dec
19
comment Are those two distributions indistinguishable?
I don't understand your comment. you are given 1 number. Either in the first form or in the other form and you have to decide whether or not there exist a quadratic residue for this number.
Dec
19
asked Are those two distributions indistinguishable?
Dec
17
comment How does OAEP improve the security of RSA?
How the legal receiver gets rid of the pad if he doesn't know the $r$? It just spits the $#pad$ bytes? That implied a public knowledge of the pad length.