Emerging approaches to network monitoring involve large numbers of agents collaborating to produce performance or security related statistics on huge and generally incomplete networks. The aggregation process often involves security or business-critical information which network providers are generally unwilling to share without strong privacy protection. We present efficient and scalable proto...

Motivated by the goal of improving the concrete efficiency of secure multiparty computation (MPC), we study the possibility of implementing an infrastructure for MPC. We propose an infrastructure based on oblivious transfer (OT), which would consist of OT channels between some pairs of parties in the network. We devise information-theoretically secure protocols that allow additional pairs of pa...

This paper considers the problem of perfectly secure communication on a modified version of Wyner’s wiretap channel II where both the main and wiretapper’s channels have some erasures. A secret message is to be encoded into n channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly n− ν erasures, where the positions of...

Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share information-theoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the notion of an Eulerian secret key exchange, in which the pairs of players sharing secret keys form an Eulerian ...

Session to session key variation is the only approach for achieving perfect security as per Shannon [1-2]. This paper deals with time variant key technique Automatic Variable Key (AVK) introduced by Bhunia[3-5] and we tried to analyze the performance of different types of new AVK techniques. Refer ences C E Shannon, "Mathematical theory of communication", The Bell System Tech J, Vol. ...

To model modern large-scale datasets, we need efficient algorithms to infer a set of P unknown model parameters from N noisy measurements. What are fundamental limits on the accuracy of parameter inference, given finite signal-to-noise ratios, limited measurements, prior information, and computational tractability requirements? How can we combine prior information with measurements to achieve t...

Meta-learning automatically infers an inductive bias by observing data from a number of related tasks. The is encoded hyperparameters that determine aspects the model class or training algorithm, such as initialization learning rate. assumes tasks belong to task environment, and are drawn same environment both during meta-training meta-testing. This, however, may not hold true in practice. In t...

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users wit...