International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model

Authors:
Yehuda Lindell
Download:
URL: http://eprint.iacr.org/2003/100
Search ePrint
Search Google
Abstract: Until recently, most research on the topic of secure computation focused on the stand-alone model, where a single protocol execution takes place. In this paper, we construct protocols for the setting of {\em bounded-concurrent self composition}, where a (single) secure protocol is run many times concurrently, and there is a predetermined bound on the number of concurrent executions. In short, we show that {\em any} two-party functionality can be securely computed under bounded-concurrent self composition, in the {\sf plain model} (where the only setup assumption made is that the parties communicate via authenticated channels). Our protocol provides the first feasibility result for general two-party computation in the plain model, {\em for any model of concurrency}. All previous protocols assumed a trusted setup phase in order to obtain a common reference string. On the downside, the number of rounds of communication in our protocol is super-linear in the bound on the number of concurrent executions. However, we believe that our constructions will lead to more efficient protocols for this task.
BibTeX
@misc{eprint-2003-11815,
  title={Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model},
  booktitle={IACR Eprint archive},
  keywords={foundations / secure two-party computation, concurrent self composition, setup assumptions},
  url={http://eprint.iacr.org/2003/100},
  note={STOC 2003 lindell@us.ibm.com 12556 received 23 May 2003, last revised 18 May 2004},
  author={Yehuda Lindell},
  year=2003
}