| 2009 |
|---|
| 18 | EE | Andrew D. Ker:
Locally Square Distortion and Batch Steganographic Capacity.
IJDCF 1(1): 29-44 (2009) |
| 2008 |
|---|
| 17 | | Andrew D. Ker,
Jana Dittmann,
Jessica J. Fridrich:
Proceedings of the 10th workshop on Multimedia & Security, MM&Sec 2008, Oxford, UK, September 22-23, 2008
ACM 2008 |
| 16 | EE | Andrew D. Ker:
Perturbation Hiding and the Batch Steganography Problem.
Information Hiding 2008: 45-59 |
| 15 | EE | Andrew D. Ker,
Tomás Pevný,
Jan Kodovský,
Jessica J. Fridrich:
The square root law of steganographic capacity.
MM&Sec 2008: 107-116 |
| 14 | EE | Andrew D. Ker:
Locating steganographic payload via ws residuals.
MM&Sec 2008: 27-32 |
| 2007 |
|---|
| 13 | EE | Andrew D. Ker:
A Weighted Stego Image Detector for Sequential LSB Replacement.
IAS 2007: 453-456 |
| 12 | EE | Andrew D. Ker:
A Fusion of Maximum Likelihood and Structural Steganalysis.
Information Hiding 2007: 204-219 |
| 11 | EE | Andrew D. Ker:
The ultimate steganalysis benchmark?
MM&Sec 2007: 141-148 |
| 10 | EE | Andrew D. Ker:
Steganalysis of Embedding in Two Least-Significant Bits.
IEEE Transactions on Information Forensics and Security 2(1): 46-54 (2007) |
| 9 | EE | Andrew D. Ker:
Derivation of Error Distribution in Least Squares Steganalysis.
IEEE Transactions on Information Forensics and Security 2(2): 140-148 (2007) |
| 2006 |
|---|
| 8 | EE | Andrew D. Ker:
Batch Steganography and Pooled Steganalysis.
Information Hiding 2006: 265-281 |
| 2005 |
|---|
| 7 | EE | Andrew D. Ker:
A General Framework for Structural Steganalysis of LSB Replacement.
Information Hiding 2005: 296-311 |
| 6 | | Andrew D. Ker:
Resampling and the detection of LSB matching in color bitmaps.
Security, Steganography, and Watermarking of Multimedia Contents 2005: 1-15 |
| 2004 |
|---|
| 5 | EE | Andrew D. Ker:
Improved Detection of LSB Steganography in Grayscale Images.
Information Hiding 2004: 97-115 |
| 4 | | Andrew D. Ker:
Quantitative evaluation of pairs and RS steganalysis.
Security, Steganography, and Watermarking of Multimedia Contents 2004: 83-97 |
| 2003 |
|---|
| 3 | EE | Andrew D. Ker,
Hanno Nickau,
C.-H. Luke Ong:
Adapting innocent game models for the Böhm treelambda -theory.
Theor. Comput. Sci. 308(1-3): 333-366 (2003) |
| 2002 |
|---|
| 2 | EE | Andrew D. Ker,
Hanno Nickau,
C.-H. Luke Ong:
Innocent game models of untyped lambda-calculus.
Theor. Comput. Sci. 272(1-2): 247-292 (2002) |
| 1999 |
|---|
| 1 | | Andrew D. Ker,
Hanno Nickau,
C.-H. Luke Ong:
A Universal Innocent Game Model for the Böhm Tree Lambda Theory.
CSL 1999: 405-419 |
