Tootfinder

Five Minutes of DDoS Brings down Tor: DDoS Attacks on the Tor Directory Protocol and Mitigations
Zhongtang Luo, Jianting Zhang, Akshat Neerati, Aniket Kate
https://arxiv.org/abs/2509.10755

Five Minutes of DDoS Brings down Tor: DDoS Attacks on the Tor Directory Protocol and Mitigations
The Tor network offers network anonymity to its users by routing their traffic through a sequence of relays. A group of nine directory authorities maintains information about all available relay nodes using a distributed directory protocol. We observe that the current protocol makes a steep synchrony assumption, which makes it vulnerable to natural as well as adversarial non-synchronous communication scenarios over the Internet. In this paper, we show that it is possible to cause a failure in t…

hah, can't fire me if i don't have a job, suckers! https://mastodon.social/@PatrickoftheG/115199991716282130

email_eu: Email network (EU research inst.)
An email network (anonymized) from a large European research institution, collected from October 2003 to May 2005 (18 months). Each node corresponds to an email address, and a directed edge exists between nodes i and j, if i sent at least one message to j.
This network has 265214 nodes and 420045 edges.
Tags: Social, Communication, Unweighted

A Gentle Introduction to Blind signatures: From RSA to Lattice-based Cryptography
Aditya Bhardwaj, P\'eter Kutas
https://arxiv.org/abs/2509.02189 https://

A Gentle Introduction to Blind signatures: From RSA to Lattice-based Cryptography
Blind signatures were first introduced by David Chaum. They allow a user to have a message signed by a signer without revealing the message itself. This property is particularly useful in applications such as electronic voting and digital cash, where user anonymity is important. In a blind signature scheme, the user blinds their message before sending it to the signer, who signs the blinded message. The user then unblinds the signed message to obtain a valid signature that can be verified publi…

Computing Tree Structures in Anonymous Graphs via Mobile Agents
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla
https://arxiv.org/abs/2506.19365 ht…

Computing Tree Structures in Anonymous Graphs via Mobile Agents
Minimum Spanning Tree (MST) and Breadth-First Search (BFS) tree constructions are classical problems in distributed computing, traditionally studied in the message-passing model, where static nodes communicate via messages. This paper investigates MST and BFS tree construction in an agent-based network, where mobile agents explore a graph and compute. Each node hosts one agent, and communication occurs when agents meet at a node. We consider $n$ agents initially dispersed (one per node) in an a…

email_eu: Email network (EU research inst.)
An email network (anonymized) from a large European research institution, collected from October 2003 to May 2005 (18 months). Each node corresponds to an email address, and a directed edge exists between nodes i and j, if i sent at least one message to j.
This network has 265214 nodes and 420045 edges.
Tags: Social, Communication, Unweighted

Unveiling Unicode's Unseen Underpinnings in Undermining Authorship Attribution
Robert Dilworth
https://arxiv.org/abs/2508.15840 https://arxiv.org/pdf/2…

Unveiling Unicode's Unseen Underpinnings in Undermining Authorship Attribution
When using a public communication channel -- whether formal or informal, such as commenting or posting on social media -- end users have no expectation of privacy: they compose a message and broadcast it for the world to see. Even if an end user takes utmost precautions to anonymize their online presence -- using an alias or pseudonym; masking their IP address; spoofing their geolocation; concealing their operating system and user agent; deploying encryption; registering with a disposable phone…