Cryptology ePrint Archive: Report 2016/496

All Complete Functionalities are Reversible

Daniel Kraschewski and Dakshita Khurana and Hemanta K. Maji and Manoj Prabhakaran and Amit Sahai

Abstract: Crepeau and Santha, in 1991, posed the question of reversibility of functionalities, that is, which functionalities when used in one direction, could securely implement the identical functionality in the reverse direction. Wolf and Wullschleger, in 2006, showed that oblivious transfer is reversible. We study the problem of reversibility among 2-party SFE functionalities, which also enable general multi-party computation, in the information-theoretic setting.

We show that any functionality that enables general multi-party computation, when used in both directions, is reversible. In fact, we show that any such functionality can securely realize oblivious transfer when used in an a priori fixed direction. This result enables secure computation using physical setups that parties can only use in a particular direction due to inherent asymmetries in them.

Category / Keywords: foundations / completeness, reversibility, secure computation

Original Publication (with major differences): IACR-EUROCRYPT-2016

Date: received 21 May 2016

Contact author: dakshita at cs ucla edu

Available format(s): PDF | BibTeX Citation

Note: This is the full version of the original publication.

Version: 20160522:162746 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]