{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:45:23Z","timestamp":1725839123572},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_14","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"151-162","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Ernst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jcss.2007.04.011","volume":"74","author":"M Alekhnovich","year":"2008","unstructured":"Alekhnovich, M., Braverman, M., Feldman, V., Klivans, A.R., Pitassi, T.: The complexity of properly learning simple concept classes. J. Comput. Syst. Sci. 74(1), 16\u201334 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36(4), 929\u2013965 (1989)","journal-title":"J. ACM"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"De, A., Diakonikolas, I., Servedio, R.A.: Learning from satisfying assignments. In: Indyk, P. (ed.) Proc. SODA, pp. 478\u2013497. SIAM, Philadelphia (2015)","DOI":"10.1137\/1.9781611973730.33"},{"issue":"3","key":"14_CR4","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. J. Cryptology 22(3), 365\u2013394 (2009)","journal-title":"J. Cryptology"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Flammini, M., Marchetti-Spaccamela, A., Ku\u010dera, L.: Learning DNF formulae under classes of probability distributions. In: Proc. COLT, pp. 85\u201392. ACM, New York (1992)","DOI":"10.1145\/130385.130395"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139192903","volume-title":"Steganography in digital media: principles, algorithms, and applications","author":"J Fridrich","year":"2009","unstructured":"Fridrich, J.: Steganography in digital media: principles, algorithms, and applications. Cambridge University Press, New York (2009)"},{"issue":"5","key":"14_CR7","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TC.2008.199","volume":"58","author":"N Hopper","year":"2009","unstructured":"Hopper, N., von Ahn, L., Langford, J.: Provably secure steganography. IEEE T. Comput. 58(5), 662\u2013676 (2009)","journal-title":"IEEE T. Comput."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"MR Jerrum","year":"1986","unstructured":"Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sc. 43, 169\u2013188 (1986)","journal-title":"Theor. Comput. Sc."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ker, A.D., Bas, P., B\u00f6hme, R., Cogranne, R., Craver, S., Filler, T., Fridrich, J., Pevn\u00fd, T.: Moving steganography and steganalysis from the laboratory into the real world. In: Proc. IH&MMSec, pp. 45\u201358. ACM, New York (2013)","DOI":"10.1145\/2482513.2482965"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/TIFS.2011.2175919","volume":"7","author":"J Kodovsky","year":"2012","unstructured":"Kodovsky, J., Fridrich, J., Holub, V.: Ensemble classifiers for steganalysis of digital media. IEEE T. Inform. Forensics and Sec. 7(2), 432\u2013444 (2012)","journal-title":"IEEE T. Inform. Forensics and Sec."},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/inco.1994.1024","volume":"110","author":"L Kucera","year":"1994","unstructured":"Kucera, L., Marchetti-Spaccamela, A., Protasi, M.: On learning monotone DNF formulae under uniform distributions. Inform. Comput. 110(1), 84\u201395 (1994)","journal-title":"Inform. Comput."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2012.03.037","volume":"505","author":"M Li\u015bkiewicz","year":"2013","unstructured":"Li\u015bkiewicz, M., Reischuk, R., W\u00f6lfel, U.: Grey-box steganography. Theor. Comput. Sc. 505, 27\u201341 (2013)","journal-title":"Theor. Comput. Sc."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0220021","volume":"20","author":"BK Natarajan","year":"1991","unstructured":"Natarajan, B.K.: Probably approximate learning of sets and functions. SIAM J. Comput. 20(2), 328\u2013351 (1991)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM 35(4), 965\u2013984 (1988)","journal-title":"J. ACM"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s002249910002","volume":"33","author":"Y Sakai","year":"2000","unstructured":"Sakai, Y., Maruoka, A.: Learning monotone log-term DNF formulas under the uniform distribution. Theory of Comput. Syst. 33(1), 17\u201333 (2000)","journal-title":"Theory of Comput. Syst."},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-57369-0_39","volume-title":"Algorithmic Learning Theory","author":"Y Sakai","year":"1993","unstructured":"Sakai, Y., Maruoka, A.: Learning \n                      \n                        \n                      \n                      $$k$$\n                    -term monotone boolean formulae. In: Doshita, S., Furukawa, K., Jantke, K.P., Nishida, T. (eds.) ALT 1992. LNCS, vol. 743, pp. 195\u2013207. Springer, Heidelberg (1993)"},{"key":"14_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9781118437957","volume-title":"Machine Learning in Image Steganalysis","author":"HG Schaathun","year":"2012","unstructured":"Schaathun, H.G.: Machine Learning in Image Steganalysis. Wiley-IEEE Press, Chichester (2012)"},{"issue":"11","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. CACM 27(11), 1134\u20131142 (1984)","journal-title":"CACM"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Verbeurgt, K.: Learning DNF under the uniform distribution in quasi-polynomial time. In: Proc. COLT, pp. 314\u2013326. Morgan Kaufmann Publishers Inc., San Francisco (1990)","DOI":"10.1016\/B978-1-55860-146-8.50027-8"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:56:08Z","timestamp":1559325368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}