Richard
Reputation
Next privilege 150 Rep.
Create tags
 Oct29 asked Any functioning system for interactive proof? Jun13 awarded Scholar Jun13 accepted What's efficient MPC protocol for determining if sum's bigger than y? Jun12 comment What's efficient MPC protocol for determining if sum's bigger than y? packed ss is very interesting! My system should be able to run it in parallel. my concerns are really how hard (or how much effort) I should put to incorporate that into existing MPC platform, like FairplayMP. Jun12 comment What's efficient MPC protocol for determining if sum's bigger than y? Function is simple, but number of evaluation is potentially big, like run the inputs thousand time, so a little perf. improvement for single evaluation matters to the application... correct me if wrong. Jun11 revised What's efficient MPC protocol for determining if sum's bigger than y? added 268 characters in body Jun11 comment What's efficient MPC protocol for determining if sum's bigger than y? That's a great review!. one question though: since my function involves with both addition and comparison, kinda fall in btwn what arithmetic and boolean circuit excels in. so the question is really who can do both better?.. I will update the OP in a moment and will look into Viff (looks like its adapt btwn circuit and arithmetic based on computation)... interesting. Jun11 comment What's efficient MPC protocol for determining if sum's bigger than y? If input size is needed, I would start from the small, say 32 bits. Jun10 comment What's efficient MPC protocol for determining if sum's bigger than y? OP is for $2$ parties: values $x_0$ and $x_1$ are for each party, respectively. Generally, $2$ parties are OK but more than $2$, say $10$'s are possible in my case (but not rigidly). Input size is unspecified in my problem yet... but how does it matter in this problem? I want to know... Jun10 awarded Editor Jun10 revised What's efficient MPC protocol for determining if sum's bigger than y? added 49 characters in body; edited tags Jun10 asked What's efficient MPC protocol for determining if sum's bigger than y? Jun6 comment Does collision resistance stay when extending a hash function to a set domain? yes, it is a product. but not necessarily on $N$, since I am using crypto hash and the hash value is generally treated as bits or binary string. Jun6 asked Does collision resistance stay when extending a hash function to a set domain? Feb26 comment secure multiparty computation for multiplication this does not work! 'cause first party can simply know $k$ by comparing the result of round 1 and that of round 2. Feb24 comment secure multiparty computation for multiplication 'honest but curious' model is just fine to the problem. Feb24 awarded Student Feb24 comment secure multiparty computation for multiplication good point!... but that's just fine to my problem. actually, $\sum{b_j}$ is sensitive only when it's big, like equal to 6. Feb24 awarded Supporter Feb24 asked secure multiparty computation for multiplication