In this paper we present the communication protocol that we use to implement rst class channels. Ordinary channels allow data communication (like CSP/Occam); rst class channels allow communicating channel ends over a channel. This enables processes to exchange communication capabilities, making the communication graph highly exible. In this paper we present a simple protocol to communicate chan...

In this paper we focus on estimating the amount of information that can be embedded in the sequencing of packets in ordered channels. Ordered channels, e.g. TCP, rely on sequence numbers to recover from packet loss and packet reordering. We propose a formal model for transmitting information by packet-reordering. We present natural and well-motivated channel models and jamming models including ...

Our main motivation is to design more user-friendly security protocols. Indeed, if the use of the protocol is tedious, most users will not behave correctly and, consequently, security issues occur. An example is the actual behavior of a user in front of an SSH certificate validation: while this task is of utmost importance, about 99% of SSH users accept the received certificate without checking...

objectives: autism spectrum disorder (asd) is a group of neurodevelopment syndromes with impairments in social communications and restrictive or repetitive behaviors. neurofeedback is a new method that may regulate neuro and metabolic function in brain. this study is semi-experimental, with pre and post test.  methods: in 26 children with asd, 40 sessions of neurofeedback were done. brain waves...

We analyze optical binary communication assisted by entanglement and show that: i) ideal entangled channels have smaller error probability than ideal single-mode coherent channels if the photon number of the channel is larger than one; ii) realistic entangled channels with heterodyne receivers have smaller error probability than ideal single-mode coherent channels if the photon number of the ch...

We define a class of symmetric discrete memoryless multiple-access channels. This definition incorporates previous definitions of symmetry for single user channels and is characterized by the optimality of the uniform distribution with respect to total channel capacity. We further identify a sub-class of channels in which channel symmetry is a direct result of a transposition symmetry in the tr...

Attackers in particular botnet controllers use stealthy messaging systems to set up large-scale command and control. Understanding the capacity of such communication channels is important in detecting organized cyber crimes. We analyze the use of domain name service (DNS) as a stealthy botnet command-and-control channel, which allows multiple entities to pass messages stored in DNS records to e...

This paper considers steganography – the concept of hiding the presence of secret messages in legal communications – in the computational setting and its relation to cryptography. Very recently the first (non-polynomial time) steganographic protocol has been shown which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. The security is unconditional,...

It is a common practice to design a protocol (say Q) assuming some secure channels. Then the secure channels are implemented using any standard protocol, e.g. TLS. In this paper, we study when such a practice is indeed secure. We provide a characterization of both confidential and authenticated channels. As an application, we study several protocols of the literature including TLS and BAC proto...