Reputation
5,952
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 8 22
Newest
 Informed
Impact
~66k people reached

34m
comment How to find the time complexity of modular multiplication?
See this paper and this method. ​ ​
20h
revised Why are hash functions like SpookyHash and MurmurHash so highly collision resistant?
fixed grammar and improved spacing
2d
answered Do you need a HMAC if decryption attempts are severely limited?
2d
comment Security of $(k, 2k)$-bit generator for small seeds
Yes. ​ ​ ​ ​ ​ ​
2d
comment Security of $(k, 2k)$-bit generator for small seeds
In this context, "small" just means something along the lines of "closer to the security parameter than the output length". ​ ​
2d
comment Is there an open source library for Functional Encryption?
Well, the trivial solution is letting outer_encryption_(m) be ​ prefixfree(inner_encryption_(m)) || linear_function_(m) . ​ ​ ​ If that doesn't work, then you should try clarifying what you're after. ​ ​ ​ ​ ​ ​ ​ ​
2d
comment Is there an open source library for Functional Encryption?
Is the linear function the "secret value"? ​ ​
2d
comment Is there an open source library for Functional Encryption?
Will the encryptor know what the linear function is? ​ (Just checking, as that would make it trivial.) ​ ​ ​ ​
Apr
26
comment Denial of service using Merkel tree proof
Yes. ​ ​ ​ ​ ​ ​
Apr
26
comment Why are the bit lengths of keys and digests equal in Lamport signatures?
Letting "the number of bits be same" lets the security parameter just be that number, and avoids needing to decide what to call the extra variables. ​ ​
Apr
26
comment Why are the bit lengths of keys and digests equal in Lamport signatures?
An adversary could forge by finding a collision or breaking the candidate-OWF. ​ When your compression function is independent of your candidate-OWF, those two tasks will be independent of each other. ​ ​ ​ ​
Apr
26
comment Why are the bit lengths of keys and digests equal in Lamport signatures?
No. ​ ​ ​ ​ ​ ​
Apr
26
comment Why are the bit lengths of keys and digests equal in Lamport signatures?
Having them be independent makes the scheme take a little longer to describe. ​ ​
Apr
24
comment Does using a verifiable secret sharing scheme ensure robustness of a protocol if it is secure under the semi-honest adversarial model
Not necessarily (though it certainly can be). ​ No. ​ This is a "just do it" construction, like these two. ​ ​ ​ ​
Apr
24
comment How to detect what crypto-method is used by Filecoder.Q?
Why is there a short red line between yvc and .O° for the locked file? ​ ​
Apr
23
comment what is meaning of operator “ := ” in cryptography?
math.stackexchange.com/q/944757/57159 ​ ​
Apr
22
comment Using what we already know about the data to decrypt it?
"the data in our to" D to? ​ ​
Apr
22
comment On the security definition of password-authenticated key exchange
I mean "revealing more than one key to the adversary", not "evealing more than one key to the adversary". ​ The point is, we have difficulty showing anything better in the plain model (rather than with setup). ​ ​ ​ ​
Apr
22
comment On the security definition of password-authenticated key exchange
Oh yeah, I guess the basic definition also doesn't account for the ideal functionality having an even smaller probability of revealing more than one key to the adversary. ​ ​
Apr
22
comment On the security definition of password-authenticated key exchange
If it has the a right length, then we can use it for encryption. ​ If the underlying encryption scheme is secure then the adversary's ability to distinguish different conversations under the combined scheme will be at most negligibly more than $n_{se}/|PW|$. ​ ​ ​ ​