Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

  • Carmit Hazay
  • Antigoni Polychroniadou
  • Muthuramakrishnan Venkitasubramaniam
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9985)
Cite this paper as:
Hazay C., Polychroniadou A., Venkitasubramaniam M. (2016) Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. In: Hirt M., Smith A. (eds) Theory of Cryptography. TCC 2016. Lecture Notes in Computer Science, vol 9985. Springer, Berlin, Heidelberg


We put forth a new formulation of tamper-proof hardware in the Global Universal Composable (GUC) framework introduced by Canetti et al. in TCC 2007. Almost all of the previous works rely on the formulation by Katz in Eurocrypt 2007 and this formulation does not fully capture tokens in a concurrent setting. We address these shortcomings by relying on the GUC framework where we make the following contributions:
  1. 1.

    We construct secure Two-Party Computation (2PC) protocols for general functionalities with optimal round complexity and computational assumptions using stateless tokens. More precisely, we show how to realize arbitrary functionalities in the two-party setting with GUC security in two rounds under the minimal assumption of One-Way Functions (OWFs). Moreover, our construction relies on the underlying function in a black-box way. As a corollary, we obtain feasibility of Multi-Party Computation (MPC) with GUC-security under the minimal assumption of OWFs. As an independent contribution, we identify an issue with a claim in a previous work by Goyal, Ishai, Sahai, Venkatesan and Wadia in TCC 2010 regarding the feasibility of UC-secure computation with stateless tokens assuming collision-resistant hash-functions (and the extension based only on one-way functions).

  2. 2.

    We then construct a 3-round MPC protocol to securely realize arbitrary functionalities with GUC-security starting from any semi-honest secure MPC protocol. For this construction, we require the so-called one-many commit-and-prove primitive introduced in the original work of Canetti, Lindell, Ostrovsky and Sahai in STOC 2002 that is round-efficient and black-box in the underlying commitment. Using specially designed ?input-delayed? protocols we realize this primitive (with a 3-round protocol in our framework) using stateless tokens and one-way functions (where the underlying one-way function is used in a black-box way).



Secure computation Tamper-proof hardware Round complexity Minimal assumptions 

Copyright information

© International Association for Cryptologic Research 2016

Authors and Affiliations

  • Carmit Hazay
    • 1
  • Antigoni Polychroniadou
    • 2
  • Muthuramakrishnan Venkitasubramaniam
    • 3
  1. 1.Bar-Ilan UniversityRamat GanIsrael
  2. 2.Aarhus UniversityAarhusDenmark
  3. 3.University of RochesterRochesterUSA

Personalised recommendations