meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 6 months |
| seen | 6 hours ago | |
| stats | profile views | 9 |
|
Jan 29 |
comment |
What are the differences between proofs based on simulation and proofs based on games? Can you point out some "good" simulation based proofs where "X model the best that one could do"? Yes you clearly defined what i wanted to say in question 1 but question 2 contains some valuable info as well if it can be answered... |
|
Dec 20 |
comment |
Why the following attack in common modulus RSA works? and why $gcd(e_b,V)=1$ , according to your notation where $V=e_a \cdot d_a -1$ |
|
Dec 20 |
comment |
Why the following attack in common modulus RSA works? So why in every book, research paper, textbook, the requirement is $e \cdot d \equiv 1 \phi(N)$ and not $e \cdot d \equiv 1 \lambda(N)$ |
|
Dec 20 |
comment |
Why the following attack in common modulus RSA works? I don't understand the involvement of $\lambda(N) = lcm(p-1, q-1)$. As far as i know $e \cdot d \equiv 1 mod\phi(N)$ |
|
Dec 18 |
comment |
Is there any semantic difference between predicate encryption and functional encryption? Ok but you didn't answer to my question. Is there an obvious difference, a use case scenario whereby i cannot use PE in terms of functionality and security and i should use FE |
|
Dec 18 |
comment |
Is there any semantic difference between predicate encryption and functional encryption? It's better to point me the paper of the TCC. |
|
Dec 5 |
comment |
How to prove membership of a list without disclosing the list members? Yes you are correct. Another possibility would be to use modified bloom filters to support the security you want. This comes with a cost of false positive replies by the bloom filter for membership queries. fkerschbaum.org/dbsec11.pdf |
|
Nov 26 |
comment |
Looking for examples for “proof by reduction” I may run the danger to be a bit out of topic but this is an interesting approach on rigorous proofs by reductions usually employed by cryptographers. It criticizes the too much effort on proofs by reductions which sometimes doesn't take into account all the attacker's window and consequently "tends to kick dust to eyes" |
|
Nov 23 |
comment |
Mapping between subgroups and the integers Can you also explain why since $q$ is a big prime, it is odd, therefore $p = 3 \mod 4$ and that implies that $x$ is a quadratic residue? |
|
Nov 19 |
comment |
Does a break in a collision resistance property of a hash function by definition implies an attack at the first pre-image attack? @CodesInChaos break collision resistance means to find two messages m1,m2 which are not equal s.t: h(m1)=h(m2). Break first preimage resistance means break the one-wayness, recover m1 from h(m1) |
|
Nov 19 |
comment |
Using CBC with a fixed IV and a random first plaintext block That's why it is a comment and not an answer. Since you are using a source of randomness i can't see why not use it to produce the initial IV. In terms of efficiency this will increase linear the size of the ciphertext compared with the standard way |
|
Nov 19 |
comment |
Using CBC with a fixed IV and a random first plaintext block Why to do that?Is like CTR mode with 1 counting step, but in CTR the IV+the counter are encrypted with AES and this is XORed with the plaintext. If the IV is not random it must be unique, that's why we use a counter |
|
Nov 19 |
comment |
Is it safer to encrypt twice with RSA? @D.W. Is there a quantitative assessment in how large this partial plaintext recovering should be in order to be conjectured as CPA? |
|
Nov 16 |
comment |
Is it safer to encrypt twice with RSA? Does the fact that a tiny amount of information is discovered for the plaintext from the ciphertext violates the IND-CPA security? I am wondering as IND-CPA refers to fully recover the plaintext |
|
Nov 13 |
comment |
Is Convergent Encryption really secure? @PaŭloEbermann I will try to sum up my answer according to the article. It's a good motivation and exercise for me :) |
|
Oct 28 |
comment |
Subgroups generators with respect to group generators of composite order @PaŭloEbermann It's not a homework. I was trying to come up with something i was reading in a paper |
|
Oct 26 |
comment |
Why pairing based crypto is suitable for some particular cryptographic primitives? Can you give me an example of a degree-2 combination? I.e given $g^{x_1}, \ldots ,g^{x_n}$ as a consequence of bilinearity i can have $g^{x_1 \ldots x_2}$ ? |
|
Oct 25 |
comment |
Encryption algorithm which produces comparable results for substrings OPE is still something on going in the scientific literature and as far as i know there is no practical imlpementation that guarantees string security |
|
Oct 11 |
comment |
Using pairings to verify an extended euclidean relation without leaking the values? let us continue this discussion in chat |
|
Oct 11 |
comment |
Using pairings to verify an extended euclidean relation without leaking the values? So can i be sure that $e(g^{q_i(s)},g^{P_i(s)}) = e (g,g)$ holds? |
