Random Oracle Model (ROM) is an effective method
for measuring the practical security of cryptograph. In this paper, we
try to use it into information hiding system (IHS). Because IHS has its
own properties, the ROM must be modified if it is used into IHS.
Firstly, we fully discuss why and how to modify each part of ROM
respectively. The main changes include: 1) Divide the attacks that IHS
may be suffered into two phases and divide the attacks of each phase
into several kinds. 2) Distinguish Oracles and Black-boxes clearly. 3)
Define Oracle and four Black-boxes that IHS used. 4) Propose the
formalized adversary model. And 5) Give the definition of judge.
Secondly, based on ROM of IHS, the security against known original
cover attack (KOCA-KOCA-security) is defined. Then, we give an
actual information hiding scheme and prove that it is
KOCA-KOCA-secure. Finally, we conclude the paper and propose the
open problems of further research.
[1] Francois Cayre, Caroline Fontaine, and Teddy Furon, "Watermarking
security: theory and practice," IEEE Transactions on Signal Processing,
vol. 53, pp. 3976-3987, Oct. 2005.
[2] C. Cachin, "An information-theoretic model for steganography," in
Information Hiding: Second International Workshop, vol. 1525 of LNCS:
Springer, 1998, pp. 306-318.
[3] J. Zöllner, "Modeling the security of steganogrpahic systems," in
Information Hiding: Second International Workshop, vol. 1525 of LNCS:
Springer, 1998, pp. 344-354.
[4] Stefan Katzenbeisser, Fabien A.P. Petitcolas. Defining security in
steganographic systems. in E. Delp, P. Wong. Proceedings of SPIE,
Vortrag: Conference Security and Watermarking of Multimedia Contents
IV. San Jose, USA, 2002, pp. 50-56.
[5] Jiang Nan, Wang Jian, Niu Xinxin, and Yang Yixian, "Symmetric
steganography secure against chosen message and original cover attacks,"
in 2006 International Conference on Innovative Computing, Information
and Control, vol. 3, pp. 661-664, Aug. 2006.
[6] Bellare M, and Rogaway P, "Random oracles are practical: a paradigm for
designing efficient protocols," in Proceedings of the 1st ACM Conference
on Computer and Communications Security, New York: ACM Press,
1993, pp. 62-77.
[7] Fiat A., and Shamir A, "How to prove yourself: practical solutions to
identification and signature problems," in Proc. CRYPTO-86, vol. 286,
Lecture Notes in Computer Science, Springer-Verlag, 1986, pp. 186-194.
[8] Feng Dengguo, "Research on theory and approach of provable security,"
Journal of Software, vol. 16, pp. 1743-1756, Oct. 2005.
[9] Barthe G., Cederquist J., and Tarento S, "A machine-checked
formalization of the generic model and the random oracle model," in
Proceedings of IJCAR-04, vol. 3097, Lecture Notes in Computer Science,
2004, pp. 385-399.
[10] Bellare M., Boldyreva A., and Palacio A, "An uninstantiable
random-oracle-model scheme for a hybrid-encryption problem," in
Advances in Cryptology, EUROCRYPT'04, Lecture Notes in Computer
Science, Cachin C. and Camenisch J. ed., Springer-Verlag, 2004.
[11] Canetti R, Goldreich O, and Halevi S, "The random oracle methodology,
revisited," Journal of the ACM, vol. 51, pp. 557-594, 2004.
[12] Goldwasser S., Micali S., and Rivest R. L., "A digital signature scheme
secure against adaptive chosen-message attacks," SIAM Journal of
Computing, vol. 17, pp. 281-308, 1998.
[13] Jiang Nan, Wang Jian, Yang Yixian, "A new method for blind image
steganalysis," Journal of Beijing University of Posts and
Telecommunications, vol. 29, no. 2, pp. 1-4, 2006.
[14] Fridrich J., Goljan M., Du R., "Detecting LSB steganography in color and
gray-scale images," Magazine of IEEE Multimedia, Special Issue on
Security, October-November issue, pp. 22-28, 2001.
[15] Lin Guo-Shiang, Lie Wen-Nung, "A study on detecting image hiding by
feature analysis," in The 2001 IEEE International Symposium on Circuits
and Systems, vol. 2, pp. 149-152, 2001.
[16] Sorina Dumitrescu, Xiaolin Wu, "Steganalysis of LSB embedding in
multimedia signals," in 2002 IEEE International Conference on
Multimedia and Expo, vol. 1, pp. 581-584, 2002.
[17] Ismail Avcibas, Nair Memon, Bulent Sankur, "Steganalysis based on
image quality metrics," in 2001 IEEE Fourth Workshop on Multimedia
Signal Processing, pp. 517-522, 2001.
[1] Francois Cayre, Caroline Fontaine, and Teddy Furon, "Watermarking
security: theory and practice," IEEE Transactions on Signal Processing,
vol. 53, pp. 3976-3987, Oct. 2005.
[2] C. Cachin, "An information-theoretic model for steganography," in
Information Hiding: Second International Workshop, vol. 1525 of LNCS:
Springer, 1998, pp. 306-318.
[3] J. Zöllner, "Modeling the security of steganogrpahic systems," in
Information Hiding: Second International Workshop, vol. 1525 of LNCS:
Springer, 1998, pp. 344-354.
[4] Stefan Katzenbeisser, Fabien A.P. Petitcolas. Defining security in
steganographic systems. in E. Delp, P. Wong. Proceedings of SPIE,
Vortrag: Conference Security and Watermarking of Multimedia Contents
IV. San Jose, USA, 2002, pp. 50-56.
[5] Jiang Nan, Wang Jian, Niu Xinxin, and Yang Yixian, "Symmetric
steganography secure against chosen message and original cover attacks,"
in 2006 International Conference on Innovative Computing, Information
and Control, vol. 3, pp. 661-664, Aug. 2006.
[6] Bellare M, and Rogaway P, "Random oracles are practical: a paradigm for
designing efficient protocols," in Proceedings of the 1st ACM Conference
on Computer and Communications Security, New York: ACM Press,
1993, pp. 62-77.
[7] Fiat A., and Shamir A, "How to prove yourself: practical solutions to
identification and signature problems," in Proc. CRYPTO-86, vol. 286,
Lecture Notes in Computer Science, Springer-Verlag, 1986, pp. 186-194.
[8] Feng Dengguo, "Research on theory and approach of provable security,"
Journal of Software, vol. 16, pp. 1743-1756, Oct. 2005.
[9] Barthe G., Cederquist J., and Tarento S, "A machine-checked
formalization of the generic model and the random oracle model," in
Proceedings of IJCAR-04, vol. 3097, Lecture Notes in Computer Science,
2004, pp. 385-399.
[10] Bellare M., Boldyreva A., and Palacio A, "An uninstantiable
random-oracle-model scheme for a hybrid-encryption problem," in
Advances in Cryptology, EUROCRYPT'04, Lecture Notes in Computer
Science, Cachin C. and Camenisch J. ed., Springer-Verlag, 2004.
[11] Canetti R, Goldreich O, and Halevi S, "The random oracle methodology,
revisited," Journal of the ACM, vol. 51, pp. 557-594, 2004.
[12] Goldwasser S., Micali S., and Rivest R. L., "A digital signature scheme
secure against adaptive chosen-message attacks," SIAM Journal of
Computing, vol. 17, pp. 281-308, 1998.
[13] Jiang Nan, Wang Jian, Yang Yixian, "A new method for blind image
steganalysis," Journal of Beijing University of Posts and
Telecommunications, vol. 29, no. 2, pp. 1-4, 2006.
[14] Fridrich J., Goljan M., Du R., "Detecting LSB steganography in color and
gray-scale images," Magazine of IEEE Multimedia, Special Issue on
Security, October-November issue, pp. 22-28, 2001.
[15] Lin Guo-Shiang, Lie Wen-Nung, "A study on detecting image hiding by
feature analysis," in The 2001 IEEE International Symposium on Circuits
and Systems, vol. 2, pp. 149-152, 2001.
[16] Sorina Dumitrescu, Xiaolin Wu, "Steganalysis of LSB embedding in
multimedia signals," in 2002 IEEE International Conference on
Multimedia and Expo, vol. 1, pp. 581-584, 2002.
[17] Ismail Avcibas, Nair Memon, Bulent Sankur, "Steganalysis based on
image quality metrics," in 2001 IEEE Fourth Workshop on Multimedia
Signal Processing, pp. 517-522, 2001.
@article{"International Journal of Information, Control and Computer Sciences:53755", author = "Nan Jiang and Jian Wang", title = "Random Oracle Model of Information Hiding System", abstract = "Random Oracle Model (ROM) is an effective method
for measuring the practical security of cryptograph. In this paper, we
try to use it into information hiding system (IHS). Because IHS has its
own properties, the ROM must be modified if it is used into IHS.
Firstly, we fully discuss why and how to modify each part of ROM
respectively. The main changes include: 1) Divide the attacks that IHS
may be suffered into two phases and divide the attacks of each phase
into several kinds. 2) Distinguish Oracles and Black-boxes clearly. 3)
Define Oracle and four Black-boxes that IHS used. 4) Propose the
formalized adversary model. And 5) Give the definition of judge.
Secondly, based on ROM of IHS, the security against known original
cover attack (KOCA-KOCA-security) is defined. Then, we give an
actual information hiding scheme and prove that it is
KOCA-KOCA-secure. Finally, we conclude the paper and propose the
open problems of further research.", keywords = "Attack, Information Hiding, Provable Security,Random Oracle Model.", volume = "2", number = "12", pages = "4087-6", }
