Abstract
We explore the power of steganographic computation in an game-theoretic setting, where n stegocommunicants are attempting to complete a shared computation, and where a well-resourced censor is attempting to prevent the computation. For example, when collaboratively discovering the minimum value (\(\min _i x_i\)) in a public n-vector X, each stegocommunicant reads a randomly-selected element during each timestep. Each then transmits the index i of the smallest value they have seen to a randomly-selected collaborator. We prove that most stegocommunicants will learn the minimum value in \(O(\log n)\) time, w.h.p., if at most 10% of their population is censored in any timestep. The censor in our model retains a copy of all intercepted messages, using this information to optimally select the targets of their censorship at the beginning of each timestep. Our model of stegocomputation is relevant to stegosystems in which: (1) the stegoencoding is determined by the address of the recipient, (2) the censor does not have sufficient computational resource to stegodecode more than a fixed fraction (nominally 10%) of the messages in flight, and (3) the censor cannot store any messages other than the ones it has stegodecoded.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Allen, L.J.S.: Continuous-time and discrete-state branching processes. Stochastic Population and Epidemic Models. MBILS, vol. 1.3, pp. 1–12. Springer, Cham (2015). doi:10.1007/978-3-319-21554-9_1
Bellantoni, S.J.: Parallel random access machines with bounded memory wordsize. Inf. Comput. 91(2), 259–273 (1991)
Borodin, A., von zur Gathen, J., Hopcroft, J.: Fast parallel matrix and GCD computations. Inf. Control 52(3), 241–256 (1982)
Fernau, H., Lange, K.-J., Reinhardt, K.: Advocating ownership. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 286–297. Springer, Heidelberg (1996). doi:10.1007/3-540-62034-6_57
Hopper, N., von Ahn, L., Langford, J.: Provably secure steganography. IEEE Trans. Comput. 58(5), 662–676 (2009)
Liśkiewicz, M., Reischuk, R., Wölfel, U.: Grey-box steganography. Theoret. Comput. Sci. 505, 27–41 (2013)
Takebe, H., Tanaka, K.: Grey-box public-key steganography. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 294–305. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38236-9_27
Wayner, P.: Mimic functions. Cryptologia XVI(3), 193–214 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Thomborson, C., Jeanmougin, M. (2017). Stegogames. In: Pieprzyk, J., Suriadi, S. (eds) Information Security and Privacy. ACISP 2017. Lecture Notes in Computer Science(), vol 10343. Springer, Cham. https://doi.org/10.1007/978-3-319-59870-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-59870-3_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59869-7
Online ISBN: 978-3-319-59870-3
eBook Packages: Computer ScienceComputer Science (R0)