Perfectly reliable and secure message transmission tolerating mobile adversary
DOI10.1504/IJACT.2009.023467zbMATH Open1159.94370OpenAlexW2017758817MaRDI QIDQ1017544FDOQ1017544
Authors: Arpita Patra, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra, Ashish Choudhury 
Publication date: 12 May 2009
Published in: International Journal of Applied Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijact.2009.023467
Recommendations
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- On Proactive Perfectly Secure Message Transmission
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
reliabilitymobilitycryptographycommunication efficiencyinformation theoretic securitymessage transmissionmobile adversarythreshold adversaryunbounded computing powerundirected synchronous networks
Cited In (7)
- Approaching secure communications in a message-oriented mobile computing environment
- Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
- On Proactive Perfectly Secure Message Transmission
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Secure Message Delivery Games for Device-to-Device Communications
- Distributed CONGEST Algorithms against Mobile Adversaries
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
This page was built for publication: Perfectly reliable and secure message transmission tolerating mobile adversary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017544)
