International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Luke O'Connor

Publications

Year
Venue
Title
2008
EPRINT
Entropy Bounds for Traffic Confirmation
Luke O'Connor
Consider an open MIX-based anonymity system with $N$ participants and a batch size of $b$. Assume a global passive adversary who targets a given participant Alice with a set ${\cal R}_A$ of $m$ communicating partners. Let $H( {\cal R}_A \mid {\cal B}_t)$ denote the entropy of ${\cal R}_A$ as calculated by the adversary given $t$ message sets (MIX batches) where Alice is a sender in each message set. Our main result is to express the rate at which the anonymity of Alice (as measured by ${\cal R}_A$) degrades over time as a function of the main parameters $N$, $b$ and $m$.
2005
EPRINT
On the Entropy of Arcfour Keys
Luke O'Connor
This paper is a copy of IBM Research Report RZ 3019 published in 1998, which was a study of some issues related to keys of Arcfour. At the time of writing Arcfour was the common pseudonym used for RC4. Quite of a few of the results in the paper have now been superseded. We have submitted this paper to the IACR eprint archive mainly for reference purposes, since IBM research reports are not indexed in general by Google and other search engines.
1999
EUROCRYPT
1999
EUROCRYPT
1996
ASIACRYPT
1995
EUROCRYPT
1995
JOFC
1994
ASIACRYPT
1994
EUROCRYPT
1994
EUROCRYPT
1994
FSE
1994
JOFC
1994
JOFC
1993
CRYPTO
1993
EUROCRYPT
1992
EUROCRYPT
1991
EUROCRYPT