1. Perfect SMT protocols require more network connectivity in asynchronous network than synchronous network.
2. Connectivity requirement of statistical SMT protocols is same for both synchronous and asynchronous network.
Unfortunately, nothing is known about the communication complexity of RMT and SMT protocols in asynchronous settings. In this paper, we derive tight bounds on the communication complexity of the above problems and compare our results with the existing bounds for synchronous protocols. The interesting conclusions derived from our results are:
1. Asynchrony increases the communication complexity of perfect RMT protocols. However, asynchrony has no impact on the communication complexity of statistical RMT protocols.
2. SMT: Communication complexity of SMT protocols is more in asynchronous network, for both perfect as well as statistical case.Category / Keywords: cryptographic protocols / Publication Info: To appear in ICISC 2011 Date: received 1 Jun 2011, last revised 31 Oct 2011 Contact author: partho31 at gmail com, arpitapatra10@gmail com Available format(s): PDF | BibTeX Citation Version: 20111031:230937 (All versions of this report) Short URL: ia.cr/2011/288 Discussion forum: Show discussion | Start new discussion