{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:25:04Z","timestamp":1725582304296},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_38","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"390-402","source":"Crossref","is-referenced-by-count":1,"title":["Grey-Box Steganography"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"W\u00f6lfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","first-page":"351","volume-title":"Proc.\u00a0STOC 1992","author":"D. Angluin","year":"1992","unstructured":"Angluin, D.: Computational Learning Theory: Survey and Selected Bibliography. In: Proc.\u00a0STOC 1992, pp. 351\u2013369. ACM, New York (1992)"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-24676-3_20","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"L. Ahn von","year":"2004","unstructured":"von Ahn, L., Hopper, N.J.: Public-key steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 323\u2013341. Springer, Heidelberg (2004)"},{"issue":"4","key":"38_CR3","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/49.668971","volume":"16","author":"R.J. Anderson","year":"1998","unstructured":"Anderson, R.J., Petitcolas, F.A.P.: On the limits of steganography. IEEE Journal of Selected Areas in Communications\u00a016(4), 474\u2013481 (1998)","journal-title":"IEEE Journal of Selected Areas in Communications"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-30576-7_12","volume-title":"Theory of Cryptography","author":"M. Backes","year":"2005","unstructured":"Backes, M., Cachin, C.: Public-Key Steganography with Active Attacks. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 210\u2013226. Springer, Heidelberg (2005)"},{"key":"38_CR5","first-page":"394","volume-title":"Proc.\u00a0FOCS 1997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, F.: A Concrete Security Treatment of Symmetric Encryption. In: Proc.\u00a0FOCS 1997, pp. 394\u2013403. IEEE, Los Alamitos (1997), full paper available under \n                      \n                        http:\/\/www-cse.ucsd.edu\/~adesai\/papers\/pubs.html#BDJR97"},{"issue":"1","key":"38_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ic.2004.02.003","volume":"192","author":"C. Cachin","year":"2004","unstructured":"Cachin, C.: An information-theoretic model for steganography. Information and Computation\u00a0192(1), 41\u201356 (2004)","journal-title":"Information and Computation"},{"issue":"3","key":"38_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00145-008-9020-3","volume":"22","author":"N. Dedi\u0107","year":"2009","unstructured":"Dedi\u0107, N., Itkis, G., Reyzin, L., Russell, S.: Upper and lower bounds on black-box steganography. Journal of Cryptology\u00a022(3), 365\u2013394 (2009)","journal-title":"Journal of Cryptology"},{"key":"38_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-49730-7_9","volume-title":"Algorithmic Learning Theory","author":"F. Denis","year":"1998","unstructured":"Denis, F.: PAC Learning from Positive Statistical Queries. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds.) ALT 1998. LNCS (LNAI), vol.\u00a01501, pp. 112\u2013126. Springer, Heidelberg (1998)"},{"issue":"3","key":"38_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0890-5401(89)90001-1","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D.: Learning decision trees from random examples. Information and Computation\u00a082(3), 231\u2013246 (1989)","journal-title":"Information and Computation"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-36415-3_20","volume-title":"Information Hiding","author":"J.J. Fridrich","year":"2003","unstructured":"Fridrich, J.J., Goljan, M., Hogea, D.: Steganalysis of JPEG Images: Breaking the F5 Algorithm. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol.\u00a02578, pp. 310\u2013323. Springer, Heidelberg (2003)"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/B978-0-934613-41-5.50036-2","volume-title":"Proc.\u00a0of the 4th International Workshop on Machine Learning","author":"D. Haussler","year":"1987","unstructured":"Haussler, D.: Bias, version spaces and Valiant\u2019s learning framework. In: Proc.\u00a0of the 4th International Workshop on Machine Learning, pp. 324\u2013336. University of California, Irvine (1987)"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45708-9_6","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"N.J. Hopper","year":"2002","unstructured":"Hopper, N.J., Langford, J., von Ahn, L.: Provably secure steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 77\u201392. Springer, Heidelberg (2002)"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11523468_26","volume-title":"Automata, Languages and Programming","author":"N.J. Hopper","year":"2005","unstructured":"Hopper, N.J.: On Steganographic Chosen Covertext Security. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 311\u2013323. Springer, Heidelberg (2005)"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/11940128_75","volume-title":"Algorithms and Computation","author":"C. Hundt","year":"2006","unstructured":"Hundt, C., Li\u015bkiewicz, M., W\u00f6lfel, U.: Provably secure steganography and the complexity of sampling. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 754\u2013763. Springer, Heidelberg (2006)"},{"key":"38_CR15","first-page":"392","volume-title":"Proc.\u00a0STOC 1993","author":"M. Kearns","year":"1993","unstructured":"Kearns, M.: Efficient Noise-Tolerant Learning from Statistical Queries. In: Proc.\u00a0STOC 1993, pp. 392\u2013401. ACM, New York (1993)"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-74124-4_20","volume-title":"Information Hiding","author":"T.V. Le","year":"2007","unstructured":"Le, T.V., Kurosawa, K.: Bandwidth optimal steganography secure against adaptive chosen stegotext attacks. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds.) IH 2006. LNCS, vol.\u00a04437, pp. 297\u2013313. Springer, Heidelberg (2007)"},{"key":"38_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-40992-0_6","volume-title":"Algorithmic Learning Theory","author":"F. Letouzey","year":"2000","unstructured":"Letouzey, F., Denis, F., Gilleron, R.: Learning From Positive and Unlabeled Examples. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol.\u00a01968, pp. 71\u201385. Springer, Heidelberg (2000)"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/11745853_9","volume-title":"Public Key Cryptography - PKC 2006","author":"A. Lysyanskaya","year":"2006","unstructured":"Lysyanskaya, A., Meyerovich, M.: Provably secure steganography with imperfect sampling. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 123\u2013139. Springer, Heidelberg (2006)"},{"issue":"1","key":"38_CR19","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Machine Learning\u00a01(1), 81\u2013106 (1986)","journal-title":"Machine Learning"},{"key":"38_CR20","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-25937-4_22","volume-title":"Fast Software Encryption","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P.: Nonce-based symmetric encryption. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 348\u2013359. Springer, Heidelberg (2004)"},{"key":"38_CR22","first-page":"51","volume-title":"Crypto 1983","author":"G.J. Simmons","year":"1984","unstructured":"Simmons, G.J.: The prisoners\u2019 problem and the subliminal channel. In: Crypto 1983, pp. 51\u201367. Plenum Press, New York (1984)"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-45496-9_21","volume-title":"Information Hiding","author":"A. Westfeld","year":"2001","unstructured":"Westfeld, A.: F5-A Steganographic Algorithm. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol.\u00a02137, pp. 289\u2013302. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:14:23Z","timestamp":1558574063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}