Reputation
5,490
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 8 21
Newest
 Pundit
Impact
~59k people reached

Dec
19
revised Homomorphic OR operations
elaborated on additively-homomorphic approach
Dec
19
answered Homomorphic OR operations
Dec
19
comment Diffie-Hellman: *assumed* largest prime factor of order of $g$?
(In particular, if the server itself is malicious, then the whole TLS is pointless.) ​ ​
Dec
18
comment Zero-Knowledge Proof of a polynomial
What do the commitments look like? ​ ​
Dec
18
comment Decisional Diffie-Hellman: compute Legendre symbol of $g^{ab}$ from $g^a$ and $g^b$?
Then there is no "efficient" way. ​ ​
Dec
18
comment Decisional Diffie-Hellman: compute Legendre symbol of $g^{ab}$ from $g^a$ and $g^b$?
You'd "compute $\left(\frac{g^{ab}}{p}\right)$ given $g^a$ and $g^b$" by solving CDH. ​ ​
Dec
17
comment What is the difference between RCCA and CCA2?
No; in RCCA you can "ask for the decryption of" "the challenge messages $m_{\hspace{.02 in}0}$ and $m_1$"; you'll just get a special response if you do. ​ ​
Dec
17
comment Efficient way to confirm identity
Yes, MACs do "require both server and client to share a secret key". ​ Changing the signature verification key would allow forgery. ​ Stopping the [signature verification key]'s transmission would "block authorised client from communicating with the server." ​ ​ ​ ​
Dec
17
comment Efficient way to confirm identity
Can you use MACs? ​ ​
Dec
16
answered What is the purpose of Pseudorandom Function Families (PRFs)?
Dec
16
comment Username and Password: How does it work?
Yes. ​ (bcrypt, at least, was explicitly designed with this use in mind.) ​ I have no clue. ​ ​ ​ ​
Dec
16
answered Non-deniability of data sent over TLS
Dec
16
answered Username and Password: How does it work?
Dec
15
answered Alice answering Bob without knowing he question
Dec
15
comment Why use Diffie-Hellman key exchange over RSA (or any public-key encryption)?
en.wikipedia.org/wiki/Forward_secrecy ​ ​
Dec
13
awarded  Pundit
Dec
13
comment Doubts about Authenticated Data Structures logic
How does [Merkle Tree vs Digital Signatures] affect your "In general the ...a verifier." sentence? ​ ​
Dec
13
comment What do you mean by Ciphertext indistinguishability
crypto.stackexchange.com/q/26689/991 ​ ​
Dec
10
comment Doubts about Authenticated Data Structures logic
Why would you "you have to contact the cloud provider more times to check the integrity as you should do with block + digital signature"? ​ ​
Dec
10
comment Doubts about Authenticated Data Structures logic
(For some reason, I didn't get a notification of your comments.) ​ The cloud provider answering you "with that element + the digital signature, is not more efficient than" having the cloud provider "mantain another data structure (like" a Merkle tree) "to authenticate the DB". ​ However, a Merkle tree would require any long-term storage, since it doesn't use secrets, so they can generate it on their own. ​ I have no clue about the runtime of encryption/decryption versus hashing, or RSA accumulators. ​ ​ ​ ​