1,083 reputation
614
bio website
location
age
visits member for 2 years, 8 months
seen 4 hours ago

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
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
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
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
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.
Dec
16
comment Advantages of bilinear map
Maybe i should rephrase: "The first use of pairing that we know is not for construction of cryptographic primitives but to break some hard assumptions as the DL in specific groups"
Dec
7
comment How do I calculate the private key in RSA?
These are standard techniques you can find in all books.We say the same thing.In order to compute the inverse you can use the extended euclidean algorithm
Dec
6
comment Why the following attack in common modulus RSA works?
You said that even if we do not know $\lambda(N)$ we can learn $k \lambda(N)$ which is true. But then how you apply the $mod(\lambda(N))$ operation?
Dec
5
comment Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
sorry i assume there are always positive.
Dec
5
comment Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
I assume that x,y are always smaller than the modulo
Dec
5
comment Modulus for elliptic curve point multiplication
@CodesInChaos I thought we always think for polynomial interpretations in finite fields (?)
Dec
3
comment Graphically representing points on Elliptic Curve over finite field
What does this mean?
Dec
3
comment Graphically representing points on Elliptic Curve over finite field
side question: How can you find a base point of a curve?Or because the underlying field is of prime order so all the points of the curve they do form a basis?
Nov
29
comment Mapping between subgroups and the integers
Can you elaborate more on the security reasons that we do not use all elements in $\mathbb{Z}_p^*$ but only a subset of them?
Nov
28
comment Homomorphic Encryption and Semantic Security using Lattices?
@DrLecter " If you look at the definition of the homomorphic addition (multiplication) you see that they use ciphertexts with respect to independently chosen $a$ and $a′$ for encryption of message $m$ and $m′$ ": different a->different keys
Nov
28
comment Homomorphic Encryption and Semantic Security using Lattices?
I cannot understand the purpose of the noise $e$ since it can be recovered applying $\mod{2}$ to the ciphertext by everyone
Nov
28
comment Homomorphic Encryption and Semantic Security using Lattices?
@DrLecter you mean that their breakthrough is that even you encrypt with different keys $k_1$ $k_2$ two plaintexts $p_1$, $p_2$ you can evaluate homomorphically an operation in their ciphertext space? But with which key you can decrypt it?
Nov
23
comment ElGamal: Multiplicative cyclic group and key generation
You mean that $q$ should be a safe prime of the form $q=2k+1$ where $k$ is also a prime? Because in your writing you substitute $k$ with $p$ where $p$ is the prime of the initial group.Which is like a 'loop'.