54,228 research outputs found
On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks
In this paper, we re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbounded
computing power. Desmedt et.al have given the characterization for three or more phase PSMT protocols over directed networks. Recently, Patra et. al. have given the characterization of two phase PSMT over directed networks. Even though the issue of tradeoff between phase complexity and communication complexity of PSMT protocols has been resolved in undirected networks, nothing is known in the literature regarding directed networks. In this paper, we completely settle down
this issue. Specifically, we derive the lower bounds on communication complexity of (a) two phase PSMT protocols and (b) three or more phase PSMT protocols in directed networks. Moreover, we show that our lower bounds are asymptotically tight, by designing communication optimal PSMT protocols in directed networks, which are first of their kind.
We re-visit the problem of perfectly reliable message transmission (PRMT) as well. Any PRMT protocol that sends a message containing field elements, has a trivial lower bound of ĀO() field
elements on its communication complexity. Thus any PRMT protocol that sends a message of eld elements by communicating O(\ell) field elements, is referred as communication optimal PRMT or PRMT with constant factor overhead. Here, we characterize the class of directed networks over which communication optimal PRMT or PRMT with constant factor overhead is possible. Moreover, we design a communication optimal PRMT over a directed network that satisfies the conditions stated in our characterization. Our communication optimal PRMT/PSMT protocols employ several new techniques based on coding theory, which are of independent interest
Statistically Reliable and Secure Message Transmission in Directed Networks
Consider the following problem: a sender S and a receiver R are part of a directed synchronous network and connected through intermediate nodes. Specifically, there exists n node disjoint paths, also called as wires, which are directed from S to R and u wires, which are directed from R to S. Moreover, the wires from S to R are disjoint from the wires directed from R to S. There exists a centralized, static adversary who has unbounded computing power and who can control at most t wires between S and R in Byzantine fashion. S has a message m^S, which we wants to send to R. The challenge is to design a protocol, such that after interacting in phases as per the protocol,
R should correctly output m^R = m^S, except with error probability
2^{-\Omega(\kappa)}, where \kappa is the error parameter. This problem is called as statistically reliable message transmission (SRMT). The problem of statistically secure message transmission
(SSMT) has an additional requirement that at the end of the protocol, m^S should be information theoretically secure.
Desmedt et.al have given the necessary and sufficient condition for the existence of SRMT and SSMT protocols in the above settings. They also presented an SSMT protocol, satisfying their characterization. Desmedt et.al claimed that their protocol is efficient and has polynomial computational and communication complexity. However, we show that it is not so. That is, we specify an adversary strategy, which may cause the protocol to have exponential computational and communication complexity. We then present new and efficient SRMT and SSMT protocols, satisfying the characterization of Desmedt et.al Finally we show that the our proposed protocols are communication optimal by deriving lower bound on the communication complexity of SRMT and SSMT protocols. As far our knowledge is concerned, our protocols are the first communication optimal SRMT and SSMT protocols in directed networks
Mechanism Design and Communication Networks
This paper characterizes the class of communication networks for which, in any environment (utilities and beliefs), every incentive-compatible social choice function is (partially) implementable. Among others, in environments with either common and independent beliefs and private values or a bad outcome, we show that if the communication network is 2-connected, then any incentive-compatible social choice function is implementable. A network is 2-connected if each player is either directly connected to the designer or indirectly connected to the designer through at least two disjoint paths. We couple encryption techniques together with appropriate incentives to secure the transmission of each playerās private information to the designer.Mechanism design; incentives; Bayesian equilibrium; communication networks; encryption; secure transmission; coding
Securing the Internet of Things Infrastructure - Standards and Techniques
The Internet of Things (IoT) infrastructure is a conglomerate of electronic devices interconnected through the Internet, with the purpose of providing prompt and effective service to end-users. Applications running on an IoT infrastructure generally handle sensitive information such as a patientās healthcare record, the position of a logistic vehicle, or the temperature readings obtained through wireless sensor nodes deployed in a bushland. The protection of such information from unlawful disclosure, tampering or modification, as well as the unscathed presence of IoT devices, in adversarial environments, is of prime concern. In this paper, a descriptive analysis of the security of standards and technologies for protecting the IoT communication channel from adversarial threats is provided. In addition, two paradigms for securing the IoT infrastructure, namely, common key based and paired key based, are proposed
Perfectly Secure Communication, based on Graph-Topological Addressing in Unique-Neighborhood Networks
We consider network graphs in which adjacent nodes share common
secrets. In this setting, certain techniques for perfect end-to-end security
(in the sense of confidentiality, authenticity (implying integrity) and
availability, i.e., CIA+) can be made applicable without end-to-end shared
secrets and without computational intractability assumptions. To this end, we
introduce and study the concept of a unique-neighborhood network, in which
nodes are uniquely identifiable upon their graph-topological neighborhood.
While the concept is motivated by authentication, it may enjoy wider
applicability as being a technology-agnostic (yet topology aware) form of
addressing nodes in a network
- ā¦