Ricky Demer
Reputation
5,962
Top tag
Next privilege 10,000 Rep.
Access moderator tools
 1d comment 1-out-of-2 OT from Random 1-out-of-2 OT Nope; that's the end of my hints. ​ ​ 1d comment Where is the mistake in my RSA by-hand calculation? @Thomas : ​ Congruence mod $\phi(n)$ is a stronger condition than congruence mod the Lcm, since $\phi(n)$ is a multiple of the Lcm. ​ ​ ​ ​ 2d comment 1-out-of-2 OT from Random 1-out-of-2 OT In particular, anything that can transfer a message, can instead be used to transfer a key. ​ ​ 2d comment 1-out-of-2 OT from Random 1-out-of-2 OT key length ​ = ​ message length ​ ​ ​ ​ 2d comment 1-out-of-2 OT from Random 1-out-of-2 OT 2d comment Is there a way to optimize a linear scan while preserving anonymity? @sashank : ​ Can that "public constant" be generated by someone who does not know the Bs, without that someone sending any secret to Bob? ​ ​ ​ ​ Apr 30 comment Is it possible to combine two hash functions in such a way that cracking the constructed hash would require cracking the constituent hashes? @Thomas : ​ A might leak a significant portion of its input. ​ ​ ​ ​ Apr 29 comment How to find the time complexity of modular multiplication? See this paper and this method. ​ ​ Apr 28 revised Why are hash functions like SpookyHash and MurmurHash so highly collision resistant? fixed grammar and improved spacing Apr 27 answered Do you need a HMAC if decryption attempts are severely limited? Apr 27 comment Security of $(k, 2k)$-bit generator for small seeds Yes. ​ ​ ​ ​ ​ ​ Apr 27 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". ​ ​ Apr 27 comment What functional encryption scheme can be used to compute a linear function? 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. ​ ​ ​ ​ ​ ​ ​ ​ Apr 26 comment What functional encryption scheme can be used to compute a linear function? Is the linear function the "secret value"? ​ ​ Apr 26 comment What functional encryption scheme can be used to compute a linear function? 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. ​ ​