{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:27Z","timestamp":1725474987364},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_75","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"754-763","source":"Crossref","is-referenced-by-count":4,"title":["Provably Secure Steganography and the Complexity of Sampling"],"prefix":"10.1007","author":[{"given":"Christian","family":"Hundt","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[]},{"given":"Ulrich","family":"W\u00f6lfel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"75_CR1","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)"},{"issue":"4","key":"75_CR2","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 of Communications\u00a016(4), 474\u2013481 (1998)","journal-title":"IEEE Journal of Selected Areas of Communications"},{"key":"75_CR3","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)"},{"key":"75_CR4","unstructured":"Le, T.V., Kurosawa, K.: Efficient public key steganography secure against adaptively chosen stegotext attacks. Technical Report 2003\/244, IACR Archive (2003)"},{"key":"75_CR5","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":"75_CR6","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.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 123\u2013139. Springer, Heidelberg (2006)"},{"key":"75_CR7","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"key":"75_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2000)"},{"key":"75_CR9","first-page":"328","volume-title":"Proc. ACM-SIAM Symposium on Discrete algorithms - ACM 2004","author":"K. Iwama","year":"2004","unstructured":"Iwama, K., Tamaki, S.: Improved upper bounds for 3-sat. In: Proc. ACM-SIAM Symposium on Discrete algorithms - ACM 2004, pp. 328\u2013328. SIAM, Philadelphia (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:50:12Z","timestamp":1619509812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11940128_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}