MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "George Danezis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 47 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Traffic Analysis of the HTTP Protocol over TLS  
  • by George Danezis —
  • … We analyze attacks that take advantage of the data length information leaked by HTTP transactions over the TLS protocol, in order to link clients with particular resources they might access on a web site. The threat model considered is a public news site that tries to protect the patterns of reque…
  • Cited by 7 (2 self) – Add To MetaCart
  • Forward Secure Mixes  
  • by George Danezis — 2002 — Nordic workshop on Secure IT Systems (Norsec 2002
  • …New threats such as compulsion to reveal logs, secret and private keys as well as to decrypt material are studied in the context of the security of mix networks. After a comparison of this new threat model with the traditional one, a new construction is introduced, the fs-mix, that minimizes the imp…
  • Cited by 2 (2 self) – Add To MetaCart
  • B.: Minx: a simple and efficient anonymous packet format  
  • by George Danezis — 2004 — In: Proceedings of the 2004 ACM workshop on Privacy in the electronic society
  • …Minx is a cryptographic message format for encoding anonymous messages, relayed through a network of Chaumian mixes. It provides security against a passive adversary by completely hiding correspondences between input and output messages. Possibly corrupt mixes on the message path gain no information…
  • Cited by 9 (5 self) – Add To MetaCart
  • Mix-networks with Restricted Routes  
  • by George Danezis — 2003 — Proceedings of Privacy Enhancing Technologies workshop (PET 2003). SpringerVerlag, LNCS 2760
  • …We present a mix network topology that is based on sparse expander graphs, with each mix only communicating with a few neighbouring others. We analyse the anonymity such networks provide, and compare it with fully connected mix networks and mix cascades. We prove that such a topology is efficient si…
  • Cited by 29 (6 self) – Add To MetaCart
  • Statistical Disclosure Attacks: Traffic Confirmation in Open Environments  
  • by George Danezis — 2003 — Proceedings of Security and Privacy in the Age of Uncertainty, (SEC2003
  • …An improvement over the previously known disclosure attack is presented that allows, using statistical methods, to effectively deanonymize users of a mix system. Furthermore the statistical disclosure attack is computationally efficient, and the conditions for it to be possible and accurate are much…
  • Cited by 28 (5 self) – Add To MetaCart
  • The Traffic Analysis of Continuous-Time Mixes  
  • by George Danezis — 2004 — In Proceedings of Privacy Enhancing Technologies workshop (PET 2004), LNCS
  • …We apply the information-theoretic anonymity metrics to continuous-time mixes, that individually delay messages instead of batching them. The anonymity of such mixes is measured based on their delay characteristics, and as an example the exponential mix (sg-mix) is analysed, simulated and shown to u…
  • Cited by 33 (4 self) – Add To MetaCart
  • Route fingerprinting in anonymous communications  
  • by George Danezis — 2006 — In Peer-to-Peer Computing
  • …Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only gain random knowledge of part of the network, their traffic can be detected by the uniqueness of the information they hav…
  • Cited by 8 (3 self) – Add To MetaCart
  • unknown title  
  • by George Danezis
  • …The least privacy-damaging centralised traffic data retention architecture (Extended abstract)…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB