Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

Patra, Arpita; Choudhury, Ashish; Rangan, C. Pandu; Srinathan, Kannan

doi:10.1504/ijact.2010.038309

Cited by 31 publications

(46 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another problem that is closely related to ours is that of Secure Message Transmission (SMT) [14], [15]. Under SMT, a sender aims to communicate a message reliably and secretly to the receiver over multiple parallel links out of which a fraction of links are eavesdropped and another (possibly intersecting) fraction are jammed.…”

Section: Related Workmentioning

confidence: 99%

Coding against a limited-view adversary: The effect of causality and feedback

Zhang

Kadhe

Bakshi

et al. 2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

Abstract-We consider the problem of communication over a multi-path network in the presence of a causal adversary. The limited-view causal adversary is able to eavesdrop on a subset of links and also jam on a potentially overlapping subset of links based on the current and past information. To ensure that the communication takes place reliably and secretly, resilient network codes with necessary redundancy are needed. We study two adversarial models -additive and overwrite jamming and we optionally assume passive feedback from decoder to encoder, i.e., the encoder sees everything that the decoder sees. The problem assumes transmissions are in the large alphabet regime. For both jamming models, we find the capacity under four scenarios -reliability without feedback, reliability and secrecy without feedback, reliability with passive feedback, reliability and secrecy with passive feedback. We observe that, in comparison to the noncausal setting, the capacity with a causal adversary is strictly increased for a wide variety of parameter settings and present our intuition through several examples.

show abstract

Section: Related Workmentioning

confidence: 99%

Coding against a limited-view adversary: The effect of causality and feedback

Zhang

Kadhe

Bakshi

et al. 2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…This protocol uses a complex combination of secret sharing by the sender and elaborate verification of the received information by the receiver to determine the correct message block. There are two optimal and efficient 1-round (0, δ)-SMT protocols for N = 2t + 1 [14,22]. The protocol in [14] is based on the 1-round δ-RMT protocol of [18] and has similar complexity.…”

Section: Related Workmentioning

confidence: 99%

“…There are two optimal and efficient 1-round (0, δ)-SMT protocols for N = 2t + 1 [14,22]. The protocol in [14] is based on the 1-round δ-RMT protocol of [18] and has similar complexity. Moreover, to achieve the optimal transmission rate for higher connectivity, this protocol can not be directly used as the encrypted message blocks are broadcasted.…”

Section: Related Workmentioning

confidence: 99%

A General Construction for 1-Round δ-RMT and (0, δ)-SMT

Tuhin

Wang

2012

Applied Cryptography and Network Security

View full text Add to dashboard Cite

Abstract. In Secure Message Transmission (SMT) problem, a sender S is connected to a receiver R through N node disjoint bidirectional paths in the network, t of which are controlled by an adversary with unlimited computational power. S wants to send a message m to R in a reliable and private way. It is proved that SMT is possible if and only if N ≥ 2t+1. In Reliable Message Transmission (RMT) problem, the network setting is the same and the goal is to provide reliability for communication, only. In this paper we focus on 1-round δ-RMT and (0, δ)-SMT where the chance of protocol failure (receiver cannot decode the sent message) is at most δ, and in the case of SMT, privacy is perfect. We propose a new approach to the construction of 1-round δ-RMT and (0, δ)-SMT for all connectivities N ≥ 2t + 1, using list decodable codes and message authentication codes. Our concrete constructions use folded Reed-Solomon codes and multireceiver message authentication codes. The protocols have optimal transmission rates and provide the highest reliability among all known comparable protocols. Important advantages of these constructions are, (i) they can be adapted to all connectivities, and (ii) have simple and direct security (privacy and reliability) proofs using properties of the underlying codes, and δ can be calculated from parameters of the underlying codes. We discuss our results in relation to previous work in this area and propose directions for future research.

show abstract

“…However, the results presented in [38] holds only for the protocols, having a negligible error probability in reliability; i.e., the reliability is not perfect reliability 8 . As far our knowledge is concerned, nobody has ever addressed the issue of possibility, feasibility and optimality in the context of PSMT in undirected synchronous networks, tolerating mixed adversary.…”

Section: Our Motivationmentioning

confidence: 97%

“…Motivated by the need to study mixed adversary in the context of secure message transmission, the authors in [38] have recently studied the issues related to possibility, feasibility and optimality in the context of reliable and secure message transmission in the presence of a mixed adversary, who can corrupt disjoint sets of t b , t f and t p nodes in Byzantine, fail-stop and passive fashion respectively. However, the results presented in [38] holds only for the protocols, having a negligible error probability in reliability; i.e., the reliability is not perfect reliability 8 .…”

Section: Our Motivationmentioning

confidence: 99%

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Choudhary

Patra

Ashwinkumar

et al.

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

In this paper, we study the issues related to the possibility, feasibility and optimality for perfectly secure message transmission (PSMT) in an undirected synchronous network, under the influence of a mixed adversary having unbounded computing power, who can corrupt some of the nodes in the network in Byzantine, fail-stop and passive fashion respectively. Specifically, we answer the following questions: (a) Possibility: Given a network and a mixed adversary, what is the necessary and sufficient condition for the existence of any PSMT protocol over the network tolerating the adversary? (b) Feasibility: Once the existence of a protocol is ensured, then does there exist a polynomial time and efficient protocol on the given network? (c) Optimality: Given a message of specific length, what is the minimum communication complexity (lower bound) needed by any PSMT protocol to transmit the message and how to design a polynomial time protocol whose total communication complexity matches the lower bound on the communication complexity? We answer the above questions by considering two different types of mixed adversary, namely static mixed adversary and mobile mixed adversary. Intuitively, it is more difficult to tolerate a mobile mixed adversary (who can corrupt different set of nodes during different stages of the protocol) in comparison to its static counter part (who corrupts the same set of nodes throughout the protocol). However, surprisingly, we show that the connectivity requirement in the network and lower bound on communication 6 This is an extended, modified and elaborate version of [10]

show abstract

Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

Cited by 31 publications

References 55 publications

Coding against a limited-view adversary: The effect of causality and feedback

Coding against a limited-view adversary: The effect of causality and feedback

A General Construction for 1-Round δ-RMT and (0, δ)-SMT

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

Contact Info

Product

Resources

About