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

Jan
12
comment Can I shorten the large ECDSA public key output file from OpenSSL?
(These 2 comments don't help answer your question, but may be useful in your environment.) ​ This paper shows how to get short key encapsulation. ​ It may be possible to modify that and/or the signature algorithm to let you ​ ​ ​ (continued ...) ​ ​ ​ ​ ​ ​ ​
Jan
11
comment Homomorphic encryption diagram and trouble about a paper
1) ​ ​ ​ I'm not sure what you mean by that, but I think the answer is no. ​ The list q is chosen during the key generation process. ​ ​ ​ ​ ​ ​ 2) ​ ​ ​ Adding 2r is the end of the encryption process. ​ Yes. ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​
Jan
11
answered Homomorphic encryption diagram and trouble about a paper
Jan
11
comment Collision free one way function
It looks like the empty string collides with 0. ​ ​
Jan
9
comment Why can’t the public key exponent in RSA be negative?
No, strictly speaking he should write $\;\;\; m^{\hspace{.02 in}-3}\hspace{-0.04 in} \equiv 1000^{\hspace{.03 in}-1} \: \pmod{55} \:\:\:\:$. $\;\;\;\;\;\;\;\;\;$
Jan
6
comment Protocol to identify zone of potential agreement without revealing reservation prices and having to trust third parties?
This would actually be multi-party computation, rather than just zero-knowledge proofs. ​ ​
Jan
6
comment Zero knowledge proof of shared secret
Um, if the adversary can find more than one element of X then that's not secure against a malicious Party 2, even "if an oblivious transfer protocols that is secure for malicious adversaries is used." ​ (Party 2 can just output 1 even "if the sum of the values it received" doesn't equal A.) ​ ​ ​ ​
Jan
6
answered Why Generate Keys are inside game
Jan
5
comment Zero knowledge proof of shared secret
@Niklas : ​ ​ ​ Even when "|X| is sufficiently large", Just exchanging hashes and comparing is not secure. ​ In that case, even a passive adversary could try hashing lots of guesses at the other party's secret. ​ ​ ​ ​ ​ ​ ​ ​
Jan
5
comment Could an HMAC be used as a hash?
@ddddavidee : ​ Yes and yes, for the reason given in Yehuda's answer, and by the definition of HMAC. ​ ​ ​ ​
Jan
5
comment Could an HMAC be used as a hash?
@ddddavidee : ​ Only if it's hard in the first place. ​ ​ ​ ​
Jan
5
answered Could an HMAC be used as a hash?
Jan
3
comment Does rsa-oaep provide or not plaintext integrity in addition to confidentiality?
They presumably mean non-malleability. ​ ​
Jan
3
comment Does rsa-oaep provide or not plaintext integrity in addition to confidentiality?
Good point. ​ ​ ​
Jan
3
revised Does rsa-oaep provide or not plaintext integrity in addition to confidentiality?
clarified answer
Jan
3
comment end-to-end encrypted chat app with symmetric + public key encryption, TLS and cert pinning
Well, despite using PKI, this makes no attempt to authenticate user X to user Y. ​ ​
Jan
2
answered Does rsa-oaep provide or not plaintext integrity in addition to confidentiality?
Jan
1
comment Additively homomorphic cryptosystem with non-interactive zero-knowledge proof of non-negativity
Also, this sounds suspiciously like an XY problem. ​ ​ ​ ​
Dec
29
comment Stateless proof-of-work system with 0-roundtrip time
In that case, It uses the id of a random one of the servers.
Dec
29
comment Stateless proof-of-work system with 0-roundtrip time
I don't know how to formalize things; it might be possible for the servers to use communication instead of state.