In this paper, our main contribution is to show that pseudo-basis can not be extended to general adversaries. This means that the PSMTs of Yang and Desmedt (based on pseudo-basis) are flawed. We next show a truly efficient, three round PSMT over directed networks against general adversaries without using pseudobasis. While the previous PSMT schemes in directed network designed without using pseudobasis are either inefficient or prone to guessing attack (shown by Yang and Desmedt in ICITS '09), our efficient scheme can resist guessing attack. Instead of using pseudo-basis, we generalize the union technique to our setting, which was previously used to construct PSMTs against threshold proactive adversaries over undirected networks. We also present simple and efficient 3-round scheme in undirected network, without basing it on pseudobasis, which can send multiple messages concurrently.
Category / Keywords: cryptographic protocols / Date: received 16 Feb 2011, withdrawn 12 Apr 2011 Contact author: partho_31 at yahoo co in, partho31@gmail com, kurosawa@mx ibaraki ac jp, arpitapatra10@gmail com, arpitapatra_10@yahoo co in, arpita@cs au dk Available format(s): (-- withdrawn --) Note: During our detailed analysis of the paper, we found that the claims made in our paper are incorrect. The protocols of the paper titled "General Perfectly Secure Message Transmission Using Linear Codes" by Q. Yang and Y. Desmedt (accepted in ASIACRYPT 2010) are correct and indeed using generalized pseudo-basis we can design efficient PSMT protocols against non-threshold adversary. So the claims made in our paper regarding ASIACRYPT 2010 paper are incorrect. We are extremely sorry for the (negative) impression about the ASIACRYPT 2010 paper that might have been created due to our incorrect claims. Version: 20110412:121435 (All versions of this report) Short URL: ia.cr/2011/082 Discussion forum: Show discussion | Start new discussion