English
Related papers

Related papers: Towards a Theory of Anonymous Networking

200 papers

Anonymous data collection systems allow users to contribute the data necessary to build services and applications while preserving their privacy. Anonymity, however, can be abused by malicious agents aiming to subvert or to sabotage the…

Cryptography and Security · Computer Science 2018-12-20 Alex Catarineu , Philipp Claßen , Konark Modi , Josep M. Pujol

We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions…

Information Theory · Computer Science 2016-07-18 Tulika Agrawal , Samar Agnihotri

How to pass from local to global scales in anonymous networks? How to organize a selfstabilizing propagation of information with feedback. From the Angluin impossibility results, we cannot elect a leader in a general anonymous network.…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-06-29 Christian Boulinier

Nodes in contemporary radio networks often have multiple interfaces available for communication: WiFi, cellular, LoRa, Zigbee, etc. This motivates understanding both link and network configuration when multiple communication modalities with…

Signal Processing · Electrical Eng. & Systems 2025-01-10 Amna Gillani , Beatriz Lorenzo , Majid Ghaderi , Fikadu Dagefu , Dennis Goeckel

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

In the fully-anonymous (shared-memory) model, inspired by a biological setting, processors have no identifiers and memory locations are anonymous. This means that there is no pre-existing agreement among processors on any naming of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-08 Giuliano Losa , Eli Gafni

In massive MIMO wiretap settings, the base station can significantly suppress eavesdroppers by narrow beamforming toward legitimate terminals. Numerical investigations show that by this approach, secrecy is obtained at no significant cost.…

Information Theory · Computer Science 2018-08-15 Ali Bereyhi , Saba Asaad , Ralf R. Müller , Rafael F. Schaefer , Amir M. Rabiei

Scheduling and managing queues with bounded buffers are among the most fundamental problems in computer networking. Traditionally, it is often assumed that all the properties of each packet are known immediately upon arrival. However, as…

Networking and Internet Architecture · Computer Science 2020-01-01 Itamar Cohen , Gabriel Scalosub

One reason for the popularity of Bitcoin is due to its anonymity. Although several heuristics have been used to break the anonymity, new approaches are proposed to enhance its anonymity at the same time. One of them is the mixing service.…

Cryptography and Security · Computer Science 2021-03-03 Lei Wu , Yufeng Hu , Yajin Zhou , Haoyu Wang , Xiaopu Luo , Zhi Wang , Fan Zhang , Kui Ren

Anonymity systems such as Tor aim to enable users to communicate in a manner that is untraceable by adversaries that control a small number of machines. To provide efficient service to users, these anonymity systems make full use of…

Cryptography and Security · Computer Science 2015-03-19 Prateek Mittal , Ahmed Khurshid , Joshua Juen , Matthew Caesar , Nikita Borisov

This paper presents new methods enabling anonymous communication on the Internet. We describe a new protocol that allows us to create an anonymous overlay network by exploiting the web browsing activities of regular users. We show that the…

Cryptography and Security · Computer Science 2007-05-23 Matthias Bauer

This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the…

Information Theory · Computer Science 2018-10-29 Jin Yeong Tan , Lawrence Ong , Behzad Asadi

In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent…

Information Theory · Computer Science 2011-11-09 Ryutaroh Matsumoto , Masahito Hayashi

Recently, physical layer security based approaches have drawn considerable attentions and are envisaged to provide secure communications in the wireless networks. However, most existing literatures only focus on the physical layer. Thus,…

Information Theory · Computer Science 2013-08-19 Jun Wang , Pengfei Huang , Xudong Wang

We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the…

Information Theory · Computer Science 2016-05-09 Peida Tian , Sidharth Jaggi , Mayank Bakshi , Oliver Kosut

Invoking large transmit antenna arrays, massive MIMO wiretap settings are capable of suppressing passive eavesdroppers via narrow beamforming towards legitimate terminals. This implies that secrecy is obtained almost for free in these…

Information Theory · Computer Science 2019-12-06 Ali Bereyhi , Saba Asaad , Ralf R. Müller , Rafael F. Schaefer , Georg Fischer , H. Vincent Poor

Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…

Cryptography and Security · Computer Science 2016-11-15 Toni Draganov Stojanovski , Ninoslav Marina

Cooperative jamming is an approach that has been recently proposed for improving physical layer based security for wireless networks in the presence of an eavesdropper. While the source transmits its message to its destination, a relay node…

Information Theory · Computer Science 2009-07-30 Lun Dong , Zhu Han , Athina P. Petropulu , H. Vincent Poor

Reliable and secure communication is an important aspect of modern fiber optic communication. In this work we consider a multi-mode fiber (MMF) channel wiretapped by an eavesdropper. We assume the transmitter knows the legitimate channel,…

Information Theory · Computer Science 2021-10-22 Eduard Jorswieck , Andrew Lonnstrom , Karl-Ludwig Besser , Stefan Rothe , Juergen W. Czarske

We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. "nice but curious").…

Information Theory · Computer Science 2007-07-13 Luísa Lima , Muriel Médard , João Barros