- Thanks to @RotoPenguin for pointing out that CD-ROM data is spirally
recorded, so consecutive layout really does minimize track-to-track
movement (to zero!). In any case, increasing the FPS would have
still exceeded the drive's transfer rate.
- In the EICAR and tech report versions (but not the journal paper),
Table 1 has an incorrect value for the time taken to compute the
salt for "aycock" using MD5. It should be 68955s
instead of 39615s. The average is correct as given, however.
- In the EICAR version, the maximum path length in the Enron graph
was 11, not 15. The median path length is still 8.
- Some previous "work" was omitted: MarketScore also installed
its own root certificate. However, the CA name wasn't
camouflaged at all, and proxy software remained installed on
- Some older papers that should have been cited as related work, but I
only tripped across them afterward. Apologies for the omissions.
- S. R. White. Covert Distributed Processing with Computer Viruses.
CRYPTO '89, pp. 616-619.
- D. Atkins, M. Graff, A. K. Lenstra, and P. C. Leyland.
The Magic Words are Squeamish Ossifrage.
Asiacrypt '94 (LNCS 917), pp. 263-277.
- The HTMLification of reference 1 should be credited to Greg Chance.
- One of the references, Yu07, got deleted accidentally. The reference
should be: H. Yu and P. Moreno, Using speech recognition to determine
advertisements relevant to audio content and/or audio content
relevant to advertisements,
United States Patent Application 20070078708, 2007.
- I found this much older paper that should be considered related work.
We started in a similar place, idea-wise, although ended up someplace
- H. Thimbleby. Can Viruses Ever Be Useful?
Computers & Security 10 (2), 1991, pp. 111-114.
- Following Thimbleby's old publications further, I found this paper
that should be considered related work here:
- I. H. Witten, H. W. Thimbleby, G. Coulouris, and S. Greenberg.
Liveware: a new approach to sharing data in social networks.
Int. J. Man-Machine Studies 34, 1991, pp. 337-348.