network profile
| bio | website | |
|---|---|---|
| location | Atlanta, GA | |
| age | ||
| visits | member for | 1 year, 2 months |
| seen | Feb 27 '12 at 3:08 | |
| stats | profile views | 0 |
|
Feb 26 |
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. |
|
Feb 24 |
comment |
secure multiparty computation for multiplication 'honest but curious' model is just fine to the problem. |
|
Feb 24 |
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. |
