Skip header Section
Skip Bibliometrics Section
Disappearing Cryptography: Information Hiding: Steganography & WatermarkingDecember 2008
- Author:
- Peter Wayner
Skip Abstract Section
Abstract
Cryptology is the practice of hiding digital information by means of various obfuscatory and steganographic techniques. The application of said techniques facilitates message confidentiality and sender/receiver identity authentication, and helps to ensure the integrity and security of computer passwords, ATM card information, digital signatures, DVD and HDDVD content, and electronic commerce. Cryptography is also central to digital rights management (DRM), a group of techniques for technologically controlling the use of copyrighted material that is being widely implemented and deployed at the behest of corporations that own and create revenue from the hundreds of thousands of mini-transactions that take place daily on programs like iTunes. This new edition of our best-selling book on cryptography and information hiding delineates a number of different methods to hide information in all types of digital media files. These methods include encryption, compression, data embedding and watermarking, data mimicry, and scrambling. During the last 5 years, the continued advancement and exponential increase of computer processing power have enhanced the efficacy and scope of electronic espionage and content appropriation. Therefore, this edition has amended and expanded outdated sections in accordance with new dangers, and includes 5 completely new chapters that introduce newer more sophisticated and refined cryptographic algorithms and techniques (such as fingerprinting, synchronization, and quantization) capable of withstanding the evolved forms of attack. Each chapter is divided into sections, first providing an introduction and high-level summary for those who wish to understand the concepts without wading through technical explanations, and then presenting concrete examples and greater detail for those who want to write their own programs. This combination of practicality and theory allows programmers and system designers to not only implement tried and true encryption procedures, but also consider probable future developments in their designs, thus fulfilling the need for preemptive caution that is becoming ever more explicit as the transference of digital media escalates. * Includes 5 completely new chapters that delineate the most current and sophisticated cryptographic algorithms, allowing readers to protect their information against even the most evolved electronic attacks. * Conceptual tutelage in conjunction with detailed mathematical directives allows the reader to not only understand encryption procedures, but also to write programs which anticipate future security developments in their design. * Grants the reader access to online source code which can be used to directly implement proven cryptographic procedures such as data mimicry and reversible grammar generation into their own work.
- James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, and Sheng Zhong. Towards a theory of data entanglement. In Proceedings of the 2004 European Symposium on Research in Computer Security , 2004.Google Scholar
Cross Ref
- National Security Agency. N.S.A. press release: Venona documents released. Technical report, National Security Agency, July 1995.Google Scholar
- A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms . Addison-Wesley, Reading, MA, 1983. Google Scholar
- Dana Angluin and Michael Kharitonov. When won't membership queries help? In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing , pages 444-454. ACMPress, 1991. to appear in JCSS . Google Scholar
- S. Areepongsa, N. Kaewkamnerd, Y. F. Syed, and K.R.Rao. Exploring steganography for low bit rate wavelet based coder in image retrieval system. In Proceedings of TENCOM '00 , volume 3, pages 250-255, Kuala Lumpur, Malaysia, September 2000.Google Scholar
- Mikhail J. Atallah, Craig J. McDonough, Victor Raskin, and Sergei Nirenburg. Natural language processing for information assurance and security: an overview and implementations. In NSPW '00: Proceedings of the 2000 workshop onNew security paradigms , pages 51-65, New York, NY, USA, 2000. ACM. Google Scholar
- R. Anderson. The eternity service, 1996.Google Scholar
- Ross J. Anderson, editor. Information Hiding, First International Workshop, Cambridge, U.K., May 30 - June 1, 1996, Proceedings , volume 1174 of Lecture Notes in Computer Science . Springer, 1996.Google Scholar
- Ross J. Anderson. Stretching the limits of steganography. In Information Hiding [And96b], pages 39-48. Google Scholar
- Ross J. Anderson. Security Engineering: A Guide to Building Dependable Distributed Systems . John Wiley and Sons, 2001. Google Scholar
- Nate Anderson. Steroid bust shows feds can still get at 'private' and 'secure' e-mail. Ars Technica.com , November 2007.Google Scholar
- Ross Anderson, Roger Needham, and Adi Shamir. The steganographic file system. In IWIH: International Workshop on Information Hiding , 1998.Google Scholar
- Ross Anderson and Fabien Petitcolas. On the limits of steganography. IEEE Journal on Selceted Areas in Communications , pages 474-481, May 1998.Google Scholar
- Benjamin Arazi. A Commonsense Approach to the Theory of Error Correcting Codes . MIT Press, Cambridge, MA, 1988.Google Scholar
- Mikhail J. Atallah, Victor Raskin, Michael Crogan, Christian Hempelmann, Florian Kerschbaum, Dina Mohamed, and Sanket Naik. Natural language watermarking: Design, analysis, and a proof-of-concept implementation. In Ira S. Moskowitz, editor, Information Hiding: Fourth International Workshop , volume 2137 of Lecture Notes in Computer Science , pages 185-199. Springer, April 2001. Google Scholar
- Mikhail J. Atallah, Victor Raskin, Christian F. Hempelmann, Mercan Karahan, Radu Sion, Umut Topkara, and Katrina E. Triezenberg. Natural language watermarking and tamperproofing. In Fabien A. P. Petitcolas, editor, Information Hiding: Fifth International Workshop , volume 2578 of Lecture Notes in Computer Science , pages 196-212. Springer, October 2002. Google Scholar
- Mikhail J. Atallah, Victor Raskin, Christian Hempelmann, Mercan Karahan, Radu Sion, Umut Topkara, and Katrina E. Triezenberg. Natural language watermarking and tamperproofing. In IH '02: Revised Papers from the 5th International Workshop on Information Hiding , pages 196-212, London, UK, 2003. Springer-Verlag. Google Scholar
- Tuomas Aura. Invisible communication. Technical report, Helsinki University of Technology, November 1995.Google Scholar
- Michael F. Barnsley. Fractal modelling of real world images. In Heinz-Otto Peitgen and Dietmar Saupe, editors, The Science of Fractal Images , chapter 5, pages 219-239. Springer-Verlag, 1988. Google Scholar
- Michael F. Barnsley. Fractals Everywhere . Academic Press, Cambridge, MA, USA, 2nd edition, 1993. Google Scholar
- Mihir Bellare and Alexandra Boldyreva. The security of chaffing and winnowing. In ASIACRYPT , pages 517-530, 2000. Google Scholar
- Mihir Bellare and Alexandra Boldyreva. The security of chaffing and winnowing. In ASIACRYPT '00: Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security , pages 517-530, London, UK, 2000. Springer-Verlag. Google Scholar
- S. Blackburn, S. Blake-Wilson, M. Burmester, and S. Galbraith. Shared generation of shared rsa keys. Technical Report CORR98-19, Department of Combinatorics and Optimization, University of Waterloo, 1998.Google Scholar
- Michael Backes and Christian Cachin. Public-key steganography with active attacks. In Joe Kilian, editor, TCC , volume 3378 of Lecture Notes in Computer Science , pages 210-226. Springer, 2005.Google Scholar
- Mihir Bellare, Ran Canetti, and Hugo Krawczyk. Keying hash functions for message authentication. Lecture Notes in Computer Science , 1109:1-??, 1996. Google Scholar
- Mihir Bellare, Ran Canetti, and Hugo Krawczyk. Message authentication using hash functions: the HMAC construction. CryptoBytes , 2(1):12-15, Spring 1996.Google Scholar
- Krista Bennett. Linguistic steganography: Survey, analysis, and robustness concerns for hiding information in text. Research paper accepted in partial fulfillment of the Dept. of Linguistics preliminary examination requirement, 05 2004. CERIAS TR 2004-13.Google Scholar
- D. Boneh and M. Franklin. Efficient generation of shared RSA keys. Lecture Notes in Computer Science, CRYPTO 97 , 1294:425-439, 1997. Google Scholar
- I.F. Blake, R. Fuji-Hara, R.C. Mullin, and S.A. Vanstone. Computing logarithms in finite fields of characteristic two. SIAM Journal on Algebraic Discrete Methods , 5, 1984.Google Scholar
- Nikita Borisov and Philippe Golle, editors. Privacy Enhancing Technologies, 7th International Symposium, PET 2007 Ottawa, Canada, June 20-22, 2007, Revised Selected Papers , volume 4776 of Lecture Notes in Computer Science . Springer, 2007. Google Scholar
- Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In Proceedings of Crypto 2001, Springer Verlag LNCS Volume 2139 , 2001. Google Scholar
- Walter Bender, D. Gruhl, N. Morimoto, and A. Lu. Techniques for data hiding. IBM Systems Journal , 35(3):313, 1996. Google Scholar
- M. Barnsley and L. Hurd. Fractal Image Compression . AK Peters, Ltd., Wellesley, Ma., 1992. Google Scholar
- Dan Boneh, Antoine Joux, and Phong Q. Nguyen. Why textbook elgamal and RSA encryption are insecure. In ASIACRYPT '00: Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security , pages 30-43, London, UK, 2000. Springer-Verlag. Google Scholar
- F.P. Brooks, A.L Hopkins Jr., Peter G. Neumann, and W.V. Wright. An experiment in musical composition. EC- 6(3), September 1957.Google Scholar
- Charles Bennett and Rolf Landauer. The fundamental physical limits of computation. Scientific American , pages 48-56, July 1985.Google Scholar
- J Brassil, S Low, N Maxemchuk, and L O'Garman. Electronic marking and identification techniques to discourage document copying. In Proceedings of IEEE Infocom 94 , pages 1278-1287, 1994.Google Scholar
- Jack Brassil, Steve Low, Nicholas Maxemchuk, and Larry O'Gorman. Hiding information in document images. In Proceedings of the 1995 Conference on Information Sciences and Systems , March 1995.Google Scholar
- M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. Proceedings of the 24th IEEE Computer Conference (CompCon) , 1982.Google Scholar
- Adam Back, UlfMoeller, and Anton Stiglic. Traffic analysis attacks and trade-offs in anonymity providing systems. In Fourth Information Hiding Workshop , pages 257-269, 2001. Google Scholar
- Jack Brassil and Larry O'Gorman. Watermarking document images with bounding box expansion. In Information Hiding, Lecture Notes of Computer Science (1174) , New York, Heidelberg, 1996. Springer-Verlag. Google Scholar
- C. Boyd. A new multiple key cipher and an improved voting scheme. In Advances in Cryptology-EUROCRYPT '89 Proceedings . Springer-Verlag, 1990. Google Scholar
- S.A. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CSR9323, Computer Science Department, CWI, Mar 1993. Google Scholar
- Stefan A. Brands. Rethinking Publike Key Infrastructure and Digital Certificates- Building in Privacy . PhD thesis, Centrum voor Wiskunde en Informatica, Amsterdam, 1995.Google Scholar
- Stefan A. Brands. Secret-key certificates. Technical Report CS-R9510, Centrum voor Wiskunde en Informatica, Amsterdam, 1995. Google Scholar
- E.F. Brickell. A fast modular multiplication algorithm with applications to two key cryptography. In Advances in Cryptology: Proceedings of Crypto 82 . Plenum Press, 1982.Google Scholar
- Michael F. Barnsley and Alan D. Sloan. A better way to compress images. Byte Magazine , pages 215-223, January 1988. Google Scholar
- D Boneh and J Shaw. Collusion-secure fingerprinting for digital data. In 15th Annual International Cryptology Conference , number 963, pages 452-465, Santa Barbara, California, U.S.A., 27-31 1995. Google Scholar
- R.W. Buccigrossi and E.P. Simoncelli. Image compression via joint statistical characterization in the wavelet domain. IEEE Transactions on Image Processing , 8(12):1688-1701, 1999.Google Scholar
- Sevinc Bayram, Husrev T. Sencar, Nasir D. Memon, and Ismail Avcibas. Source camera identification based on cfa interpolation. In ICIP (3) , pages 69-72, 2005.Google Scholar
- Nader Bagherzadeh, Mateo Valero, and Alex Ramírez, editors. Proceedings of the Second Conference on Computing Frontiers, 2005, Ischia, Italy, May 4-6, 2005 . ACM, 2005. Google Scholar
- J.C. Benaloh and M. Yung. Distributing the power of government to enhance the privacy of voters. Proceedings of the 5th ACM Symposium on the Principles in Distributed Computing , 1986. Google Scholar
- Lorrie Cranor and R. Cytron. Design and implementation of a practical security-conscious electronic polling system. Technical Report WUCS-96-02, Washington University Department of Computer Science, St. Louis, 1996.Google Scholar
- Jan Camenisch, Christian S. Collberg, Neil F. Johnson, and Phil Sallee, editors. Information Hiding, 8th International Workshop, IH 2006, Alexandria, VA, USA, July 10-12, 2006. Revised Selected Papers , volume 4437 of Lecture Notes in Computer Science . Springer, 2007. Google Scholar
- Mark Chapman and George Davida. Hiding the hidden: A software system for concealing ciphertext as innocuous text. In International Conference on Information and Computer Security (ICICS'97) , Beijing, P.R. China, November 1997. Google Scholar
- David Chaum, Amos Fiat, and Moni Naor. Untraceable electronic cash. In Proceedings of Crypto 88 , page 319, New York, Berlin, Heidelberg, London, Paris, Tokyo, 1993. Springer-Verlag. Google Scholar
- D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM , 24(2), Feb 1981. Google Scholar
- David Charlap. The bmp file format, part i. Dr. Dobbs Journal , Mar 1995.Google Scholar
- David Charlap. The bmp file format, part ii. Dr. Dobbs Journal , Apr 1995.Google Scholar
- Brian Chen. Design and Analysis of Digital Watermarking, Information Embedding, and Data Hiding Systems . PhD thesis, MIT, Cambridge, MA, June 2000. Google Scholar
- Ingemar J. Cox, Ton Kalker, and Heung-Kyu Lee, editors. Digital Watermarking, Third International Workshop, IWDW 2004, Seoul, SouthKorea, October 30 - November 1, 2004, Revised Selected Papers , volume 3304 of Lecture Notes in Computer Science . Springer, 2005. Google Scholar
- Ingemar Cox, Joe Kilian, Tom Leighton, and Talal Shamoon. A secure, robust watermark for multimedia. In Information Hiding, Lecture Notes of Computer Science (1174) , New York, Heidelberg, 1996. Springer-Verlag. Google Scholar
- R. C. Chakinala, Abishek Kumarasubramanian, R. Manokaran, G. Noubir, C. Pandu Rangan, and Ravi Sundaram. Steganographic communication in ordered channels. In Camenisch et al. [CCJS07], pages 42-57. Google Scholar
- F. Clarke. Optimization and Nonsmooth Analysis . John Wiley, New York, 1983.Google Scholar
- Ian Clarke. A distributed decentralised information storage and retrieval system. Technical report, Division of Informatics, University of Edinborough, 1999.Google Scholar
- Noam Chomsky and G.A. Miller. Finite state languages. Information and Control , 1:91-112, 1958.Google Scholar
- Ingemar J. Cox and Matt L. Miller. A review of watermarking and the importance of perceptualmodeling. In Proc. of Electronic Imaging '97 , February 1997.Google Scholar
- Camenisch and Michels. A group signature scheme with improved efficiency. In ASIACRYPT: Advances in Cryptology - ASIACRYPT: International Conference on the Theory and Application of Cryptology . LNCS, Springer-Verlag, 1998. Google Scholar
- Ingemar J. Cox, Matthew L. Miller, and Jeffrey A. Bloom. Digital Watermarking . Morgan Kaufman, San Fransisco, CA, 2001.Google Scholar
- Ingemar Cox, Matthew L. Miller, and Jeffery A. Bloom. Digital watermarking . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2002. Google Scholar
- Ingemar Cox, Matthew L. Miller, and Jeffery A. Bloom. Digital watermarking and Steganography . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2007. Google Scholar
- Ingemar J. Cox, Matthew Miller, Jeffrey Bloom, and Jessica Fridrich. Digital Watermarking . MorganKaufman, San Francisco, CA, 2008.Google Scholar
- Don Coppersmith. Another birthday attack. In Hugh C. Williams, editor, CRYPTO , volume 218 of Lecture Notes in Computer Science , pages 14-17. Springer, 1985. Google Scholar
- Michael Crichton. Jurassic Park . Knopf, New York, 1990.Google Scholar
- I. Clarke, O. Sandberg, B. Wiley, and T. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Proc. of the ICSI Workshop on Design Issues in Anonymity and Unobservability , Berkeley, CA, 2000. Google Scholar
- Christian S. Collberg and Clark Thomborson. Watermarking, tamper-proffing, and obfuscation: tools for software protection. IEEE Trans. Softw. Eng. , 28(8):735- 746, 2002. Google Scholar
- K.W. Campbell and M.J. Wiener. DES is not a group. In Advances in Cryptology-CRYPTO '92 Proceedings . Springer-Verlag, 1993. Google Scholar
- B. Chen and G. Wornell. Achievable performance of digital watermarking systems, 1999.Google Scholar
- Brian Chen and Greg Wornell. Quantization indexmodulation: A class of provably good methods for digital watermarking and information embedding (1 page). In ISIT: Proceedings IEEE International Symposium on Information Theory, sponsored by The Information Theory Society of The Institute of Electrical and Electronic Engineers , 2000.Google Scholar
- Rennie deGraaf, John Aycock, and Michael Jr. Jacobson. Improved port knocking with strong authentication. In ACSAC '05: Proceedings of the 21st Annual Computer Security Applications Conference , pages 451-462, Washington, DC, USA, 2005. IEEE Computer Society. Google Scholar
- George Danezis, Roger Dingledine, and Nick Mathewson. Mixminion: Design of a type iii anonymous remailer protocol. In SP '03: Proceedings of the 2003 IEEE Symposium on Security and Privacy , page 2, Washington, DC, USA, 2003. IEEE Computer Society. Google Scholar
- Reinderd GordonNathan deGraaf. Enhancing Firewalls: Conveying User and Application Identification to Network Firewalls . PhD thesis, University of Calgary, 2007.Google Scholar
- D. M. Roger Dingledine and Michael J. Freedman. The Free Haven project: Distributed anonymous storage service. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability , July 2000. Google Scholar
- Roger Dingledine, NickMathewson, and Paul Syverson. Reputation in p2p anonymity systems, 2003.Google Scholar
- Roger Dingledine, Nick Mathewson, and Paul Syverson. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium , August 2004. Google Scholar
- Joan Daemen and Vincent Rijmen. The block cipher rijndael. In Smart Card Research and Applications, LNCS 1820 , pages 288-296. Springer-Verlag, 2000. Google Scholar
- Joan Daemen and Vincent Rijmen. Rijndael, the advanced encryption standard. Dr. Dobb's Journal , 26(3):137-139, March 2001.Google Scholar
- Claudia Díaz and Andrei Serjantov. Generalising mixes. In Roger Dingledine, editor, Proceedings of Privacy Enhancing Technologies workshop (PET 2003) , pages 18- 30. Springer-Verlag, LNCS 2760, March 2003.Google Scholar
- Edward J. Delp and Ping Wah Wong, editors. Security, Steganography, and Watermarking of Multimedia Contents VI, San Jose, California, USA, January 18-22, 2004, Proceedings , volume 5306 of Proceedings of SPIE . SPIE, 2004. Google Scholar
- Edward J. Delp and Ping Wah Wong, editors. Security, Steganography, and Watermarking of Multimedia Contents VII, San Jose, California, USA, January 17-20, 2005, Proceedings , volume 5681 of Proceedings of SPIE . SPIE, 2005. Google Scholar
- G.J. Simmons ed. Contemporary Cryptology: The Science of Information Integrity . IEEE Press, Piscataway, NJ, 1992. Google Scholar
- Rakan El-Khalil and Angelos D. Keromytis. Hydan: Hiding Information in Program Binaries. In Proceedings of the 6th International Conference on Information and Communications Security (ICICS) , pages 187-199, October 2004.Google Scholar
- T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology: Proceedings of CRYPTO 84 . Springer-Verlag, 1985. Google Scholar
- Joachim J. Eggers, Jonathan K. Su, and Bernd Girod. Asymmetric watermarking schemes. In Sicherheit in Mediendaten , Berlin, Germany, September 2000.Google Scholar
- Joachim J. Eggers, Jonathan K. Su, and Bernd Girod. Public-key watermarking by eigenvectors of linear transforms. In EUSIPCO 2000 , Tampere, Finland, September 2000.Google Scholar
- J. Mark Ettinger. Steganalysis and game equilibria. In Information Hiding Workshop, Lecture Notes of Computer Science (1525) , New York, Heidelberg, 1998. Springer-Verlag.Google Scholar
- J. Fridrich, Arnold Baldoza, and Richard Simard. Robust digital watermaking based on key-dependent basis functions. In Information Hiding Workshop, Lecture Notes of Computer Science (1525) , New York, Heidelberg, 1996. Springer-Verlag.Google Scholar
- J. Fridrich and Rui Dui. Secure steganographic methods for palette images. In 3rd Information Hiding Workshop, Lecture Notes of Computer Science (1768) , New York, Heidelberg, 1999. Springer-Verlag. Google Scholar
- J. Fridrich, Rui Du, and Meng Long. Steganalysis of LS-Bencoding in color images. In Proceedings of the IEEE International Conference on Multimedia and Expo , August 2000.Google Scholar
- J. Fridrich and M. Goljan. Protection of digital images using self embedding. In Proceedings of NJIT Symposium on Content Security and Data Hiding in Digital Media , Newark, NJ, May 1999.Google Scholar
- Jessica J. Fridrich, Miroslav Goljan, Petr Lisonek, and David Soukal. Writing on wet paper. In Delp and Wong [DW05], pages 328-340.Google Scholar
- Jessica Fridrich, Miroslav Goljan, and David Soukal. Perturbed quantization steganography with wet paper codes. In MM & Sec '04: Proceedings of the 2004 workshop onMultimedia and security , pages 4-15, NewYork, NY, USA, 2004. ACM. Google Scholar
- Pierre-Alain Fouque, Gaëtan Leurent, and Phong Q. Nguyen. Full key-recovery attacks on HMAC/NMACMD4 and NMAC-MD5. In Proc. CRYPTO '07 , volume 4622 of Lecture Notes in Computer Science , pages 13-30. Springer, 2007. Google Scholar
- Yair Frankel, Philip D. MacKenzie, and Moti Yung. Robust efficient distributed RSA-key generation. In Symposium on Principles of Distributed Computing , page 320, 1998. Google Scholar
- A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In Advances in Cryptology-AUSCRYPT '92 Proceedings . Springer-Verlag, 1993. Google Scholar
- Electronic Frontier Foundation. Cracking DES :Secrets of Encryption Research, Wiretap Politics and Chip Design . O'Reilly, 1998. Google Scholar
- Michael P. Frank. Introduction to reversible computing: motivation, progress, and challenges. In Bagherzadeh et al. [BVR05], pages 385-390. Google Scholar
- Ed Fredkin. Conservative logic. International Journal of Theoretical Physics , 21, 1982.Google Scholar
- J. Fridrich. A new steganographic method for palette-based images. In Proceedings of the IS&T PICS Conference , pages 285-289, Savannah, Georgia, April 1999.Google Scholar
- Jessica J. Fridrich. Feature-based steganalysis for jpeg images and its implications for future design of steganographic schemes. In Jessica J. Fridrich, editor, Information Hiding , volume 3200 of Lecture Notes in Computer Science , pages 67-81. Springer, 2004. Google Scholar
- Edward Fredkin and Tommaso Toffoli. Conservative logic. International Journal of Theoretical Physics , 21:219-253, 1982.Google Scholar
- Wolfgang Funk. Reversible watermarking of nurbs-based cad models. In Camenisch et al. [CCJS07], pages 172-187. Google Scholar
- Daniel Gruhl and Walter Bender. Information hiding to foil the casual counterfeiter. In Information Hiding Workshop, Lecture Notes of Computer Science (1525) , New York, Heidelberg, 1998. Springer-Verlag.Google Scholar
- Marc Girault, Robert Cohen, and Mireille Campana. A generalized birthday attack. In EUROCRYPT , pages 129-156, 1988. Google Scholar
- Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman and Company, New York City, New York, 1979. Google Scholar
- Philippe Golle and Ari Juels. Dining cryptographers revisited. In Proceedings of Eurocrypt 2004 , May 2004.Google Scholar
- Daniel Gruhl, Anthony Lu, and Walter Bender. Echo hiding. In Proceedings of the First International Workshop on Information Hiding , pages 293-315, London, UK, 1996. Springer-Verlag. Google Scholar
- Rosario Gennaro, Tal Rabin, Stanislav Jarecki, and Hugo Krawczyk. Robust and efficient sharing of RSA functions. Journal of Cryptology: the journal of the International Association for Cryptologic Research , 13(2):273- 300, 2000. Google Scholar
- Wendy Grossman. alt.scientology.war. Wired , 3(2), December 1995.Google Scholar
- C.G. Gunther. A universal algorithm for homophonic coding. In Advances in Cryptology-Eurocrypt '88 Lecture Notes in Computer Science , number 330, pages 405-414, New York, 1988. Springer-Verlag. Google Scholar
- Nicholas Zhong-Yang Ho and Ee-Chien Chang. Residual information of redacted images. hidden in the compression artifacts. In Information Hiding 2008, Lecture Notes of Computer Science , New York, Heidelberg, 2008. Springer-Verlag.Google Scholar
- Paul Heckbert. Color image quantization for frame buffer display. In Proceedings of SIGGRAPH 82 , 1982. Google Scholar
- Frank Hartung and Bernd Girod. Fast public-key watermarking of compressed video. In International Conference on Image Processing (ICIP'97) , volume I, pages 528-531, Santa Barbara, California, U.S.A., 1997. Google Scholar
- D Hillman. The structural of reversible one-dimensional cellular automata. Physica D , 52(2/3):277, sep 1991. Google Scholar
- David Hillman. The structure of reversible one-dimensional cellular automata. Physica D , 54:277-292, 1991. Google Scholar
- Martin Hirt. Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting . PhD thesis, ETH Zurich, September 2001. Reprint as vol. 3 of ETH Series in Information Security and Cryptography , ISBN3- 89649-747-2, Hartung-Gorre Verlag, Konstanz, 2001.Google Scholar
- Martin Hirt and Kazue Sako. Efficient receipt-free voting based on homomorphic encryption. In Eurocrypt 2000 , pages 539-556. Springer-Verlag, 2000. Google Scholar
- Frank Hartung, Jonathan K. Su, and Bernd Girod. Spread spectrum watermarking: Malicious attacks and counterattacks. In Security and Watermarking of Multimedia Contents, Proc. SPIE 3657, Jan. 1999 , pages 147- 158, Jan 1999.Google Scholar
- John Hopcroft and Jeffrey Ullman. Introduction to Automata Theory, Languages and Computation . Addison-Wesley, Reading, Massachusetts, 1979. Google Scholar
- D.A. Huffman. Canonical forms for information-lossless finite-state machines. IRE Transactions on Circuit Theory (special supplement) and IRE Transactions on Information Theory (special supplement) , CT-6 and IT-5:41-59, May 1959. A slightly revised version appeared in E.F. Moore, Editor, Sequential Machines: Selected Papers , Addison-Wesley, Reading, Massachusetts, 1964.Google Scholar
- Neil F. Johnson, Zoran Duric, and Sushil Jajodia. Information Hiding: Steganography and Watermarking - Attacks and Countermeasures (Advances in Information Security, Volume 1) . Kluwer Academic Publishers, February 2001.Google Scholar
- Sebastien Jeanquier. An Analysis of Port Knocking and Single Packet Authorization . PhD thesis, Royal Holloway College, University of London, September 2006.Google Scholar
- Neil F. Johnson and Sushil Jajodia. Steganalysis of images created using current steganography software. In Information Hiding, Second International Workshop , pages 273-289, 1998.Google Scholar
- Neil F. Johnson and Sushil Jajodia. Steganalysis: The investigation of hidden information, 1998.Google Scholar
- H.N. Jendal, Y. J. B. Kuhn, and J. L. Massey. An information-theoretic treatment of homophonic substitution. In Advances in Cryptology-Eurocrypt '89 , New York, 1990. Springer-Verlag, Lecture Notes in Computer Science. Google Scholar
- Peter C. Johnson, Apu Kapadia, Patrick P. Tsang, and Sean W. Smith. Nymble: Anonymous ip-address blocking. In Borisov and Golle [BG07], pages 113-133. Google Scholar
- Markus G. Kuhn and Ross J. Anderson. Soft tempest: Hidden data transmission using electromagnetic emanations. In Information Hiding Workshop, Lecture Notes of Computer Science (1525) , New York, Heidelberg, 1998. Springer-Verlag.Google Scholar
- David Kahn. The Codebreakers . Macmillan, New York City, 1967.Google Scholar
- John Kubiatowicz, David Bindel, Yan Chen, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westly Weimer, Christopher Wells, and Ben Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACMASPLOS . ACM, November 2000. Google Scholar
- Ton Kalker, Ingemar J. Cox, and Yong Man Ro, editors. Digital Watermarking, Second International Workshop, IWDW 2003, Seoul, Korea, October 20-22, 2003, Revised Papers , volume 2939 of Lecture Notes in Computer Science . Springer, 2004. Google Scholar
- Michael Kearns. The Computational Complexity of Machine Learning . PhD thesis, Harvard University Center for Research in Computing Technology, May 1989. Google Scholar
- Deepa Kundur and Dimitrios Hatzinakos. Digital watermarking using multiresolution wavelet decomposition. In International Conference on Acoustic, Speech and Signal Processing (ICASP) , volume 5, pages 2969- 2972, Seattle, Washington, U.S.A., 1998.Google Scholar
- Deepa Kundur and D. Hatzinakos. Digital watermarking for telltale tamper-proofing and authentication. Proceedings of the IEEE Special Issue on Identification and Protection of Multimedia Information , 87(7):1167-1180, July 1999.Google Scholar
- Gregory Kipper. Investigator's Guide to Steganography . CRC Press, Inc., Boca Raton, FL, USA, 2003. Google Scholar
- D. Knuth. The Art of Computer Programming: Volume 2, Seminumerical Algorithms . 2nd edition, Addison-Wesley, Reading, MA, 1981.Google Scholar
- Hugh Kenner and Joseph O'Rourke. A travesty generator formicros. BYTE , page 129, November 1984.Google Scholar
- Neal Koblitz. A Course in Number Theory and Cryptography . Springer-Verlag, New York, Berlin, Heidelberg, London, Paris, Tokyo, 1987. Google Scholar
- John Kominek. Convergence of fractal encoded images. In J. A. Storer and M. Cohn, editors, Data Compression Conference 1995 , pages 242-251, Snowbird, UT, USA, March 1995. Google Scholar
- Farinaz Koushanfar, Gang Qu, and Miodrag Potkonjak. Intellectual property metering. In Fourth Information Hiding Workshop , 2001. Google Scholar
- Hugo Krawczyk. Secret sharing made short. In CRYPTO '93: Proceedings of the 13th annual international cryptology conference on Advances in cryptology , pages 136- 146, New York, NY, USA, 1994. Springer-Verlag New York, Inc. Google Scholar
- Martin Krzywinski. Port knocking. Linux Journal , June 2003.Google Scholar
- Martin Krzywinski. Port knocking: Network authentication across closed ports. SysAdmin Magazine , 12:12-17, 2003.Google Scholar
- Mehdi Kharrazi, Husrev T. Sencar, and Nasir Memon. Performance study of common image steganography and steganalysis techniques. Journal of Electronic Imaging , 15(4), 2006.Google Scholar
- Michael Kearns and Leslie Valient. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing , pages 433-444, Seattle, WA, May 1989. Google Scholar
- J. C. Lagarias. Performance analysis of shamir's attack on the basic merkle-hellman knapsack cryptosystem. In Proceedings of the 11th Colloquium on Automata, Languages and Programming , pages 312-323, London, UK, 1984. Springer-Verlag. Google Scholar
- Shu Lin and Daniel J. Costello. Error Control Coding, Second Edition . Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 2004. Google Scholar
- D.J. Lehmann. On primality tests. SIAM Journal on Computing , 11(2), May 1982. ((page numbers are wrong)).Google Scholar
- S. Lyu and H. Farid. Howrealistic is photorealistic? IEEE Transactions on Signal Processing , 53(2):845-850, 2005.Google Scholar
- Wilson MacGyver Liaw. Reading gif files. Dr. Dobbs Journal , Feb 1995.Google Scholar
- Shu Lin and Daniel J. Costello Jr. Error Control Coding: Fundaments and Applications . Prentice Hall, Englewood Cliffs, NJ, 1983.Google Scholar
- Vinicius Licks and R. Jordan. On digital image watermarking robust to geometric transformations. In IEEE International Conference on Image Processing 2000, Vancouver, Canada , 2000.Google Scholar
- Steve Low, Nicholas Maxemchuk, Jack Brassil, and Larry O'Gorman. Document marking and identification using both line and word shifting. In Proceedings of the 1995 Conference on Infocom '95 , April 1995. Google Scholar
- John Lach, WIlliam H. Mangione-Smith, and Miodrag Potkonjak. Fingerprinting digital circuits on programmable hardware. In Information Hiding Workshop, Lecture Notes of Computer Science (1525) , New York, Heidelberg, 1998. Springer-Verlag.Google Scholar
- Michael Luby. Lt codes. In FOCS , pages 271-. IEEE Computer Society, 2002. Google Scholar
- S. Lyu. Natural Image Statistics for Digital Image Forensics . PhD thesis, Department of Computer Science, Dartmouth College, Hanover, NH, 2005. Google Scholar
- Maurise Maes. Twin peaks: The histogram attack to fixed depth image watermarks. In Information HidingWorkshop, Lecture Notes of Computer Science (1525) , New York, Heidelberg, 1998. Springer-Verlag.Google Scholar
- Kevin Maher. Texto. circulating on the web, February 1995. http://www.ecn.org/crypto/soft/texto.zip, accessed 2005-03-22.Google Scholar
- S. Manoharan. Using self-synchronizing codes to improve steganography. In Internet and Multimedia Systems and Applications IMSA 2003 , Honolulu, USA, 8 2003.Google Scholar
- N. Margolus. Physics-likemodels of computation. Physica D , 10:81-95, 1984. Discussion of reversible cellular automata illustrated by an implementation of Fredkin's Billiard-Ball model of computation .Google Scholar
- L. Marvel, C. Boncelet, and C. Retter. Spread spectrum image steganography. IEEE Transactions on Image Processing 8 , pages 1075-1083, August 1999.Google Scholar
- John McHugh. Cover image. In Fourth Information Hiding Workshop , page 0, 2001.Google Scholar
- M. Miller, I. Cox, J. Linnartz, and T. Kalker. A review of watermarking principles and practices, 1999.Google Scholar
- Ralph Merkle. Reversible electronic logic using switches. Nanotechnology , 4:21-40, 1993.Google Scholar
- Daniel B. Miller and Edward Fredkin. Two-state, reversible, universal cellular automata in three dimensions. In Bagherzadeh et al. [BVR05], pages 45-51. Google Scholar
- Steven J. Murdoch and Stephen Lewis. Embedding covert channels into tcp/ip. In Mauro Barni, Jordi Herrera-Joancomartí, Stefan Katzenbeisser, and Fernando Pérez-González, editors, Information Hiding , volume 3727 of Lecture Notes in Computer Science , pages 247-261. Springer, 2005.Google Scholar
- IS Moskowitz and AR Miller. The channel capacity of a certain noisy timing channel. IEEE Trans. on Information Theory , IT-38(4):1339-43, 1992.Google Scholar
- P.L. Montgomery. Modular multiplication without trial division. Mathematics of Computation , 44(170), 1985.Google Scholar
- Wojciech Mazurczyk and Krzysztof Szczypiorski. Steganography of voip streams, 2008.Google Scholar
- Robert P. McEvoy, Michael Tunstall, Colin C. Murphy, and William P. Marnane. Differential power analysis of hmac based on sha-2, and countermeasures. In Sehun Kim, Moti Yung, and Hyung-Woo Lee, editors, WISA , volume 4867 of Lecture Notes in Computer Science , pages 317-332. Springer, 2007. Google Scholar
- Steven J. Murdoch. Hot or not: revealing hidden services by their clock skew. In CCS '06: Proceedings of the 13th ACMconference on Computer and communications security , pages 27-36, New York, NY, USA, 2006. ACM. Google Scholar
- Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography . CRC Press, New York, 1997. Google Scholar
- Ogden Nash. Lineup for yesterday. Sport Magazine , January 1949.Google Scholar
- NCSC. A guide to understanding covert channel analysis of trusted systems. Technical Report TG-030, NCSC, November 1993.Google Scholar
- P.G. Neumann. Error-limiting coding using information-lossless sequential machines. IEEE Transactions on Information Theory , IT-10:108-115, April 1964.Google Scholar
- Mohannad Najjar and Firas Najjar. d-hmac dynamic hmac function. In DepCoS-RELCOMEX , pages 119-126. IEEE Computer Society, 2006. Google Scholar
- Arjun Nambiar and Matthew Wright. Salsa: a structured approach to large-scale anonymity. In CCS '06: Proceedings of the 13th ACM conference on Computer and communications security , pages 17-26, New York, NY, USA, 2006. ACM. Google Scholar
- M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the 21nd Annual ACM Symposium on Theory of Computing , pages 33-43. ACM, 1989. Google Scholar
- M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing , pages 427-437. ACM, 1990. Google Scholar
- A. M. Odlyzko. Cryptanalytic attacks on the multiplicative knapsack scheme and on Shamir's fast signature scheme. IEEE Trans. Inform. Theory , IT-30:594-601, 1984.Google Scholar
- Lasse Øverlier and Paul Syverson. Improving efficiency and simplicity of tor circuit establishment and hidden services. In Borisov and Golle [BG07], pages 134-152. Google Scholar
- Lasse Øverlier and Paul Syverson. Location hidden services and valet nodes. Telektronikk , pages 52-60, February 2007.Google Scholar
- A. Piva, M. Barni, F. Bartolini, and V. Cappellini. DCTbased watermark recovering without resorting to the uncorrupted original image. In IEEE Signal Processing Society 1997 International Conference on Image Processing (ICIP'97) , Santa Barbara, California, October 1997. Google Scholar
- Alin C. Popescu and Hany Farid. Exposing digital forgeries in color filter array interpolated images. IEEE Transactions on Signal Processing , 53(10):3948-3959, 2005.Google Scholar
- Fabien A. P. Petitcolas and Hyoung Joong Kim, editors. Digital Watermarking, First International Workshop, IWDW 2002, Seoul, Korea, November 21-22, 2002, Revised Papers , volume 2613 of Lecture Notes in Computer Science . Springer, 2003. Google Scholar
- N Proctor and P Neumann. Architectural implications of covert channels. In Proceedings of the 15th National Computer Security Conference , 1993.Google Scholar
- Edgar Allan Poe. The purloined letter. The Gift: A Christmas and New Year's Present for 1844 , 1844.Google Scholar
- A.C. Popescu. Statistical Tools for Digital Image Forensics . PhD thesis, Department of Computer Science, Dartmouth College, Hanover, NH, 2005.Google Scholar
- B Pfitzmann and A Pfitzmann. How to break the direct rsa-implementation of mixes. In Advances in Cryptology- Eurocrypt '89 , number 434. Springer-Verlag, 1990. Google Scholar
- Federal Information Processing. Fips pub 198: The keyed-hashmessage authentication code (hmac).Google Scholar
- Niels Provos. Defending against statistical steganalysis, August 2001.Google Scholar
- Niels Provos. Probabilistic methods for improving information hiding. Technical Report 01-1, University of Michigan, January 2001.Google Scholar
- Dima Pröfrock, Mathias Schlauweg, and Erika Müller. Video watermarking by using geometric warping without visible artifacts. In Camenisch et al. [CCJS07], pages 78-92. Google Scholar
- Publius. Federalist: A Collection of Essays Written in Favor of the New Constitution . J. and A. McClean, 1788.Google Scholar
- J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for rsa public-key cryptosystem. Electronic Letters , 18, 1982.Google Scholar
- Gang Qu. Keyless public watermarking for intellectual property authentication. In Fourth Information Hiding Workshop , 2001. Google Scholar
- Michael Rabin. Efficient dispersal of information for security, load balancing and fault tolerance. Journal of the ACM , 38:335-348, 1989. Google Scholar
- Michael O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM , 36(2):335-348, 1989. Google Scholar
- R. Rinaldo and G. Calvagno. Image coding by block prediction of multiresolution submimages. IEEE Transactions on Image Processing , 4:909-920, 1995.Google Scholar
- J. Ruanaidh, W. Dowling, and F. Boland. Phase watermarking of digital images. In Proceedings of ICIP'96 , volume III, pages 239-242, Lausanne, Switzerland, September 1996.Google Scholar
- Ron Rivest. Chaffing and winnowing: Confidentiality without encryption, summer 1998.Google Scholar
- Ronald L. Rivest. Peppercoin micropayments. In Ari Juels, editor, Financial Cryptography , volume 3110 of Lecture Notes in Computer Science , pages 2-8. Springer, 2004.Google Scholar
- L. G. Roberts. Picture coding using pseudo-random noise. IRE Trans. on Information Theory , IT-8, Feb 1962.Google Scholar
- M. Rennhard and B. Plattner. Practical anonymity for themasses withmorphmix, 2004.Google Scholar
- Michael K. Reiter and Aviel D. Rubin. Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security , 1(1):66-92, 1998. Google Scholar
- Christian Rechberger and Vincent Rijmen. New results on nmac/hmac when instantiated with popular hash functions. Journal of Universal Computer Science , 14(3):347-376, feb 2008.Google Scholar
- M. G. Reed, P. F. Syverson, and D.M. Goldschlag. Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications , 16(4):482-494, May 1998.Google Scholar
- Joanna Rutkowska. Subverting vista kernel for fun and profit. In Black Hat Briefings , 2006.Google Scholar
- Frank Stajano and Ross J. Anderson. The cocaine auction protocol: On the power of anonymous broadcast. In IH '99: Proceedings of the Third International Workshop on Information Hiding , pages 434-447, London, UK, 2000. Springer-Verlag. Google Scholar
- Khalid Sayood. Introduction to data compression (2nd ed.) . MorganKaufmann Publishers Inc., San Francisco, CA, USA, 2000. Google Scholar
- Bruce Schneier. Applied Cryptography . John Wiley and Sons, New York, 1994.Google Scholar
- Jacob Seidelin. Compression using canvas and png-embedded data. nihilogic , April 2008.Google Scholar
- Andrei Serjantov. A fresh look at the generalised mix framework. In Borisov and Golle [BG07], pages 17-29. Google Scholar
- P. F. Syverson, D.M. Goldschlag, and M. G. Reed. Anonymous connections and onion routing. In IEEE, editor, Proceedings / 1997 IEEE Symposium on Security and Privacy, May 4-7, 1997, Oakland, California , pages 44-54, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1997. IEEE Computer Society Press. Google Scholar
- A. Shamir. How to share a secret. Communications of the ACM , 24(11), Nov 1979. Google Scholar
- Adi Shamir. A polynomial time algorithm for breaking the basic merkle-hellman cryptosystem. In CRYPTO , pages 279-288, 1982.Google Scholar
- J. Shapiro. Embedded image coding using zerotrees of wavelet coeffcients. IEEE Transactions on Signal Processing , 41(12):3445-3462, 1993.Google Scholar
- Toby Sharp. An implementation of key-baseddigital signal steganography. In Fourth Information Hiding Workshop , 2001. Google Scholar
- Adi Shamir. How to solve it: New techniques in algebraic cryptanalysis. In Crypto 2008 , Santa Barbara, California, August 2008.Google Scholar
- Natori Shin. One-time hash steganography. In 3rd Information Hiding Workshop, Lecture Notes of Computer Science (1768) , New York, Heidelberg, 1999. Springer-Verlag. Google Scholar
- G.J. Simmons. The prisoner's problem and the subliminal channel. In Advances in Cryptology: Proceedings of CRYPTO '83 . PlenumPress, 1984.Google Scholar
- G.J. Simmons. The subliminal channel and digital signatures. In Advances in Cryptology: Proceedings of EUROCRYPT 84 . Springer-Verlag, 1985. Google Scholar
- G.J. Simmons. A secure subliminal channel (?). In Advances in Cryptology-CRYPTO '85 Proceedings . Springer-Verlag, 1986. Google Scholar
- G.J. Simmons. The subliminal channels of the U.S. Digital Signature Algorithm (DSA). In Proceedings of the Third Symposium on: State and Progress of Research in Cryptography , Fondazone Ugo Bordoni, Rome, 1993.Google Scholar
- G.J. Simmons. Subliminal communication is easy using the DSA. In Advances in Cryptology-EUROCRYPT '93 Proceedings . Springer-Verlag, 1994. Google Scholar
- Yun-Qing Shi and Byeungwoo Jeon, editors. Digital Watermarking, 5th International Workshop, IWDW 2006, Jeju Island, Korea, November 8-10, 2006, Proceedings , volume 4283 of Lecture Notes in Computer Science . Springer, 2006. Google Scholar
- Kazue Sako and Joe Kilian. Secure voting using partially compatible homomorphisms. In CRYPTO '94: Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology , pages 411-424, London, UK, 1994. Springer-Verlag. Google Scholar
- K Sako and J Kilian. Receipt-free mix-type voting schemes. In Advances in Cryptology- Eurocrypt '95 , pages 393-403. Springer-Verlag, 1995. Google Scholar
- A.P. Petitcolas (Editor) Stefan Katzenbeisser (Editor), Fabien. Information Hiding Techniques for Steganography and Digital Watermarking . Artech House, January 2000.Google Scholar
- Matthew D. Spisak. An analysis of perturbed quantization steganography in the spatial domain . PhD thesis, Air Force Institute of Technology, Wright-Patterson Air Force Base, Ohio, April 2005.Google Scholar
- Paul F. Syverson, Michael G. Reed, and David M. Goldschlag. Onion routing access configurations. In DISCEX 2000: Proceedings of the DARPA Information Survivability Conference and Exposition , volume I, pages 34-40, Hilton Head, SC, January 2000. IEEE CS Press.Google Scholar
- Paul F. Syverson, Stuart G. Stubblebine, and David M. Goldschlag. Unlinkable serial transactions. In Financial Cryptography , pages 39-56, 1997. Google Scholar
- James Storer. Data Compression . Computer Science Press, Rockville, MD, 1988. Google Scholar
- Paul F. Syverson, Gene Tsudik, Michael G. Reed, and Carl E. Landwehr. Towards an analysis of onion routing security. In Workshop on Design Issues in Anonymity and Unobservability , Berkeley, CA, July 2000. Google Scholar
- Claude E. Shannon andWarrenWeaver. A Mathematical Theory of Communication . University of Illinois Press, Champaign, IL, USA, 1963. Google Scholar
- Sabrina Sowers and Abdou Youssef. Testing digital watermark resistance to destruction. In Information Hiding Workshop, Lecture Notes of Computer Science (1525) , New York, Heidelberg, 1998. Springer-Verlag.Google Scholar
- Eugene Tumoian and Maxim Anikeev. Network based detection of passive covert channels in tcp/ip. In LCN '05: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary , pages 802-809, Washington, DC, USA, 2005. IEEE Computer Society. Google Scholar
- H. Taha. Operations Research An Introduction . Macmillan Publishing Company., New York, 1992. Google Scholar
- Parisa Tabriz and Nikita Borisov. Breaking the collusion detection mechanism of morphmix. In George Danezis and Philippe Golle, editors, Privacy Enhancing Technologies , volume 4258 of Lecture Notes in Computer Science , pages 368-383. Springer, 2006.Google Scholar
- Tommaso Toffoli and Lev B. Levitin. Specific ergodicity: an informative indicator for invertible computational media. In Bagherzadeh et al. [BVR05], pages 52-58. Google Scholar
- Tommaso Toffoli and Norman Margolus. Cellular Automata Machines . MIT Press, London, 1987.Google Scholar
- T. Toffoli. Cellular Automata Mechanics . PhD thesis, The University ofMichigan, 1977. Toffoli's demonstration of reversible universal computation . Google Scholar
- Tommaso Toffoli. Computation and construction universality of reversible cellular automata. Journal of Computer and SystemSciences , 15:213-231, 1977.Google Scholar
- Mercan Topkara, Guiseppe Riccardi, Dilek Hakkani-Tur, and Mikhail J. Atallah. Natural language watermarking: Challenges in building a practical system. In Proceedings of the SPIE International Conference on Security, Steganography, and Watermarking of Multimedia Contents , January 2006.Google Scholar
- Umut Topkara, Mercan Topkara, and Mikhail J. Atallah. The hiding virtues of ambiguity: quantifiably resilient watermarking of natural language text through synonym substitutions. In MM & Sec '06: Proceedings of the 8th workshop on Multimedia and security , pages 164-174, New York, NY, USA, 2006. ACM. Google Scholar
- Cuneyt M. Taskiran, Umut Topkara, Mercan Topkara, and Edward J. Delp. Attacks on lexical natural language steganography systems. In Proceedings of the SPIE International Conference on Security, Steganography, and Watermarking of Multimedia Contents , January 2006.Google Scholar
- Alan Turing. On computable numbers with an application to the entscheidungsproblem. Proceedings of the London Math Soceity , 2(42):230-265, 1936.Google Scholar
- Alan Turing. On computable numbers with an application to the entscheidungsproblem. Proceedings of the London Math Soceity , 2(43):544-546, 1936.Google Scholar
- Luis von Ahn and Nicholas J. Hopper. Public-key steganography. In Christian Cachin and Jan Camenisch, editors, EUROCRYPT , volume 3027 of Lecture Notes in Computer Science , pages 323-341. Springer, 2004.Google Scholar
- Leslie G. Valient. A theory of the learnable. Communications of the ACM , 27:1134-1142, 1984. Google Scholar
- Alexis De Vos and Yvan Van Rentergem. Reversible computing: frommathematical group theory to electronical circuit experiment. In Bagherzadeh et al. [BVR05], pages 35-44. Google Scholar
- John Walker. Steganosaurus. circulating on the web, December 1994. http://www.fourmilab.ch/stego/stego.shar.gz, accessed 2005-03-25.Google Scholar
- S. Walton. Information authentication for a slippery new age. Dr. Dobbs Journal , 20(4):18-26, April 1995.Google Scholar
- Steve Walton. Image authentification for a slippery new age. Dr. Dobbs Journal , Apr 1995.Google Scholar
- Peter Wayner. Building a travesty tree. BYTE , page 183, September 1985.Google Scholar
- 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. Google Scholar
- Peter Wayner. Strong theoretical steganography. Cryptologia , 19(3):285-299, July 1995.Google Scholar
- Peter C. Wayner. Digital Cash: Commerce on the Net . AP Professional, Boston, 1995. Google Scholar
- Peter Wayner. Digital Cash, 2nd Edition . AP Professional, Chestnut Hill, MA, 1997.Google Scholar
- Peter Wayner. Digital Copyright Protection . AP Professional, Chestnut Hill, MA, 1997. Google Scholar
- Peter Wayner. Data Compression for Real Programmers . AP Professional, Chesnutt, Hill, MA, 1999. Google Scholar
- Peter Wayner. Compression algorithms for real programmers . MorganKaufmann Publishers Inc., San Francisco, CA, USA, 2000. Google Scholar
- Peter Wayner. Translucent Databases . Flyzone Press, Baltimore, MD, USA, 2001.Google Scholar
- Peter Wayner. Translucent Databases . Flyzone Press, Baltimore, Maryland, 2003.Google Scholar
- Peter Wayner. Policing Online Games . Flyzone Press, Baltimore, Maryland, 2005. Google Scholar
- Joseph Weizenbaum. Computer power and human reason : from judgment to calculation . W.H. Freeman, San Fransisco, 1976. Google Scholar
- Andreas Westfeld. High capacity depsite better steganalysis: F5- a steganographic algorithm. In Fourth Information Hiding Workshop , pages 301-315, 2001. Google Scholar
- Peter Wayner and Dan Huttenlocher. Image analysis to obtain typeface information. U.S. Patent , 5253307, 1994.Google Scholar
- Hao-Tian Wu and Yiu ming Cheung. A high-capacity data hiding method for polygonal meshes. In Camenisch et al. [CCJS07], pages 188-200. Google Scholar
- P.W. Wong. A public key watermark for image verification and authentication. In In Proc. of ICIP'98 , volume1, pages 425- 429, Chicago, USA, October 1998.Google Scholar
- Andreas Westfeld and Andreas Pfitzmann. Attacks on steganographic systems. In Information Hiding, Third International Workshop, IH'99 , volume 1768, pages 61- 76, Dresden, Germany, 1999. Springer Verlag. Google Scholar
- Marc Waldman, Aviel D. Rubin, and Lorrie Faith Cranor. Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In Proc. 9th USENIX Security Symposium , pages 59-72, August 2000. Google Scholar
- Wright and Spalding. Experimental performance of shared RSAmodulus generation (short). In SODA: ACMSIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) , 1999. Google Scholar
- X.-G. Xia, C. Boncelet, and G. Arce. A multiresolution watermark for digital images. In IEEE Signal Processing Society 1997 International Conference on Image Processing (ICIP'97) , Santa Barbara, California, October 1997. Google Scholar
Cited By
- Chen X and Chen S (2019). Text coverless information hiding based on compound and selection of words, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:15, (6323-6330), Online publication date: 1-Aug-2019.
- Douglas M, Bailey K, Leeney M and Curran K (2018). An overview of steganography techniques applied to the protection of biometric data, Multimedia Tools and Applications, 77:13, (17333-17373), Online publication date: 1-Jul-2018.
- Xiao C, Zhang C and Zheng C (2018). FontCode, ACM Transactions on Graphics, 37:2, (1-16), Online publication date: 30-Apr-2018.
- Uljarević D, Veinović M, Kunjadić G and Tepšić D (2017). A new way of covert communication by steganography via JPEG images within a Microsoft Word document, Multimedia Systems, 23:3, (333-341), Online publication date: 1-Jun-2017.
- (2014). Distributing privacy policies over multimedia content across multiple online social networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, 75:PB, (531-543), Online publication date: 24-Dec-2014.
- Zielińska E, Mazurczyk W and Szczypiorski K (2014). Trends in steganography, Communications of the ACM, 57:3, (86-95), Online publication date: 1-Mar-2014.
- Meng P, Hang L, Chen Z, Hu Y and Yang W STBS Proceedings of the 12th international conference on Information hiding, (208-220)
Index Terms
- Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Green Cryptography: Cleaner Engineering through Recycling
"Green cryptography" is an implementation-centric design paradigm that advocates mature (that is, secure) and minimalist (that is, simple) implementations by recycling cryptographic primitives, components, and design strategies. To exemplify the merits ...
Secure Deniable Authentication Protocol Based on ElGamal Cryptography
ISA '08: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008)In 2006, Shao et al. showed that Wang et al.'s deniable authentication protocol based on ElGamal cryptography is insecure to a person-in-the-middle attack; that is, in the whole process, the receiver cannot be aware of the existence of this adversary as ...
What Is Cryptography?
Cryptography's aim is to construct schemes or protocols that can still accomplish certain tasks even in the presence of an adversary. A basic task in cryptography is to enable users to communicate securely over an insecure channel in a way that ...