Multiparty Communication Research Articles

Experimental multipartner quantum communication complexity employing just one qubit

Most proposals for quantum solutions of information-theoretic problems rely on the usage of multi-partite entangled states which are still difficult to produce experimentally with current state-of-the-art technology. Here, we analyze a scheme to simplify a particular kind of multiparty communication protocols for the experiment. We prove that the fidelity of two communication complexity protocols, allowing for an N ? 1 bit communication, can be exponentially improved by N ? 1 (unentangled) qubit communication. Taking into account, for a fair comparison, all inefficiencies of state-of-the-art set-up, the experimental implementation for N = 5 outperforms the best classical protocol, making it the candidate for multi-party quantum communication applications.

Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication

In this paper we study quantum nondeterminism in multiparty communication. There are three (possibly) different types of nondeterminism in quantum computation: i) strong, ii) weak with classical proofs, and iii) weak with quantum proofs. Here we focus on the first one. A strong quantum nondeterministic protocol accepts a correct input with positive probability, and rejects an incorrect input with probability 1. In this work we relate strong quantum nondeterministic multiparty communication complexity to the rank of the communication tensor in the Number-On-Forehead and Number-In-Hand models. In particular, by extending the definition proposed by de Wolf to {\it nondeterministic tensor-rank} ($nrank$), we show that for any boolean function $f$ when there is no prior shared entanglement between the players, 1) in the Number-On-Forehead model, the cost is upper-bounded by the logarithm of $nrank(f)$; 2) in the Number-In-Hand model, the cost is lower-bounded by the logarithm of $nrank(f)$. Furthermore, we show that when the number of players is $o(\log\log n)$ we have that $NQP\nsubseteq BQP$ for Number-On-Forehead communication.

Finding, Minimizing, and Counting Weighted Subgraphs

For a pattern graph $H$ on $k$ nodes, we consider the problems of finding and counting the number of (not necessarily induced) copies of $H$ in a given large graph $G$ on $n$ nodes, as well as finding minimum weight copies in both node-weighted and edge-weighted graphs. Our results include the following: 1. The number of copies of an $H$ with an independent set of size $s$ can be computed exactly in $O^*(2^s n^{k-s+3})$ time and $poly(n,k)+O(2^s n^2)$ space, or in $O^*(4^s n^{k-s+3})$ time and $poly(n,k)$ space. (The $O^*$ notation omits $poly(k)$ factors.) To obtain these algorithms we provide fast algorithms for computing the permanent of a $k \times n$ matrix over rings and semirings. 2. The number of copies of any $H$ having minimum (or maximum) node-weight (with arbitrary real weights on nodes) can be found in $O(n^{\omega k/3} + n^{2k/3+o(1)})$ time, where $\omega < 2.38$ is the matrix multiplication exponent and $k$ is divisible by $3$. Similar results hold for other values of $k$. Also, the number of copies having exactly a prescribed weight can be found within this time. These algorithms extend the technique of Czumaj and Lingas [in Proceedings of SODA 2007, ACM, New York, SIAM, Philadelphia, 2007, pp. 986--994] and give a new (algorithmic) application of multiparty communication complexity. 3. Finding an edge-weighted triangle of weight exactly $0$ in general graphs requires $\Omega(n^{3-\varepsilon})$ time for all $\varepsilon > 0$, unless the $3$SUM problem on $N$ numbers can be solved in $O(N^{2 - \varepsilon})$ time. This suggests that the edge-weighted problem is much harder than its node-weighted version.

The Evolutionary Random Interval Fingerprint for a More Secure Wireless Communication

In this paper, we propose a novel evolutionary Random Interval Fingerprint RIF for active RFID and ZigBee systems. This new approach can enable more secure multi-party communication since, if the wireless packets are forged by another wireless communication party, the interval fingerprint can provide another way to detect the spoofing packet. Moreover, the random evolutionary algorithms, both genetic and memetic, are also proposed as a means to generate the random interval fingerprint. Compared to the conventional random generator, our approach is flexible in generating uniform random and long cycle numbers, and more robust for the anti-cracking. It is difficult for the forged party to produce the fake random intervals. Finally, we provide an application example, a completed work survey, pseudo-code and analysis result to prove that our concept is feasible for the Wireless communication.

Hadamard tensors and lower bounds on multiparty communication complexity

We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the Number on the Forehead model of Chandra, Furst, and Lipton. We define an analog of the Hadamard property of matrices for tensors in multiple dimensions and show that any k-party communication problem represented by a Hadamard tensor must have ?(n/2 k ) multiparty communication complexity. We also exhibit constructions of Hadamard tensors. This allows us to obtain ?(n/2 k ) lower bounds on multiparty communication complexity for a new class of explicitly defined Boolean functions.

Virtual Manipulation of Eon Studio-Based for High Speed Labeling Machine

High speed labeling machine builds virtual models and completes the design and realization of simulation manipulation by using the platform of virtual reality application of Eon Studio and SDK software, which realizes the communication message transmission among modules and gives the main function through the multi-party communication mechanism and function description, realizes the man-machine interaction function by applying the event driven and routing mechanism, solves better the conflict of multiple Agent by using Agent based-on rule-based reasoning and improved evidence theory, and eventually meets virtual manipulation function requirements of high speed labeling machine

A survey of information-centric networking

The information-centric networking (ICN) concept is a significant common approach of several future Internet research activities. The approach leverages in-network caching, multiparty communication through replication, and interaction models decoupling senders and receivers. The goal is to provide a network infrastructure service that is better suited to today?s use (in particular. content distribution and mobility) and more resilient to disruptions and failures. The ICN approach is being explored by a number of research projects. We compare and discuss design choices and features of proposed ICN architectures, focusing on the following main components: named data objects, naming and security, API, routing and transport, and caching. We also discuss the advantages of the ICN approach in general.

Distributed speech translation technologies for multiparty multilingual communication

Developing a multilingual speech translation system requires efforts in constructing automatic speech recognition (ASR), machine translation (MT), and text-to-speech synthesis (TTS) components for all possible source and target languages. If the numerous ASR, MT, and TTS systems for different language pairs developed independently in different parts of the world could be connected, multilingual speech translation systems for a multitude of language pairs could be achieved. Yet, there is currently no common, flexible framework that can provide an entire speech translation process by bringing together heterogeneous speech translation components. In this article we therefore propose a distributed architecture framework for multilingual speech translation in which all speech translation components are provided on distributed servers and cooperate over a network. This framework can facilitate the connection of different components and functions. To show the overall mechanism, we first present our state-of-the-art technologies for multilingual ASR, MT, and TTS components, and then describe how to combine those systems into the proposed network-based framework. The client applications are implemented on a handheld mobile terminal device, and all data exchanges among client users and spoken language technology servers are managed through a Web protocol. To support multiparty communication, an additional communication server is provided for simultaneously distributing the speech translation results from one user to multiple users. Field testing shows that the system is capable of realizing multiparty multilingual speech translation for real-time and location-independent communication.

Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremath{\sfAC}^0$

We prove an $n^{\Omega(1)}/4^k$ lower bound on the randomized k-party communication complexity of depth 4 $\ensuremath {\sf AC}^0$ functions in the number-on-forehead (NOF) model for up to $\Theta(\log n)$ players. These are the first nontrivial lower bounds for general NOF multiparty communication complexity for any $\ensuremath {\sf AC}^0$ function for $\omega(\log\log n)$ players. For nonconstant k the bounds are larger than all previous lower bounds for any $\ensuremath {\sf AC}^0$ function even for simultaneous communication complexity. Our lower bounds imply the first superpolynomial lower bounds for the simulation of $\ensuremath {\sf AC}^0$ by $\ensuremath {\sf MAJ\circ SYM\circ AND}$ circuits, showing that the well-known quasi-polynomial simulations of $\ensuremath {\sf AC}^0$ by such circuits due to Allender (1989) and Yao (1990) are qualitatively optimal,-1pt even for formulas of small constant depth. We also exhibit a depth 5 formula in ${\ensuremath {\sf NP}^{cc}_k}-{\ensuremath {\sf BPP}^{cc}_k}$ for k up to $\Theta(\log n)$ and derive $\Omega(2^{\sqrt{\log n}/\sqrt{k}})$ lower bound on the randomized k-party NOF communication complexity of set disjointness for up to $\Theta(\log^{1/3} n)$ players, which is significantly larger than the $O(\log\log n)$ players allowed in the best previous lower bounds for multiparty set disjointness. We prove other strong results for depth 3 and 4 $\ensuremath {\sf AC}^0$ functions.

A Forward-secure Grouping-proof Protocol for Multiple RFID Tags

Abstract Designing secure and robust grouping-proof protocols based on RFID characteristics becomes a hotspot in the research of security in Internet of Things (IOT). The proposed grouping-proof protocols recently have security and/or privacy omission and these schemes afford order-dependence by relaying message among tags through an RFID reader. In consequence, aiming at enhancing the robustness, improving scalability, reducing the computation costs on resource-constrained devices, and meanwhile combing Computational Intelligence (CI) with Secure Multi-party Communication (SMC), a Forward-Secure Grouping-Proof Protocol (FSGP) for multiple RFID tags based on Shamir's (n, n) secret sharing is proposed. In comparison with the previous grouping-proof protocols, FSGP has the characteristics of forward-security and order-independence addressing the scalability issue by avoiding relaying message. Our protocol provides security enhancement, performance improvement, and meanwhile controls the computation cost, wh...

Load Balancing Aware Multiparty Secure Group Communication for Online Services in Wireless Mesh Networks

The internet offers services for users which can be accessed in a collaborative shared manner. Users control these services, such as online gaming and social networking sites, with handheld devices. Wireless mesh networks (WMNs) are an emerging technology that can provide these services in an efficient manner. Because services are used by many users simultaneously, security is a paramount concern. Although many security solutions exist, they are not sufficient. None have considered the concept of load balancing with secure communication for online services. In this paper, a load aware multiparty secure group communication for online services in WMNs is proposed. During the registration process of a new client in the network, the Load Balancing Index (LBI) is checked by the router before issuing a certificate/key. The certificate is issued only if the value of LBI is less than a predefined threshold. The authors evaluate the proposed solution against the existing schemes with respect to metrics like storage and computation overhead, packet delivery fraction (PDF), and throughput. The results show that the proposed scheme is better with respect to these metrics.

Continuous-variable multipartite unlockable bound entangled Gaussian states

Continuous-variable (CV) multipartite unlockable bound-entangled states is investigated in this paper. Comparing with the qubit multipartite unlockable bound-entangled states, CV multipartite unlockable bound-entangled states present the new and different properties. CV multipartite unlockable bound-entangled states may serve as a useful quantum resource for new multiparty communication schemes. The experimental protocol for generating CV unlockable bound-entangled states is proposed with a setup that is at present accessible.

Extending Object-Oriented Network Protocols via alternative Transportation Bindings (Web Services over XMPP)

Distributed and/or composite web applications are driven by intercommunication via web services, which employ application-level protocols, such as SOAP. However, these protocols usually rely on the classic HTTP for transportation. HTTP is quite efficient for what it does — delivering web page content, but has never been intended to carry complex web service oriented communication. Today there exist modern protocols that are much better fit for the job. Such a candidate is XMPP. It is an XML-based, asynchronous, open protocol that has built-in security and authentication mechanisms and utilizes a network of federated servers. Sophisticated asynchronous multi-party communication patterns can be established, effectively aiding web service developers. This paper’s purpose is to prove by facts, comparisons, and practical examples that XMPP is not only better suited than HTTP to serve as middleware for web service protocols, but can also contribute to the overall development state of web services.

The provably total search problems of bounded arithmetic

We give combinatorial principles GIk, based on k-turn games, which are complete for the class of NP search problems provably total at the kth level Tk2 of the bounded arithmetic hierarchy and hence characterize the ∀ Σ ^ 1 b consequences of Tk2. Our argument uses a translation of first-order proofs into large, uniform propositional proofs in a system in which the soundness of the rules can be witnessed by polynomial time reductions between games. We show that ∀ Σ ^ 1 b ( α ) conservativity of T 2 i + 1 ( α ) over T 2 i ( α ) already implies ∀ Σ ^ 1 b ( α ) conservativity of T2(α) over T 2 i ( α ). We translate this into propositional form and give a polylogarithmic width CNF GI ¯ 3 such that if GI ¯ 3 has small R(log) refutations then so does any polylogarithmic width CNF which has small constant depth refutations. We prove a resolution lower bound for GI ¯ 3 . We use our characterization to give a sufficient condition for the totality of a relativized NP search problem to be unprovable in T 2 i ( α ) in terms of a non-logical question about multiparty communication protocols.

The Pattern Matrix Method

We develop a novel technique for communication lower bounds, the pattern matrix method. Specifically, fix an arbitrary function $f: \{0,1\}^n \to\{0,1\}$, and let $A_f$ be the matrix whose columns are each an application of $f$ to some subset of the variables $x_1,x_2,\ldots,x_{4n}.$ We prove that $A_f$ has bounded-error communication complexity $\Omega(d),$ where $d$ is the approximate degree of $f.$ This result remains valid in the quantum model, regardless of prior entanglement. In particular, it gives a new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmetric predicates. We further characterize the discrepancy, approximate rank, and approximate trace norm of $A_f$ in terms of well-studied analytic properties of $f,$ broadly generalizing several recent results on small-bias communication and agnostic learning. The method of this paper has also enabled important progress in multiparty communication complexity.

Session and Network Support for Autonomous Context-Aware Multiparty Communications in Heterogeneous Mobile Systems

The increase of networking complexity requires the design of new performance optimization schemes for delivering different types of sessions to users under different conditions. In this regard, special attention is given to multi-homed environments, where mobile devices cross areas with overlapping access technologies (Wi-Fi, 3G, WiMax). In such a scenario, efficient multiparty delivery depends upon the grouping operation, which must be done based on several parameters. In this paper, the authors propose context-aware sub-grouping of content-based service groups so that the same service session can be delivered using different codings of the same content, adapting to current network, users, session, and environment context. The context-aware information is used to improve the sub-grouping process. This paper aims to describe these sub-grouping techniques, and in particular how they improve network performance and user experience in the future Internet by focusing on the improved network-level and session-level mechanisms.

Achieving common grounds in communication via interfaces: a role of spatial frames for reference

The current paper argues for synchronising spatial frames of reference for achieving effective multiparty communication in collaborative virtual environments. Synchronising nonverbal behaviour from different modalities is an important step for simulating face-to-face-interaction where all nonverbal cues are available. Such synchronisation also serves as an effective basis for building multimodal interfaces especially if these have to be deployed for multiparty communication. It is argued that common spatial reference frames are helpful in coordinating different points of attention and facilitating work by serving as the springboard for joint attention among members of the team. Consequently, it is desirable to aim for such common grounds and not just focus on coordinating disjointed virtual spaces for facilitating decision-making by reducing felt collaborative effort. Implementing the synchronisation of spatial reference frames for modern technologies thus serves dual purposes by achieving common grounds in communication and maintaining autonomy of each member at the same time. Towards this end, the current paper proposes the concept of decentred egocentric frame, the origin of which is one’s own body and the spatial relation between two objects is defined with respect to this origin. This frame seems to be important for separating each member’s focus from his own body (self/activities) and also helps in coordinating one’s focus with those of the others whether interacting verbally or nonverbally. This is an important conceptual development as the proposed classification is hypothesised to function in a similar manner across different sensory modalities. The paper concludes with issues on implementation and other future conceptual developments.

Modeling Cognitive Loads for Evolving Shared Mental Models in Human–Agent Collaboration

Recent research on human-centered teamwork highly demands the design of cognitive agents that can model and exploit human partners' cognitive load to enhance team performance. In this paper, we focus on teams composed of human-agent pairs and develop a system called Shared Mental Models for all--SMMall. SMMall implements a hidden Markov model (HMM)-based cognitive load model for an agent to predict its human partner's instantaneous cognitive load status. It also implements a user interface (UI) concept called shared belief map, which offers a synergic representation of team members' information space and allows them to share beliefs. An experiment was conducted to evaluate the HMM-based load models. The results indicate that the HMM-based load models are effective in helping team members develop a shared mental model (SMM), and the benefit of load-based information sharing becomes more significant as communication capacity increases. It also suggests that multiparty communication plays an important role in forming/evolving team SMMs, and when a group of agents can be partitioned into subteams, splitting messages by their load status can be more effective for developing subteam SMMs.

Multi-party covert communication with steganography and quantum secret sharing

In this paper, we address the “multi-party covert communication”, a stronger notion of security than standard secure multi-party communication. Multi-party covert communication guarantees that the process of it cannot be observed. We propose a scheme for steganographic communication based on a channel hidden within quantum secret sharing (QSS). According to our knowledge nobody has ever raised the scheme, providing us the motivation for this work. To an outside observer, participants will engage in a typical instance of QSS, just like the others. But when the session is over, covert multi-party communication has already been done. Further analysis shows that the amount of hidden information one can acquire is 0, even if either an outside observer guesses the covert communication is carrying on or a dishonest participant is eavesdropping.

A Comparison of Multimedia Conferencing Frameworks

Multimedia conferencing ha s been an important topic in recent years, because of the urgent requirement of high quality multi-party communications. There are various conferencing frameworks using different methods: H.323-based conferencing has already applied in use ; SIP-based conferencing is emerging in market gradually . Wh ile centralized conferencing is becoming mature, distributed conferencing is coming forth. What are their respective characteristics? Which product should we choose? In this paper, we review two typical structures of centralized conferencing, and propose several frameworks of distributed conferencing. Then we carry out a comparison of these architectures under study. The evaluation criteria are scalability of the conference size, robustness, extension and transmission delay. Our findings show that th e se systems with respective advantages are fit for different circumstances.