scispace - formally typeset
G

George Danezis

Researcher at University College London

Publications -  213
Citations -  12903

George Danezis is an academic researcher from University College London. The author has contributed to research in topics: Anonymity & Traffic analysis. The author has an hindex of 59, co-authored 209 publications receiving 11516 citations. Previous affiliations of George Danezis include University of Cambridge & Microsoft.

Papers
More filters
Proceedings ArticleDOI

Route Fingerprinting in Anonymous Communications

TL;DR: This work discusses the problem, which occurred in the initial design of Tarzan, and other related problems from the literature, when systems are large, and individual nodes only gain random knowledge of part of the network.
Proceedings ArticleDOI

The bayesian traffic analysis of mix networks

TL;DR: This work casts the traffic analysis of anonymity systems, and in particular mix networks, in the context of Bayesian inference, and builds an Markov Chain Monte Carlo inference engine, that calculates the probabilities of who is talking to whom given an observation of network traces.
Book ChapterDOI

Introducing Traffic Analysis

TL;DR: Civilian infrastructures, on which state and economic actors are increasingly reliant, are ever more vulnerable to traffic analysis: wireless and GSM telephony are replacing traditional systems, routing is transparent and protocols are overlaid over others – giving plenty of opportunity to observe, and take advantage of the traffic data.
Journal Article

Towards a Mechanism for Discretionary Overriding of Access Control. Authors' reply

TL;DR: In this paper, the authors suggest the use of an access control policy language which allows for override of denied access in some cases for increased flexibility, and they suggest that the overrides should be audited and the policy can be used for finding the people who should perform the audit.

Vida: How to use bayesian inference to de-anonymize persistent communications

TL;DR: The Red-Blue model of the Vida family of abstractions of anonymous communication systems is evaluated to find that it is competitive with other established long-term traffic analysis attacks, while additionally providing reliable error estimates, and being more flexible and expressive.