activity
20052023
most citedPractical Traffic Analysis Attacks on Secure Messaging Applications

39 citations · 62 across the 11 of their papers we have counts for

collaborators
Showing cs.NIShow all

6 papers · 1 filter

cs.NI2018

Fundamental Limits of Covert Bit Insertion in Packets

Ramin Soltani, Dennis Goeckel, Don Towsley +1

Covert communication is necessary when revealing the mere existence of a message leaks sensitive information to an attacker. Consider a network link where an authorized transmitter…

cs.NI2018

Fundamental Limits of Invisible Flow Fingerprinting

Ramin Soltani, Dennis Goeckel, Don Towsley +1

Network flow fingerprinting can be used to de-anonymize communications on anonymity systems such as Tor by linking the ingress and egress segments of anonymized connections. Assume…

cs.NI2018

Multi-Hop Routing in Covert Wireless Networks

Azadeh Sheikholeslami, Majid Ghaderi, Don Towsley +3

In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distan…

cs.NI201710 cited

Energy-Efficient Secrecy in Wireless Networks Based on Random Jamming

Azadeh Sheikholeslami, Majid Ghaderi, Hossein Pishro-Nik +1

This paper considers secure energy-efficient routing in the presence of multiple passive eavesdroppers. Previous work in this area has considered secure routing assuming probabilis…

cs.NI20131 cited

Efficient Wireless Security Through Jamming, Coding and Routing

Majid Ghaderi, Dennis Goeckel, Ariel Orda +1

There is a rich recent literature on how to assist secure communication between a single transmitter and receiver at the physical layer of wireless networks through techniques such…

cs.NI2005

An Improved Lower Bound to the Number of Neighbors Required for the Asymptotic Connectivity of Ad Hoc Networks

Sanquan Song, Dennis L. Goeckel, Don Towsley

Xue and Kumar have established that the number of neighbors required for connectivity of wireless networks with N uniformly distributed nodes must grow as log(N), and they also est…