Secure computation has the potential to completely reshape the cybersecruity landscape, but this will happen only if we can make it practical. Despite significant improvements recently, secure computation is still orders of magnitude slower than computation in the clear. Even with the latest technology, running the killer apps, which are often data intensive, in secure computation is still a mi...

We consider the problem of secure distributed matrix computation (SDMC), where a user queries function data matrices generated at xmlns:xlink="http://www.w3.org/1999/xlink">source nodes. assume availability <tex-math notation="LaTe...

It is known that Bitcoin enables achieving fairness in secure computation by imposing monetary penalties on adversarial parties. This functionality called with penalties. Bentov and Kumaresan (2014) [9] introduced the claim-or-refund can be implemented via Bitcoin. They achieved O(n) rounds broadcasts for any function, where n number of After that, [8] showed a constant-round protocol. Unfortun...

We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming minimal assumption that oblivious transfer (OT) exists. If assumed OT protocol is against semi-honest adversaries (in plain model) then so our MPC protocol. Similarly, if malicious common random/reference string Previously, were only known under relatively stronger computational ass...