Theory of Cryptography Conference

TCC 2016: Theory of Cryptography pp 400-432

Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

  • Carmit Hazay
  • Muthuramakrishnan Venkitasubramaniam
Conference paper

DOI: 10.1007/978-3-662-53641-4_16

Volume 9985 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Hazay C., Venkitasubramaniam M. (2016) Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions. In: Hirt M., Smith A. (eds) Theory of Cryptography. TCC 2016. Lecture Notes in Computer Science, vol 9985. Springer, Berlin, Heidelberg

Abstract

All previous constructions of general multiparty computation protocols that are secure against adaptive corruptions in the concurrent setting either require some form of setup or non-standard assumptions. In this paper we provide the first general construction of secure multi-party computation protocol without any setup that guarantees composable security in the presence of an adaptive adversary based on standard polynomial-time assumptions. We prove security under the notion of “UC with super-polynomial helpers” introduced by Canetti et al. (FOCS 2010), which is closed under universal composition and implies “super-polynomial-time simulation”. Moreover, our construction relies on the underlying cryptographic primitives in a black-box manner.

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.

Keywords

UC security Adaptive secure computation Coin-tossing Black-box construction Extractable commitments Zero-one law 

Copyright information

© International Association for Cryptologic Research 2016

Authors and Affiliations

  • Carmit Hazay
    • 1
  • Muthuramakrishnan Venkitasubramaniam
    • 2
  1. 1.Bar-Ilan UniversityRamat GanIsrael
  2. 2.University of RochesterRochesterUSA