In this paper, we re-visit the problem of unconditionally secure multiparty set intersection in information theoretic model. Li et.al [24] have proposed a protocol for n-party set intersection problem, which provides unconditional security when t < n 3 players are corrupted by an active adversary having unbounded computing power. Moreover, they have claimed that their protocol takes six rounds ...

We show an eavesdropping scheme on Boström-Felbinger communication protocol ( called pingpong protocol ) [Phys. Rev. Lett. 89, 187902 (2002)] in an ideal quantum channel. A measurement attack can be perfectly used to eavesdrop Alice’s information instead of a most general quantum operation attack. In a noisy quantum channel, the direct communication is forbidden. We present a quantum key distri...

The problem of Byzantine Broadcast (BB) and Byzantine Agreement (BA) are of interest to both distributed computing and cryptography community. Often, these primitives require prohibitive communication and round complexity. The extension protocols have been introduced to handle long messages at the cost of small number of broadcasts for bit. The latter are referred to as seed broadcasts and the ...

We propose a distributed connectivity maintenance protocol that explicitly accounts for the probabilistic nature of wireless communication links. The proposed protocol is simple to implement and it achieves a given target communication quality between nodes, which is quantified by the minimum packet delivery rate between any pair of nodes in the network. We demonstrate the robustness of the pro...

advanced metering infrastructure (ami) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication.  this study focuses on communication between a smart meter and a server on the utility side. hence, a mutual authentication mechanism in ami is presented based on the elliptic curve cryptography (ecc) and one time signature (ots) consists o...

This paper describes Multi-agent Artificial Economy communication Protocol (MAEP). MAEP is an instance of X-SS (eXtensible Social System) Protocol. MAEP is designed to be a standard communication protocol specially for artificial economy, such as XEconomy and World Trade League. Adopting XML as a representation of MAEP, we realize the interoperability of message structure that is indispensable ...

Developing a distributed system is difficult, as one wants it to have reasonable semantics, to scale well, to perform well, and to be reliable and fault tolerant goals which often oppose one another. To this end, the Mojavecomm framework is a system for reliable and fault tolerant group communication. While there exist protocols for reliable point-to-point communication between nodes, they do n...

In this paper, we adopt a new communication protocol between the UAV and fixed on-ground nodes. This protocol tends to reduce communication power consumption by stopping communication if the channel is not good to communicate (i.e. far nodes, obstacles, etc.) The communication is performed using the XBee 868M standard and Libelium wapsmotes. Our designed protocol is based on a new communication...

With the rapid development of communication technology, wireless technology has become more and more important, and has been widely used in personal communication. Recently, Aydos et al. proposed an ECC-based authenticated key agreement protocol for wireless communication. In their protocol, they used ECDSA and Diffie-Hellman key agreement to provide authentication and to obtain a session key f...

Security properties are essential in open and distributed environments with high dependability requirements. An approach to development and analysis of safetyand security-critical systems based on re nement as the central concept can o er an integrated solution. We analyse the Online Certi cate Status Protocol (OCSP), showing how to use re nement as an interference analysis tool for secure comm...