The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we carry out a detailed investigation on two Train Inauguration Protocols proposed by WG43 for IEC 61375-2-5: ETB Train Inauguration (ETBTI) and Train Topology Discovery Protocol(T2DP). ETBTI uses Layer 2 LLDP to discovery neighbor peers and uses Layer 3 ETBIP to broadcast the information of single node to all the others. On the other hand, T2DP focuses on Layer 2 and modifies LLDP...
We give a test that can distinguish efficiently between product states of n quantum systems and states which are far from product. If applied to a state |φ) whose maximum overlap with a product state is 1- ε, the test passes with probability 1-Θ(ε), regardless of n or the local dimensions of the individual systems. The test uses two copies of |φ). We prove correctness of this test as a special case...
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results imply almost tight lower bounds on the accuracy of such data analyses, both for specific natural functions (such as Hamming distance) and in general. Our bounds expose a sharp contrast between the two-party setting and the...
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest execution of the protocol by both parties results in a fair coin toss, and (2) Security: a cheating party cannot increase the probability of its desired outcome by any significant amount. Since its introduction by Blum, coin flipping...
We present round-efficient protocols for secure multi-party computation with a dishonest majority that rely on black-box access to the underlying primitives. Our main contributions are as follows: · a O(log* n)-round protocol that relies on black-box access to dense cryptosystems, homomorphic encryption schemes, or lossy encryption schemes. This improves upon the recent O(1)log* n-round protocol of...
This paper makes three main contributions to the theory of communication complexity and stream computation. First, we present new bounds on the information complexity of AUGMENTED-INDEX. In contrast to analogous results for INDEX by Jain, Radhakrishnan and Sen [J. ACM, 2009], we have to overcome the significant technical challenge that protocols for AUGMENTED-INDEX may violate the "rectangle...
Cooperative communication offers a way to obtain spatial diversity in a wireless network without increasing hardware demands. The different cooperation protocols proposed in the literature are often studied under the assumption that all channel state information is available at the destination. In a practical scenario, channel estimates need to be derived from the broadcasted signals. In this paper,...
Current text messaging protocols over the world allow a rigid limit of 160 characters per SMS, using the default messaging system of the mobile. However this limit is often found to be too less under ordinary circumstances and very often, to communicate effectively, a concatenated message needs to be sent. This, coupled with exorbitant messaging rates adds to the reduced effectiveness and decrease...
Based on the concept of hybrid shift-invariant spaces, we develop a distributed protocol for the reconstruction of time-varying physical fields in wireless sensor networks. The localized nature of these spaces allows for a clustered network architecture that leads to low communication overhead. Capitalizing on the sparsity of the reconstruction matrix, we propose an iterative reconstruction algorithm...
Privacy-preserving data mining aims at securely extracting knowledge from two or more parties' private data. Secure multi-party computation is the paramount approach to it. In this paper, we study privacy-preserving add and multiply exchanging technology and present three new different approaches to privacy-preserving add to multiply protocol. After that, we analyze and compare the three different...
Locating mobile agents in a network of mobile agent systems still represents an open research issue. The cost of location management strategies mainly depends on the cost of search and update. We have developed a location management technique, named broadcasting with search by path chase (BSPC), applicable for multi-region environments. Using a Petri net tool we modeled, analyzed and simulated BSPC...
Various network monitoring and performance evaluation schemes generate considerable amount of traffic, which affects network performance. In this paper we describe a method for minimizing network monitoring overhead based on shortest path tree (SPT) protocol. We describe two different variations of the problem: the A-problem and the E-problem, and show that there is a significant difference between...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.