Reputation
4,952
Next tag badge:
51/100 score
30/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~47k people reached

5h
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
Yes, but that will produce ciphertexts with more noise without getting any security benefit from doing so. Furthermore, the only way that can actually simplify things is if the noises for the $\hspace{1.31 in}$ modular reduction values use $\: r \leftarrow \left(\hspace{-0.03 in}-2^{\rho'+1}\hspace{-0.02 in},\hspace{-0.02 in}0\right) \;$. $\;\;\;\;$
17h
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
@Terrace: $\;\;\;$ Well, using somewhat bideniable PKE also won't give commitments to the votes. $\:$ (Accordingly, "you have to commit to your vote" should've been mentioned much earlier.) $\hspace{1.03 in}$
23h
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
@Terrace : $\:$ Can you just use a one-time pad for the encryption? $\;\;\;\;$
1d
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
@Terrace : $\:$ If r can be a symmetric key, then you can just use the one-time pad. $\hspace{1.22 in}$ Explaining more would be helpful. $\;\;\;\;$
1d
answered Chosen plain text and chosen ciphertext definitions clarification
2d
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
The OP would "actually prefer it to be impossible to prove". $\;$
2d
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
Why does it follow that the answer is yes?$\:$ (Unless somewhat bideniable PKE is known to be impossible, it's not clear to me that there must be an NP algorithm with a non-negligible probability of accepting encryptions of Z and a negligible probability of accepting encryptions of strings other than Z.) $\hspace{1.61 in}$
Aug
28
comment Is Curve25519 vulnerable to private key exposure in the case of a bad RNG?
tools.ietf.org/html/draft-pornin-deterministic-dsa-00 $\;$
Aug
28
comment Is Curve25519 vulnerable to private key exposure in the case of a bad RNG?
Yes, since that problem isn't affected by what group is being used. ​ ​
Aug
28
comment Key Size for Symmetric Homomorphic Encryption Over the Integers
Where do they suggest those values? $\;$
Aug
28
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
However, I strongly encourage you to think hard about the point of what you're planning, and whether using somewhat bideniable PKE would undermine that. $\;$
Aug
28
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
Definitely, since ​ 0*1 = 0 = 1*0 ​ and ​ 0 ≠ 1 . ​ ​ ​ Somewhat bideniable PKE schemes will make it infeasible to prove anything about the plaintext. ​ ​ ​ ​ ​ ​ ​
Aug
28
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
Well, with the encryption-randomness kept and the keypair assumed to have been generated honestly, most PKE schemes will allow such proofs. $\;$
Aug
28
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
Well, with the encryption-randomness kept and the keypair assumed to have been generated honestly, most PKE schemes will allow such proofs. $\;$
Aug
28
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
Will you still have the randomness that was used for the encryption? $\:$ Can the verifier assume that the keypair was generated honestly? $\;\;\;\;$
Aug
28
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
Yes. ​ ((x+((p-1)/2))%p)-((p-1)/2) ​ ​ ​ ​
Aug
28
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
The mistake is that you're just thinking about (elementary ) number theory, $\hspace{1.8 in}$ rather than using the symmetric representation. $\;$
Aug
28
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
You are using a wrong representation. ​ ​
Aug
28
comment Are there ANY text strings that will generate the same SHA-512 Hash output?
Yes, but it's supposed to be hard to find an example. $\;$
Aug
27
comment Can iterated hashing be used to mitigate collision and preimage weaknesses?
Well, it adds a non-positive amount regarding collisions. $\;$