Reputation
18,694
Next tag badge:
284/400 score
76/80 answers
Badges
2 29 81
Newest
 Nice Answer
Impact
~466k people reached

5h
comment CA certificate expired on openvpn
Okay, now that we have the question polished up a bit, I'm going to migrate it to SuperUser. That is a much better site for this kind of question. Our Crypto site deals primarily with theoretical aspects of Crypto. Once it is migrated, you can go over there and register for an account and follow the answers.
5h
revised CA certificate expired on openvpn
added 745 characters in body
22h
comment Attribute Based Encryption
This answer has a good explanation. Can you clarify what that answer does not have that an answer to your question should have?
22h
revised Attribute Based Encryption
edited body
Aug
28
comment Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
Can you edit in the info you posted? You should be able to now. Then just flag the answer below where you provided the info and I'll delete it.
Aug
28
revised Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
edited title
Aug
28
accepted Is multiplicative secret sharing secure?
Aug
28
revised Formula for the number of expected collisions
changed question so last paragraph is not needed.
Aug
28
accepted Formula for the number of expected collisions
Aug
28
awarded  Nice Answer
Aug
28
comment Are there any cryptosystems that use multiple keys to perform encryption instead of one or two?
When you say "to perform encryption" you mean only encryption or encryption and decryption?
Aug
27
comment Hitting a counter example in homomorphic encryption over the integers
Maybe it is just a corner case that is so unlikely to happen with real parameters and proper use? Like in RSA if you try to encrypt a multiple of one of the prime factors, the encryption is the identity: crypto.stackexchange.com/questions/1004/…
Aug
27
revised Hitting a counter example in homomorphic encryption over the integers
edited body
Aug
27
comment Hitting a counter example in homomorphic encryption over the integers
Could it be order of operations? (1 xor 1) xor 1 = 0 xor 1 = 1 whereas an xor(1,1,1) = 0 for an xor operator that takes more than 2 inputs.
Aug
27
comment Privacy and Integrity in Public Cryptography
@Loris, a lot of the issues have been described on this site: RSA in ECB mode, attacks on textbook (no padding) RSA. Encrypting large files with RSA is very inefficient and this could lead to DoS attacks too.
Aug
27
comment CPA-security proof of “l-padded RSA” encryption scheme
That sounds like a reasonable way to do it.
Aug
27
answered Exchanging keys via third party
Aug
27
revised Exchanging keys via third party
edited body
Aug
27
comment CPA-security proof of “l-padded RSA” encryption scheme
I don't know this for a fact, but notice that the problem says "prove that if ... is hard ... then ... is CPA-secure". Could it be that your professor is saying that there is no formal proof that the if statement is true? In other words, the problem is saying, assume X, now prove Y, while your profesor is saying that we don't really know if X is true? Therefore, there is no conflict.
Aug
27
comment CPA-security proof of “l-padded RSA” encryption scheme
What is your question? There is no question mark in there. All I see are statements.