Cryptography Reference
In-Depth Information
of the 8th workshop on Multimedia and security
,pages
164-174, New York, NY, USA, 2006. ACM.
[TTTD06]
Cuneyt M. Taskiran, Umut Topkara, Mercan Topkara,
and Edward J. Delp. Attacks on lexical natural language
steganography systems. In
Proceedings of the SPIE In-
ternational Conference on Security, Steganography, and
Watermarking of Multimedia Contents
, January 2006.
[Tur36a]
Alan Turing. On computable numbers with an applica-
tion to the entscheidungsproblem.
Proceedings of the
London Math Soceity
, 2(42):230-265, 1936.
[Tur36b]
Alan Turing. On computable numbers with an applica-
tion to the entscheidungsproblem.
Proceedings of the
London Math Soceity
, 2(43):544-546, 1936.
[vAH04]
Luis von Ahn and Nicholas J. Hopper. Public-key steg-
anography. In Christian Cachin and Jan Camenisch,
editors,
EUROCRYPT
, volume 3027 of
Lecture Notes in
Computer Science
, pages 323-341. Springer, 2004.
[Val84]
Leslie G. Valient. A theory of the learnable.
Communi-
cations of the ACM
, 27:1134-1142, 1984.
[VR05]
Alexis De Vos and Yvan Van Rentergem. Reversible com-
puting: frommathematical group theory to electronical
circuit experiment. InBagherzadeh et al. [BVR05], pages
35-44.
[Wal94]
John Walker. Steganosaurus. cir-
culating on the web, December 1994.
http://www.fourmilab.ch/stego/stego.shar.gz
,
accessed 2005-03-25.
[Wal95a]
S. Walton. Information authentication for a slippery
new age.
Dr. Dobbs Journal
, 20(4):18-26, April 1995.
[Wal95b]
SteveWalton. Image authentification for a slippery new
age.
Dr. Dobbs Journal
, Apr 1995.
[Way85]
Peter Wayner. Building a travesty tree.
BYTE
, page 183,
September 1985.
[Way92]
Peter C. Wayner. Content-addressable search engines
and DES-like systems. In
Advances in Cryptology:
CRYPTO '92 Lecture Notes in Computer Science, volume
740
, pages 575-586, New York, 1992. Springer-Verlag.
