These documents are included only to ensure timely
dissemination of the authors' research. All rights are retained by the
author or other copyright holder, even though the works are offered
for download here. By downloading one of these documents, you agree to
adhere to the terms of the copyright holder, without whose explicit
consent they may not be reposted.
| [1] | Andrew D. Ker, Hanno Nickau, and C.-H. Luke Ong. Innocent game models of untyped lambda-calculus.
Theoretical Computer Science, 272:247-292, 2002.
|
| [2] | Andrew D. Ker. A universal innocent game model for the bohm tree lambda theory.
In
Computer Science Logic: Proceedings of the 8th Annual Conference of the
EACSL, volume 1683 of LNCS, pages 405-419. Springer, 1999.
|
| [3] | Andrew D. Ker. Innocent game models of untyped lambda-calculus.
DPhil Thesis, Oxford University, 2000.
|
| [4] | Andrew D. Ker, Hanno Nickau, and C.-H. Luke Ong. Adapting game models for the böhm tree lambda-theory.
Theoretical Computer Science, 308:333-366, 2003.
|
| [6] | Andrew D. Ker. An idea for a blind watermarking scheme resistant to StirMark.
Programming Research Group Research Report RR-01-14. Oxford
University Computing Laboratory, 2001.
|
| [8] | Andrew D. Ker. Quantitive evaluation of Pairs and RS steganalysis.
In Security,
Steganography, and Watermarking of of Multimedia Contents VI, volume 5306
of Proc. SPIE, pages 83-97. SPIE, 2004.
Slides of conference presentation. |
| [9] | Andrew D. Ker. Improved detection of LSB steganography in grayscale images.
In Proc. 6th Information Hiding
Workshop, volume 3200 of LNCS, pages 97-115. Springer, 2004.
Slides of conference presentation. |
| [10] | Andrew D. Ker. Steganalysis of LSB matching in grayscale images.
IEEE Signal Processing Letters, 12(6):441-444, 2005.
|
| [11] | Andrew D. Ker. Resampling and the detection of LSB matching in colour bitmaps.
In Security,
Steganography, and Watermarking of of Multimedia Contents VII, volume 5681
of Proc. SPIE, pages 1-15. SPIE, 2005.
Slides of conference presentation. |
| [13] | Andrew D. Ker. A general framework for the structural steganalysis of LSB
replacement.
In Proc. 7th Information
Hiding Workshop, volume 3727 of LNCS, pages 296-311. Springer,
2005.
Slides of conference presentation. |
| [14] | Andrew D. Ker. Fourth-order structural steganalysis and analysis of cover
assumptions.
In Security,
Steganography, and Watermarking of of Multimedia Contents VIII, volume
6072 of Proc. SPIE, pages 25-38. SPIE, 2006.
Slides of conference presentation. |
| [15] | Andrew D. Ker. A two-factor error model for quantitative steganalysis.
In Security,
Steganography, and Watermarking of of Multimedia Contents VIII, volume
6072 of Proc. SPIE, pages 59-74. SPIE, 2006.
Slides of conference presentation. |
| [18] | Andrew D. Ker. Batch steganography and pooled steganalysis.
In Proc. 8th Information Hiding Workshop, volume 4437
of LNCS, pages 265-281. Springer, 2006.
Slides of conference presentation. |
| [20] | Andrew D. Ker. Steganalysis of embedding in two least significant bits.
IEEE Transactions on Information Forensics and Security,
2(1):46-54, 2007.
|
| [21] | Andrew D. Ker. Batch steganography and the threshold game.
In Security,
Steganography, and Watermarking of of Multimedia Contents IX, volume 6505
of Proc. SPIE, pages 0401-0413. SPIE, 2007.
Slides of conference presentation. |
| [22] | Andrew D. Ker. Derivation of error distribution in least-squares steganalysis.
IEEE Transactions on Information Forensics and Security,
2(2):140-148, 2007.
|
| [23] | Andrew D. Ker. Optimally weighted least-squares steganalysis.
In Security,
Steganography, and Watermarking of of Multimedia Contents IX, volume 6505
of Proc. SPIE, pages 0601-0616. SPIE, 2007.
Slides of conference presentation. |
| [24] | Andrew D. Ker. A capacity result for batch steganography.
IEEE Signal Processing Letters, 14(8):525-528, 2007.
|
| [25] | Andrew D. Ker. Benchmarking steganalysis.
In Multimedia Forensics and
Security, pages 266-290. IGI Global, 2009.
|
| [26] | Andrew D. Ker. A fusion of maximum likelihood and structural steganalysis.
In Proc. 9th Information Hiding Workshop, volume
4567 of LNCS, pages 204-219. Springer, 2007.
Slides of conference presentation. |
| [27] | Andrew D. Ker. A Weighted Stego Image detector for sequential LSB
replacement.
In Proc. 2007 International Workshop on Data Hiding for
Information and Multimedia Security, part of IAS 2007, pages 453-456.
IEEE Computer Society, 2007.
Slides of conference presentation. |
| [28] | Andrew D. Ker. The ultimate steganalysis benchmark.
In Proc. 9th ACM Workshop on Multimedia and
Security, pages 141-148. ACM, 2007.
Slides of conference presentation. |
| [29] | Andrew D. Ker. Steganographic strategies for a square distortion function.
In Security, Forensics, Steganography, and Watermarking
of Multimedia Contents X, volume 6819 of Proc. SPIE, pages
0401-0413. SPIE, 2008.
Slides of conference presentation. |
| [30] | Andrew D. Ker and Rainer Böhme. Revisiting weighted stego-image steganalysis.
In Security, Forensics, Steganography, and Watermarking
of Multimedia Contents X, volume 6819 of Proc. SPIE, pages
0501-0517. SPIE, 2008.
Slides of conference presentation. |
| [31] | Andrew D. Ker. Perturbation hiding and the batch steganography problem.
In
Proc. 10th Information Hiding Workshop, volume 5284 of LNCS,
pages 45-59. Springer, 2008.
Slides of conference presentation. |
| [32] | Andrew D. Ker, Tomas Pevný, Jan Kodovský, and Jessica Fridrich. The square root law of steganographic capacity.
In
Proc. 10th ACM Workshop on Multimedia and Security, pages 107-116. ACM,
2008.
Slides of conference presentation. |
| [33] | Andrew D. Ker. Locating steganographic payload via WS residuals.
In
Proc. 10th ACM Workshop on Multimedia and Security, pages 27-32. ACM,
2008.
Slides of conference presentation. |
| [34] | Andrew D. Ker. Locally square distortion and batch steganographic capacity.
International Journal of Digital Crime and Forensics,
1(1):29-44, 2009.
Invited article for inaugural issue. Linked document is not the version in print.
|
| [35] | Andrew D. Ker and Ivans Lubenko. Feature reduction and payload location with WAM steganalysis.
In Media Forensics and Security XI, volume 7254 of
Proc. SPIE, pages 0A01-0A13. SPIE, 2009.
Slides of conference presentation. |
| [36] | Tomas Filler, Andrew D. Ker, and Jessica Fridrich. The square root law of steganographic capacity for Markov covers.
In Media Forensics and Security XI, volume 7254 of
Proc. SPIE, pages 0801-0811. SPIE, 2009.
Winner of the Digital Watermarking Alliance best paper award.
Slides of conference presentation. |
| [37] | Tomas Pevný, Jessica Fridrich, and Andrew D. Ker. From blind to quantitative steganalysis.
In Media Forensics and Security XI, volume 7254 of
Proc. SPIE, pages 0C01-0C14. SPIE, 2009.
Slides of conference presentation. |
| [38] | Andrew D. Ker. Estimating steganographic Fisher Information in real images.
In Proc.
11th Information Hiding Workshop, volume 5806 of LNCS, pages 73-88.
Springer, 2009.
Slides of conference presentation. Slides of rump session talk comparing this work with that by Filler & Fridrich. |
| [39] | Andrew D. Ker. Estimating the information theoretic optimal stego noise.
In
Proc. 8th International Workshop on Digital Watermarking, volume
5703 of LNCS, pages 184-198. Springer, 2009.
Winner of the workshop best paper award.
Slides of conference presentation. |
| [40] | Andrew D. Ker. The Square Root Law requires a linear key.
In Proc. 11th ACM Workshop on Multimedia and
Security, pages 85-92. ACM, 2009.
Slides of conference presentation. |
| [41] | Tomas Pevný, Jessica Fridrich, and Andrew D. Ker. From blind to quantitative steganalysis.
IEEE Transactions on Information Forensics and Security,
2(7):445-454, 2012.
|
| [42] | Andrew D. Ker. The Square Root Law in stegosystems with imperfect information.
In Proc. Information Hiding, 12th International Conference,
volume 6387 of LNCS, pages 145-160. Springer, 2010.
Slides of conference presentation. |
| [43] | Andrew D. Ker. The Square Root Law does not require a linear key.
In
Proc. 12th ACM Workshop on Multimedia and Security, pages 213-223. ACM,
2010.
Slides of conference presentation. |
| [44] | Andrew D. Ker. The uniform prior and zero information: A Technical Note.
Research Report CS-RR-10-06. Oxford University Department of
Computer Science, 2010.
|
| [45] | Andrew D. Ker. A curiosity regarding steganographic capacity of pathologically
nonstationary sources.
In Media Watermarking, Security, and Forensics
XIII, volume 7880 of Proc. SPIE, pages 0E01-0E12. SPIE, 2011.
Slides of conference presentation. |
| [46] | Ivans Lubenko and Andrew D. Ker. Steganalysis using logistic regression.
In Media Watermarking, Security, and Forensics
XIII, volume 7880 of Proc. SPIE, pages 0K01-0K11. SPIE, 2011.
Slides of conference presentation. |
| [47] | Ventsislav K. Chonev and Andrew D. Ker. Feature restoration and distortion metrics.
In Media Watermarking, Security, and Forensics
XIII, volume 7880 of Proc. SPIE, pages 0G01-0G14. SPIE, 2011.
Slides of conference presentation. |
| [48] | Andrew D. Ker and Tomas Pevný. A new paradigm for steganalysis via clustering.
In Media Watermarking, Security, and Forensics
XIII, volume 7880 of Proc. SPIE, pages 0U01-0U13. SPIE, 2011.
Slides of conference presentation. |
| [49] | Andrew D. Ker. Stability of the Mahalanobis Distance: A Technical Note.
Research Report CS-RR-10-20. Oxford University Department of
Computer Science, 2010.
|
| [50] | Ivans Lubenko and Andrew D. Ker. Going from small to large data in steganalysis.
In Media Watermarking, Security, and Forensics XIV, volume
8303 of Proc. SPIE, pages 0M01-0M10. SPIE, 2012.
Slides of conference presentation. |
| [51] | Andrew D. Ker and Tomas Pevný. Identifying a steganographer in realistic and heterogeneous data
sets.
In Media Watermarking, Security, and Forensics XIV, volume
8303 of Proc. SPIE, pages 0N01-0N13. SPIE, 2012.
Slides of conference presentation. |
| [---] | Andrew D. Ker. Lambda Calculus and Types.
Lecture notes (150pp), Hilary Term 2009. See the course website
for slides and up-to-date course material.
|
| [---] | Andrew D. Ker. Discrete Mathematics.
Lecture notes (125 pp), Michaelmas Term 2010. See the course
website for slides and up-to-date course material.
|
| [---] | Andrew D. Ker. Computer Security.
Lecture notes (142 pp), Michaelmas Term 2011. See the course
website for slides and up-to-date course material.
|
The numbers beside each publication refer to my own private numbering system for papers.
Since some projects were merged or abandoned, the numbers are not consecutive. Red links indicate documents currently unavailable.
