On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

Due to its universality Oblivious Transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditionally secure way, but there are many reductions of OT to other variants of OT, as well as other primitives such as noisy channels. It is important to know how efficient such unconditionally secure reductions can be in principle, i.e., how many instances of a given primitive are at least needed to implement OT.

Provided by: University of Brighton Topic: Security Date Added: May 2010 Format: PDF

Find By Topic