{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:48Z","timestamp":1778128068873,"version":"3.51.4"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319783802","type":"print"},{"value":"9783319783819","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78381-9_2","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T05:53:14Z","timestamp":1522389194000},"page":"29-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Gold Standard for Security of\u00a0Universal Steganography"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Berndt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/49.668971","volume":"16","author":"RJ Anderson","year":"1998","unstructured":"Anderson, R.J., Petitcolas, F.A.P.: On the limits of steganography. IEEE J. Sel. Areas Commun. 16(4), 474\u2013481 (1998)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Magri, B., Venturi, D.: Subversion-resilient signature schemes. In: Proceedings of the CCS, pp. 364\u2013375. ACM (2015)","DOI":"10.1145\/2810103.2813635"},{"key":"2_CR3","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. 3378, pp. 210\u2013226. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_12"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Jaeger, J., Kane, D.: Mass-surveillance without the state: strongly undetectable algorithm-substitution attacks. In: Proceedings of the CCS 2015, pp. 1431\u20131440. ACM (2015)","DOI":"10.1145\/2810103.2813681"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44371-2_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"M Bellare","year":"2014","unstructured":"Bellare, M., Paterson, K.G., Rogaway, P.: Security of symmetric encryption against mass surveillance. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 1\u201319. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_1"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Berndt, S., Li\u015bkiewicz, M.: Algorithm substitution attacks from a steganographic perspective. In: Proceedings of the CCS, pp. 1649\u20131660 (2017). https:\/\/doi.org\/10.1145\/3133956.3133981","DOI":"10.1145\/3133956.3133981"},{"issue":"1","key":"2_CR7","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. Inf. Comput. 192(1), 41\u201356 (2004)","journal-title":"Inf. Comput."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-540-45146-4_33","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 565\u2013582. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_33"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chandran, N., Goyal, V., Ostrovsky, R., Sahai, A.: Covert multi-party computation. In: Proceedings of the FOCS, pp. 238\u2013248. IEEE Computer Society (2007)","DOI":"10.1109\/FOCS.2007.61"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Chatterjee, R., Bonneau, J., Juels, A., Ristenpart, T.: Cracking-resistant password vaults using natural language encoders. In: Proceedings of the S&P, pp. 481\u2013498 (2015). https:\/\/doi.org\/10.1109\/SP.2015.36","DOI":"10.1109\/SP.2015.36"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-29485-8_10","volume-title":"Topics in Cryptology \u2013 CT-RSA 2016","author":"C Cho","year":"2016","unstructured":"Cho, C., Dachman-Soled, D., Jarecki, S.: Efficient concurrent covert computation of string equality and set intersection. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 164\u2013179. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_10"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-49380-8_25","volume-title":"Information Hiding","author":"S Craver","year":"1998","unstructured":"Craver, S.: On public-key steganography in the presence of an active warden. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 355\u2013368. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49380-8_25"},{"issue":"3","key":"2_CR13","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. Cryptol. 22(3), 365\u2013394 (2009)","journal-title":"J. Cryptol."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-662-48116-5_28","volume-title":"Fast Software Encryption","author":"JP Degabriele","year":"2015","unstructured":"Degabriele, J.P., Farshim, P., Poettering, B.: A more cautious approach to security against mass surveillance. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 579\u2013598. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_28"},{"issue":"6","key":"2_CR15","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-04852-9_4","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"N Fazio","year":"2014","unstructured":"Fazio, N., Nicolosi, A.R., Perera, I.M.: Broadcast steganography. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 64\u201384. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_4"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00145-012-9131-8","volume":"26","author":"O Goldreich","year":"2013","unstructured":"Goldreich, O., Rothblum, R.D.: Enhancements of trapdoor permutations. J. Cryptol. 26(3), 484\u2013512 (2013)","journal-title":"J. Cryptol."},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Golla, M., Beuscher, B., D\u00fcrmuth, M.: On the security of cracking-resistant password vaults. In: Proceedings of the CCS, pp. 1230\u20131241 (2016). https:\/\/doi.org\/10.1145\/2976749.2978416","DOI":"10.1145\/2976749.2978416"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-53644-5_5","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2016","unstructured":"Hofheinz, D., Rao, V., Wichs, D.: Standard security does not imply indistinguishability under selective opening. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 121\u2013145. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_5"},{"key":"2_CR21","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 Hopper","year":"2005","unstructured":"Hopper, N.: On steganographic chosen covertext security. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 311\u2013323. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_26"},{"key":"2_CR22","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 \u2014 CRYPTO 2002","author":"NJ Hopper","year":"2002","unstructured":"Hopper, N.J., Langford, J., von Ahn, L.: Provably secure steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 77\u201392. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_6"},{"issue":"5","key":"2_CR23","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TC.2008.199","volume":"58","author":"NJ Hopper","year":"2009","unstructured":"Hopper, N.J., von Ahn, L., Langford, J.: Provably secure steganography. IEEE Trans. Comput. 58(5), 662\u2013676 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR24","doi-asserted-by":"crossref","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press, Boca Raton (2014)","edition":"2"},{"key":"2_CR25","unstructured":"Katzenbeisser, S., Petitcolas, F.A.P.: Defining security in steganographic systems. In: Proceedings of the Electronic Imaging, pp. 50\u201356. SPIE (2002)"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00145-012-9135-4","volume":"27","author":"A Kiayias","year":"2014","unstructured":"Kiayias, A., Raekow, Y., Russell, A., Shashidhar, N.: A one-time stegosystem and applications to efficient covert communication. J. Cryptol. 27(1), 23\u201344 (2014)","journal-title":"J. Cryptol."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-13190-5_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"E Kiltz","year":"2010","unstructured":"Kiltz, E., Mohassel, P., O\u2019Neill, A.: Adaptive trapdoor functions and chosen-ciphertext security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 673\u2013692. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_34"},{"key":"2_CR28","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 Van Le","year":"2007","unstructured":"Van Le, T., 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. 4437, pp. 297\u2013313. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74124-4_20"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-39200-9_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"Y Lindell","year":"2003","unstructured":"Lindell, Y.: A simpler construction of CCA2-secure public-key encryption under general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 241\u2013254. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_15"},{"key":"2_CR30","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. Theoret. Comput. Sci. 505, 27\u201341 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/3-540-39799-X_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"M Luby","year":"1986","unstructured":"Luby, M., Rackoff, C.: How to construct pseudo-random permutations from pseudo-random functions. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, p. 447. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_34"},{"key":"2_CR32","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. 3958, pp. 123\u2013139. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_9"},{"key":"2_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing - Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing - Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the STOC, pp. 33\u201343. ACM (1989)","DOI":"10.1145\/73007.73011"},{"key":"2_CR35","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-319-58469-0_24","volume-title":"ICT Systems Security and Privacy Protection","author":"C Pasquini","year":"2017","unstructured":"Pasquini, C., Sch\u00f6ttle, P., B\u00f6hme, R.: Decoy password vaults: at least as hard as steganography? In: De Capitani di Vimercati, S., Martinelli, F. (eds.) SEC 2017. IAICT, vol. 502, pp. 356\u2013370. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58469-0_24"},{"issue":"9","key":"2_CR36","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1016\/j.ic.2011.06.004","volume":"209","author":"B Ryabko","year":"2011","unstructured":"Ryabko, B., Ryabko, D.: Constructing perfect steganographic systems. Inf. Comput. 209(9), 1223\u20131230 (2011)","journal-title":"Inf. Comput."},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201998","author":"DR Simon","year":"1998","unstructured":"Simon, D.R.: Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334\u2013345. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054137"},{"key":"2_CR38","unstructured":"von Ahn, L., Hopper, N.J.: Public key steganography. IACR Cryptology ePrint Archive, 2003\/233 (2003)"},{"key":"2_CR39","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 von Ahn","year":"2004","unstructured":"von Ahn, L., Hopper, N.J.: Public-key steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 323\u2013341. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_20"},{"issue":"6","key":"2_CR40","doi-asserted-by":"publisher","first-page":"2706","DOI":"10.1109\/TIT.2008.921684","volume":"54","author":"Y Wang","year":"2008","unstructured":"Wang, Y., Moulin, P.: Perfectly secure steganography: capacity, error exponents, and code constructions. IEEE Trans. Inf. Theory 54(6), 2706\u20132722 (2008)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78381-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:19:07Z","timestamp":1710267547000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78381-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319783802","9783319783819"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78381-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tel Aviv","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}