Next, we revisit the zero-one law for two-party secure functions evaluation initiated by the work of Maji, Prabhakaran and Rosulek (CRYPTO 2010). According to this law, every two-party functionality is either trivial (meaning, such functionalities can be reduced to any other functionality) or complete (meaning, any other functionality can be reduced to these functionalities) in the Universal Composability (UC) framework. As our second contribution, assuming the existence of a simulatable public-key encryption scheme, we establish a zero-one law in the adaptive setting. Our result implies that every two-party non-reactive functionality is either trivial or complete in the UC framework in the presence of adaptive, malicious adversaries.
Category / Keywords: UC Security, Adaptive Secure Computation, Coin-Tossing, Black-box construction, Extractable Commitments, Zero-One Law Original Publication (in the same form): IACR-TCC B--2016 Date: received 23 Aug 2016, last revised 29 Aug 2016 Contact author: carmit hazay at biu ac il Available format(s): PDF | BibTeX Citation Version: 20160829:190224 (All versions of this report) Short URL: ia.cr/2016/818 Discussion forum: Show discussion | Start new discussion