Lower bounds and impossibility results for concurrent self composition

Research output: Contribution to journalArticlepeer-review

22 Scopus citations

Abstract

In the setting of concurrent self composition, a single protocol is executed many times concurrently in a network. In this paper, we prove lower bounds and impossibility results for secure protocols in this setting. First and foremost, we prove that there exist large classes of functionalities that cannot be securely computed under concurrent self composition, by any protocol. We also prove a communication complexity lower bound on protocols that securely compute a large class of functionalities in this setting. Specifically, we show that any protocol that computes a functionality from this class and remains secure for m concurrent executions, must have bandwidth of at least m bits. The above results are unconditional and hold for any type of simulation (i.e., even for non-black-box simulation). In addition, we prove a severe lower bound on protocols that are proven secure using black-box simulation. Specifically, we show that any protocol that computes the blind signature or oblivious transfer functionalities and remains secure for m concurrent executions, where security is proven via black-box simulation, must have at least m rounds of communication. Our results hold for the plain model, where no trusted setup phase is assumed. While proving our impossibility results, we also show that for many functionalities, security under concurrent self composition (where a single secure protocol is run many times) is actually equivalent to the seemingly more stringent requirement of security under concurrent general composition (where a secure protocol is run concurrently with other arbitrary protocols). This observation has significance beyond the impossibility results that are derived by it for concurrent self composition.

Original languageEnglish
Pages (from-to)200-249
Number of pages50
JournalJournal of Cryptology
Volume21
Issue number2
DOIs
StatePublished - Apr 2008

Keywords

  • Impossibility results
  • Lower bounds
  • Non-black-box and black-box simulation
  • Protocol composition
  • Secure computation
  • Self and general composition

Fingerprint

Dive into the research topics of 'Lower bounds and impossibility results for concurrent self composition'. Together they form a unique fingerprint.

Cite this