Concurrent Composition in the Bounded Quantum Storage Model

  • Dominique Unruh
Conference paper

DOI: 10.1007/978-3-642-20465-4_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6632)
Cite this paper as:
Unruh D. (2011) Concurrent Composition in the Bounded Quantum Storage Model. In: Paterson K.G. (eds) Advances in Cryptology – EUROCRYPT 2011. EUROCRYPT 2011. Lecture Notes in Computer Science, vol 6632. Springer, Berlin, Heidelberg

Abstract

We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in the BQS-UC model that composes concurrently with other protocols and an (a-priori) polynomially-bounded number of instances of itself. Our protocol has an efficient simulator which is important if one wishes to compose our protocol with protocols that are only computationally secure. Combining our result with prior results, we get a statistically BQS-UC secure constant-round protocol for general two-party computation without the need for any setup assumption.

Keywords

Bounded quantum storage composability two-party computation 
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Dominique Unruh
    • 1
  1. 1.Saarland UniversityGermany

Personalised recommendations