Paper 2008/086
Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary
Arpita Patra, Ashish Choudhary, Madhu Gayatri, and C. Pandu Rangan
Abstract
We study the problem of Perfectly Reliable Message Transmission}(PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous network, a part of which is under the influence of an all powerful mobile Byzantine adversary. In ACISP 2007 Srinathan et. al. has proved that the connectivity requirement for PSMT protocols is same for both static and mobile adversary thus showing that mobility of the adversary has no effect on the possibility of PSMT (also PRMT) protocols. Similarly in CRYPTO 2004, Srinathan et. al. has shown that the lower bound on the communication complexity of any multiphase PSMT protocol is same for static and mobile adversary. The authors have also designed a
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- arpitapatra_10 @ yahoo co in
- History
- 2008-02-28: received
- Short URL
- https://ia.cr/2008/086
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/086, author = {Arpita Patra and Ashish Choudhary and Madhu Gayatri and C. Pandu Rangan}, title = {Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary}, howpublished = {Cryptology {ePrint} Archive, Paper 2008/086}, year = {2008}, url = {https://eprint.iacr.org/2008/086} }