{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:21Z","timestamp":1760202561641,"version":"3.34.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T00:00:00Z","timestamp":1207612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s00145-008-9020-3","type":"journal-article","created":{"date-parts":[[2008,4,7]],"date-time":"2008-04-07T15:33:00Z","timestamp":1207582380000},"page":"365-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Upper and Lower Bounds on Black-Box Steganography"],"prefix":"10.1007","volume":"22","author":[{"given":"Nenad","family":"Dedi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gene","family":"Itkis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,8]]},"reference":[{"key":"9020_CR1","series-title":"Lecture Notes in Computer Science","first-page":"210","volume-title":"Second Theory of Cryptography Conference\u2014TCC 2005","author":"M. Backes","year":"1995","unstructured":"M. Backes, C. Cachin, Public-key steganography with active attacks, in Second Theory of Cryptography Conference\u2014TCC 2005, ed. by J. Kilian, Lecture Notes in Computer Science, vol.\u00a03378 (Springer, New York, 1995), pp.\u00a0210\u2013226"},{"issue":"7","key":"9020_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"B. Bloom, Space\/time tradeoffs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"9020_CR3","unstructured":"A. Broder, M. Mitzenmacher, Network applications of bloom filters: A survey, in Proceedings of the Fortieth Annual Allerton Conference on Communication, Control and Computing, 2002"},{"key":"9020_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-49380-8_21","volume-title":"Second International Workshop on Information Hiding","author":"C. Cachin","year":"1998","unstructured":"C. Cachin, An information-theoretic model for steganography, in Second International Workshop on Information Hiding, Lecture Notes in Computer Science, vol.\u00a01525 (Springer, New York, 1998), pp.\u00a0306\u2013316"},{"key":"9020_CR5","series-title":"Lecture Notes in Computer Science","first-page":"227","volume-title":"Second Theory of Cryptography Conference\u2014TCC 2005","author":"N. Dedi\u0107","year":"1995","unstructured":"N. Dedi\u0107, G. Itkis, L. Reyzin, S. Russell, Upper and lower bounds on black-box steganography, in Second Theory of Cryptography Conference\u2014TCC 2005, ed. by J. Kilian, Lecture Notes in Computer Science, vol.\u00a03378 (Springer, New York, 1995), pp.\u00a0227\u2013244"},{"key":"9020_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2837-5","volume-title":"A Modern Approach to Probability Theory","author":"B. Fristedt","year":"1997","unstructured":"B. Fristedt, L. Gray, A Modern Approach to Probability Theory (Birkh\u00e4user, Basel, 1997)"},{"issue":"4","key":"9020_CR7","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"9020_CR8","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, A. Nussboim, On the implementation of huge random objects, in 44th Annual Symposium on Foundations of Computer Science, Cambridge, MA, 2003. IEEE, pp.\u00a068\u201379","DOI":"10.1109\/SFCS.2003.1238182"},{"issue":"4","key":"9020_CR9","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, Construction of pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"301","key":"9020_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"W. Hoeffding, Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"9020_CR11","doi-asserted-by":"crossref","unstructured":"N. Hopper, J. Langford, L. von Ahn, Provably secure steganography. Technical Report 2002\/137, Cryptology e-print archive, http:\/\/eprint.iacr.org , 2002. Preliminary version in Crypto 2002","DOI":"10.1007\/3-540-45708-9_6"},{"key":"9020_CR12","unstructured":"N.J. Hopper, Toward a Theory of Steganography. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA, July 2004. Available as Technical Report CMU-CS-04-157"},{"key":"9020_CR13","unstructured":"L. Kissner, T. Malkin, O. Reingold, Private communication to N. Hopper, J. Langford, L. von Ahn, 2002"},{"key":"9020_CR14","unstructured":"T. Van Le, Efficient provably secure public key steganography. Technical Report 2003\/156, Cryptology e-print archive, http:\/\/eprint.iacr.org , 2003"},{"key":"9020_CR15","unstructured":"T. Van Le, K. Kurosawa, Efficient public key steganography secure against adaptively chosen stegotext attacks. Technical Report 2003\/244, Cryptology e-print archive, http:\/\/eprint.iacr.org , 2003"},{"key":"9020_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511606267","volume-title":"The Theory of Information and Coding","author":"R.J. McEliece","year":"2002","unstructured":"R.J. McEliece, The Theory of Information and Coding, 2nd edn. (Cambridge University Press, Cambridge, 2002)","edition":"2"},{"key":"9020_CR17","unstructured":"L. Reyzin, A note on the statistical difference of small direct products. Technical Report BUCS-TR-2004-032, CS Department, Boston University, September 21, 2004. Available from http:\/\/www.cs.bu.edu\/techreports\/"},{"key":"9020_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2004","author":"L. Ahn von","year":"2004","unstructured":"L. von Ahn, N.J. Hopper, Public-key steganography, in Advances in Cryptology\u2014EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, Lecture Notes in Computer Science, vol.\u00a03027 (Springer, New York, 2004)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-008-9020-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9020-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T14:58:16Z","timestamp":1738162696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-008-9020-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9020"],"URL":"https:\/\/doi.org\/10.1007\/s00145-008-9020-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2008,4,8]]},"assertion":[{"value":"1 January 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2008","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}