Cryptology ePrint Archive: Report 2006/315

On the Necessity of Rewinding in Secure Multiparty Computation

Michael Backes and Joern-Mueller Quade and Dominique Unruh

Abstract: We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the stand-alone model proven using black-box simulators in the information-theoretic setting does not imply security under concurrent composition, not even security under 2-bounded concurrent self-composition with an inefficient simulator and fixed inputs. This in particular refutes recently made claims on the equivalence of security in the stand-alone model and concurrent composition for perfect and statistical security (STOC'06). Our result strongly relies on the question whether every rewinding simulator can be transformed into an equivalent, potentially inefficient non-rewinding (straight-line) simulator. We answer this question in the negative by giving a protocol that can be proven secure using a rewinding simulator, yet that is not secure for any non-rewinding simulator.

Category / Keywords: foundations / Secure computation, information-theoretic security, black-box simulation, protocol composition

Date: received 13 Sep 2006

Contact author: unruh at cs uni-sb de

Available format(s): PDF | BibTeX Citation

Version: 20060913:221002 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]