Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

EUROCRYPT
2011
Springer

favoriteEmaildiscussreport

243views Cryptology» more EUROCRYPT 2011»

Concurrent Composition in the Bounded Quantum Storage Model

12 years 8 months ago

Concurrent Composition in the Bounded Quantum Storage Model

Download eprint.iacr.org

We deﬁne 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 eﬃcient 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 protocol for general two-party computation without the need for any setup assumption. The round complexity of that protocol is linear in the circuit depth. Contents

Dominique Unruh

Real-time Traffic

Assumption | Bqs | Cryptology | EUROCRYPT 2011 | Storage Model |

claim paper

Related Content

» Composable Security in the BoundedQuantumStorage Model

» Cryptography In the Bounded QuantumStorage Model

» Cryptography in the BoundedQuantumStorage Model

» The BoundedStorage Model in the Presence of a Quantum Adversary

» Secure Identification and QKD in the BoundedQuantumStorage Model

» Quantum complexity theory

» Lower Bounds and Impossibility Results for Concurrent Self Composition

» Smaller TwoQubit Circuits for Quantum Communication and Computation

» On the Necessity of Rewinding in Secure Multiparty Computation

Post Info
More Details (n/a)

Added	28 Aug 2011
Updated	28 Aug 2011
Type	Journal
Year	2011
Where	EUROCRYPT
Authors	Dominique Unruh

Comments (0)