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

I like crypto. Need I say more?


Jun
25
reviewed Satisfactory Polynomial multiplication and division in2^128
Jun
25
reviewed Satisfactory Injecting salt into PyCrypto KDF - useful?
Jun
25
reviewed Needs Improvement How does the birthday attack work in AUTH and UF-CMA games?
Jun
25
reviewed Satisfactory Why is SRP not widely used?
Jun
25
reviewed Excellent Attacking AES/CCM with random IV
Jun
25
reviewed Excellent How does OAEP improve the security of RSA?
Jun
25
reviewed Excellent AES plaintext is smaller than 128 bits - how to expand?
Jun
25
reviewed Satisfactory Increased CRC collision probability when adding bits to input message
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