Due to evolving network technologies as well as increased and varying demands of modern applications on embedded systems, general-purpose protocol stacks are not always adequate. We examine the usefulness of component-based software engineering for the implementation of software communication systems. We present an architecture that allows dividing protocol software into fully de-coupled compon...

Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversary. Known asynchronous MPC protocols require communication of at least Ω(n) (with cryptographic security), respectively Ω(n) (with information-theoretic security, but with error probability and non-optimal resilience)...

Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine model of a system under test (SUT) by observing the output that the SUT produces in response to selected sequences of input. In this paper we present an approach using regular inference to construct models of communication protocol entities. Entities of communication protocols typically take...

Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her itemset in Server’s database with the usual privacy guarantees. First, we show that if the number of attributes is small, then a communication-efficient PISC protocol can be constructed from a communication-efficient ob...

This paper presents an architecture to dynamically change from a given group communication protocol to another. Such an architecture allows a system designer to create a distributed system that takes advantage of the different features of various group communication protocols by selecting the most favorable one under particular circumstances. The system wraps a set of independent group communic...

We obtain a strong direct product theorem for two-party bounded round communication complexity. Let sucr(μ, f, C) denote the maximum success probability of an r-round communication protocol that uses at most C bits of communication in computing f(x, y) when (x, y) ∼ μ. Jain et al. [12] have recently showed that if sucr(μ, f, C) ≤ 2 3 and T (C − Ω(r)) · n r , then sucr(μ , f, T ) ≤ exp(−Ω(n/r))....

Tunneling is commonly used in several transition mechanisms. Some of the mechanisms discover the tunnel endpoint automatically by their own means. This paper describes several tunnel discovery mechanisms for IPv6 traversal beyond IPv4 legacy networks and suggests a new mechanism by which the DHCPv4 server can automatically provide configuration information about IPv6-in-IPv4 tunnel. Dual stack ...

For a function f : X ×Y → Z , the m-fold direct sum is the function f : X × Y → Z, defined by f(〈x1, . . . , xm〉, 〈y1, . . . , ym〉) ∆ = 〈f(x1, y1), . . . , f(xm, ym)〉. We show the following direct sum theorem for classical communication protocols, R(f) = Ω( m k R(f)) where R(f) is the the k-round private coins communication complexity of f and R(f) is the k-round public coin complexity of f . I...

In this paper, a new hybrid routing protocol is presented for low power Wireless Sensor Networks (WSNs). The new system uses an integrated piezoelectric energy harvester to increase the network lifetime. Power dissipation is one of the most important factors affecting lifetime of a WSN. An innovative cluster head selection technique using Cuckoo optimization algorithm has been used in the desig...

Nowadays, Multimedia Communication has been developed and improved rapidly in order to enable users to communicate between each other over the Internet. In general, the multimedia communication consists of audio, video and instant messages communication. This paper surveys the functions and the privileges of different VoIP protocols (i.e. InterAsterisk eXchange Protocol (IAX), Session Initiatio...