Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation

Details Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation

2009-02-04

arxiv.org/abs/0902.0822v1

Computer Science

Cryptography and Security

5 pages, 2 figures. Submitted to 2009 IEEE International Symposium on Information Theory, Seoul, South Korea

Scientific paper

We propose an information theoretic framework for the secure two-party function computation (SFC) problem and introduce the notion of SFC capacity. We study and extend string oblivious transfer (OT) to sample-wise OT. We propose an efficient, perfectly private OT protocol utilizing the binary erasure channel or source. We also propose the bootstrap string OT protocol which provides disjoint (weakened) privacy while achieving a multiplicative increase in rate, thus trading off security for rate. Finally, leveraging our OT protocol, we construct a protocol for SFC and establish a general lower bound on SFC capacity of the binary erasure channel and source.

Affiliated with

Also associated with

No associations

Rating

Bootstrapped Oblivious Transfer and Secure Two-Party Function 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 Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25374