A New Approach to Practical Active-Secure Two-Party Computation

Details A New Approach to Practical Active-Secure Two-Party Computation A New Approach to Practical Active-Secure Two-Party Computation

2012-02-14

arxiv.org/abs/1202.3052v1

Computer Science

Cryptography and Security

Scientific paper

We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle model. To get a practical protocol we introduce a number of novel techniques for relating the outputs and inputs of OTs in a larger construction. We also report on an implementation of this approach, that shows that our protocol is more efficient than any previous one: For big enough circuits, we can evaluate more than 20000 Boolean gates per second. As an example, evaluating one oblivious AES encryption (~34000 gates) takes 64 seconds, but when repeating the task 27 times it only takes less than 3 seconds per instance.

Affiliated with

Also associated with

No associations

Rating

A New Approach to Practical Active-Secure Two-Party Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Approach to Practical Active-Secure Two-Party Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Approach to Practical Active-Secure Two-Party Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89862