#### DMCA

## NETWORKING WITH SECRECY CONSTRAINTS

Citations: | 2 - 2 self |

### Citations

1541 | Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms
- Chaum
- 1981
(Show Context)
Citation Context ...f 7 Information Flows Monitored Nodes PSfrag replacements Fig. 1: Wireless Network with Eavesdroppers is possible to prevent analysis based on the contents and lengths of packets (ex: Chaum’s Mix-net =-=[2]-=-). However, by merely correlating the time points of transmissions from multiple nodes, an adversary can infer the routes of information flow, especially in low latency networks. Therefore, a key aspe... |

1190 |
Communication theory of secrecy systems
- Shannon
- 1949
(Show Context)
Citation Context ... countermeasure to traffic analysis attacks has also been considered in [11, 12]. The theoretical framework for secrecy in this work is motivated by the notion of equivocation developed by Shannon in =-=[13]-=-. The secrecy constraint we consider is a special case of Shannon’s equivocation, known as maximum secrecy [14], wherein the observations provide zero information about the source. 2.1. Definitions 2.... |

822 | Crowds: anonymity for Web transactions - Reiter, Rubin - 1998 |

740 |
Broadcast Channels with Confidential Messages
- Csiszar, Korner
- 1978
(Show Context)
Citation Context ...y model security or secrecy provided. Our definition of secrecy is motivated by Shannon’s notion of equivocation [13], which was utilized in defining secrecy in wiretapped [14] and broadcast channels =-=[15]-=-. Let A = {A1, A2, · · · , Ak} ⊂ V be a subset of nodes. We define node A to be connected to node B (or A → B), if there exists a path from node A to node B. In other words, A → B iff there exists nod... |

566 | The Theory of Stochastic Processes - Cox, Miller - 1965 |

466 | Effective Erasure Codes for Reliable Computer Communication Protocols
- Rizzo
- 1997
(Show Context)
Citation Context .... Hence, it is necessary for the source to use a forward error correction scheme to ensure reliable recovery of packets at the destination. Coding for packet recovery has been addressed in literature =-=[18, 19]-=-. In particular, in [18], the authors propose coding schemes to recover packets when transmissions result in packet erasures. Since packets can be appended with a sequence number, the erasure position... |

301 |
The wire-tap channel,” Bell Syst
- Wyner
- 1975
(Show Context)
Citation Context ... secrecy in this work is motivated by the notion of equivocation developed by Shannon in [13]. The secrecy constraint we consider is a special case of Shannon’s equivocation, known as maximum secrecy =-=[14]-=-, wherein the observations provide zero information about the source. 2.1. Definitions 2. PROBLEM SETUP Let the network be represented by a directed graph G = (V, E), where V is the set of nodes and E... |

299 | Towards an information theoretic metric for anonymity
- Serjantov, Danezis
- 2002
(Show Context)
Citation Context ...ets. We also extend the results when an additional constraint on packet loss is imposed. 1.1. Related Work Designing countermeasures to traffic analysis attacks is a classical problem. Many solutions =-=[4]-=- have been derivedsfrom Chaum’s Mix-net concept [2]. A Mix relays data for multiple flows and by reordering and re-encrypting the data, flow correlation of incoming and outgoing data is prevented. The... |

296 | Mixminion: Design of a type III anonymous remailer protoco l - Danezis, Dingledine, et al. - 2003 |

185 | Mixing E-mail with Babel - Gülcü, Tsudik - 1996 |

171 | ANODR: ANonymous On Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks
- Kong, Hong
- 2003
(Show Context)
Citation Context ... randomized transmissions to prevent flow correlation in networks without latency constraints. The use of randomized routes as a countermeasure to traffic analysis attacks has also been considered in =-=[11, 12]-=-. The theoretical framework for secrecy in this work is motivated by the notion of equivocation developed by Shannon in [13]. The secrecy constraint we consider is a special case of Shannon’s equivoca... |

142 | Statistical identification of encrypted Web browsing traffic - Sun, Simon, et al. - 2002 |

133 |
Packet recovery in high-speed networks using coding and buffer management
- Shacham, McKenney
- 1990
(Show Context)
Citation Context .... Hence, it is necessary for the source to use a forward error correction scheme to ensure reliable recovery of packets at the destination. Coding for packet recovery has been addressed in literature =-=[18, 19]-=-. In particular, in [18], the authors propose coding schemes to recover packets when transmissions result in packet erasures. Since packets can be appended with a sequence number, the erasure position... |

87 | Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds
- Blum, Song, et al.
- 2004
(Show Context)
Citation Context ... of the relay node are independent for each flow. CA A B CB Fig. 3: 1 × 1 Relay To characterize the achievable rates for a 1 × 1 relay map, we use the BOUNDED-GREEDY-MATCH (BGM) algorithm proposed in =-=[16]-=- that optimally maps Point processes with the least packet drops. Since epochs are generated according to independent Poisson processes, the delay constraint makes it impossible to relay all transmitt... |

66 | On flow correlation attacks and countermeasures in mix networks
- Zhu, Fu, et al.
- 2004
(Show Context)
Citation Context ...ion of incoming and outgoing data is prevented. The idea has been used effectively in providing anonymous communication for internet applications [5–8]. For low latency networks, it has been shown in =-=[9]-=- that simple mixing techniques are not effective to prevent correlation of transmission epochs. They propose the use of dummy packets to make departure epochs identical irrespective of the flows. The ... |

30 |
Intrusion detection systems: a taxonomy and survey
- Axelsson
- 1999
(Show Context)
Citation Context ...less medium makes networks vulnerable to a wide range of attacks by adversaries. Active attacks such as jamming or node replication are countered by using sophisticated intrusion detection mechanisms =-=[1]-=-. Passive attacks such as traffic analysis or flow correlation attacks, wherein eavesdroppers monitor transmissions from nodes, are, however, not detectable. Passive traffic monitoring can provide adv... |

30 | About priority encoding transmission
- Boucheron, Salamatian
- 2000
(Show Context)
Citation Context ...ed, the packet drop model is equivalent to a channel with stationary and ergodic erasures. Hence, as the block length increases, it is possible to obtain an endto-end information packet rate of 1 − ɛ =-=[20]-=-, where ɛ is the fraction of packets dropped. In practice, it may be necessary to design strategies for a fixed packet drop fraction ɛ depending on the end-to-end delay allowed and availability of goo... |

19 |
Hiding traffic flow in communication networks
- Radosavljevic, Hajek
- 1992
(Show Context)
Citation Context ...rrelating packet departure times. Maintaining a fixed transmission schedule, however, would increase end-to-end delay and require transmission of dummy packets thereby reducing the network efficiency =-=[3]-=-. Hence, it is necessary to maximize the achievable network performance when providing route secrecy. In this work, we consider the problem of hiding information flows when the eavesdropper has access... |

19 | A Mix Route Algorithm for Mix-Net in Wireless Ad Hoc Networks
- Jiang, Vaidya, et al.
- 2005
(Show Context)
Citation Context ... randomized transmissions to prevent flow correlation in networks without latency constraints. The use of randomized routes as a countermeasure to traffic analysis attacks has also been considered in =-=[11, 12]-=-. The theoretical framework for secrecy in this work is motivated by the notion of equivocation developed by Shannon in [13]. The secrecy constraint we consider is a special case of Shannon’s equivoca... |

11 | Effective probabilistic approach protecting sensor traffic
- Hong, Wang, et al.
- 2005
(Show Context)
Citation Context ... idea of having fixed transmission schedules independent of routes has also been considered in [3,9], where the authors give bounds on the performance loss incurred due to the secrecy constraints. In =-=[10]-=-, the authors use randomized transmissions to prevent flow correlation in networks without latency constraints. The use of randomized routes as a countermeasure to traffic analysis attacks has also be... |

2 |
Detecting Steppingstone Traffic in Chaff: Fundamental Limits and Robust Algorithms
- He, Tong
- 2006
(Show Context)
Citation Context ...e best possible rate, min{CD, CB}. Similarly as CB → ∞, the maximum rate is CD for any finite ∆ and vice-versa. A special case of this result, when nodes have equal transmission rates was obtained in =-=[17]-=- under a different context. Clearly, when ∆ is finite, the transmission rates TA, TB of the nodes are strictly greater than the achievable information relay rate, thereby resulting in packet drops. Pa... |