{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:02Z","timestamp":1725550502475},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290391"},{"type":"electronic","value":"9783540314813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558859_10","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T09:59:13Z","timestamp":1132739953000},"page":"118-130","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Steganography with Provable Security Guarantees"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yona","family":"Raekow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-49380-8_21","volume-title":"Information Hiding","author":"C. Cachin","year":"1998","unstructured":"Cachin, C.: An information-theoretic model for steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol.\u00a01525, pp. 306\u2013318. Springer, Heidelberg (1998)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-49380-8_24","volume-title":"Information Hiding","author":"J. Z\u00f6llner","year":"1998","unstructured":"Z\u00f6llner, J., Federrath, H., Klimant, H., Pfitzmann, A., Piotraschke, R., Westfeld, A., Wicke, G., Wolf, G.: Modeling the security of steganographic systems. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol.\u00a01525, pp. 344\u2013354. Springer, Heidelberg (1998)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Mittelholzer, T.: An information-theoretic approach to steganography and watermarking. In: Information Hiding, pp. 1\u201316 (1999)","DOI":"10.1007\/10719724_1"},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033, 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM\u00a051, 231\u2013262 (2004)","journal-title":"J. ACM"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms\u00a03, 289\u2013304 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"10_CR8","series-title":"Graduate Texts in Mathematics","volume-title":"Introduction to Coding Theory","author":"J. Lint van","year":"1998","unstructured":"van Lint, J.: Introduction to Coding Theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a086. Springer, Heidelberg (1998)","edition":"3"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TIT.1965.1053730","volume":"IT-11","author":"R.G. Gallager","year":"1965","unstructured":"Gallager, R.G.: A simple derivation of the coding theorem and some applications. IEEE Transactions on Information Theory\u00a0IT-11, 3\u201318 (1965)","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput.\u00a022, 838\u2013856 (1993)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558859_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:14Z","timestamp":1619507414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558859_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290391","9783540314813"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11558859_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}