12,810 reputation
21656
bio website pwnhome.wordpress.com
location
age
visits member for 2 years, 7 months
seen 6 hours ago

I like crypto. Need I say more?


Jun
25
comment Finding a keylength in a repeating key XOR cipher
of related interest: reverseengineering.stackexchange.com/a/2063/1854
Jun
24
revised What are some disadvantages of homomorphic encryption schemes?
Thanks not necessary
Jun
24
answered Map Bytes to Number
Jun
24
answered What are some disadvantages of homomorphic encryption schemes?
Jun
12
comment What's efficient MPC protocol for determining if sum's bigger than y?
My guess is that adding packed ss to Viff would be easy. I am not very familiar with FaiplayMP.
Jun
12
comment What's efficient MPC protocol for determining if sum's bigger than y?
@poncho, thanks for the update. I've seen a number of cases recently where generic MPC is faster than specialized protocols (often due to public key crypto), which is why I asked. Are you aware of any specialized millionaire problem solutions which do not use public-key crypto?
Jun
12
reviewed Approve suggested edit on Difference entity authentication and implicit key authentication
Jun
12
reviewed Approve suggested edit on Difference entity authentication and implicit key authentication
Jun
12
comment What's efficient MPC protocol for determining if sum's bigger than y?
@poncho, do you know if specialized solutions to the millionaire problem are faster than generic MPC solutions? Or which millionaire problem solution is the most efficient?
Jun
12
comment What's efficient MPC protocol for determining if sum's bigger than y?
In that case, I'd test the two methods and see which works best. One question, would you be able to run the function on thousands of inputs in parallel? I came across this recently, don't know all the details yet, and don't believe there are any public implementations, but there is a way to run MPC in a SIMD (single instruction, multiple data) fashion. See section 8.4 of Damgard's book.
Jun
11
comment What's efficient MPC protocol for determining if sum's bigger than y?
Not sure. For such a simple function, it probably doesn't matter much. Remember with Viff you will need at least 3 parties (4 for the malicious protocol). They don't all have to have inputs though.
Jun
11
revised Can any one explain Circuit Privacy using fully homomorphic encryption from Gentry's thesis?
deleted 90 characters in body
Jun
11
answered What's efficient MPC protocol for determining if sum's bigger than y?
Jun
10
comment What's efficient MPC protocol for determining if sum's bigger than y?
Can you describe in more detail who performs the computation and who needs to learn the output? Also, how many parties should be involved, just 2? How large are the inputs (32 bit, 64 bit, 2000 bits)?
Jun
8
comment Proofs of security methodologies
@user7060, do you plan on updating the question to address the concerns I raised? If not, let me know and maybe I'll update it.
Jun
7
answered Proofs of security methodologies
Jun
7
comment Why is TLS SRP verifier based on user name?
Yes, salt should be randomly generated, but what if the server is malicious? It doesn't have to play by the rules. In this case the server can mount the multi-target attack spoken of.
Jun
7
comment Proofs of security methodologies
Literature recommendations and reference requests are off topic here. I'll leave it open for now, but please edit to make more on topic. That said, I think there is a very good question that could be asked here. Instead of asking for references, I'd suggest editing the question to ask what the various proof techniques are, their strengths/weaknesses, etc. In that I think you will get lots of good references plus some good initial information to help you on your journey.
Jun
5
comment Secure use-cases of block cipher with 64-bit block size
would you like to edit the question to include this?
Jun
5
awarded  Enlightened