Abstract
We consider problems where n people are communicating and a random subset of them is trying to leak information, without making it clear which people are leaking the information. We introduce a measure of suspicion, and show that the amount of leaked information will always be bounded by the expected increase in suspicion, and that this bound is tight. We ask the question: Suppose a large number of people have some information they want to leak, but they want to ensure that after the communication, an observer will assign probability ≤ c to the events that each of them is trying to leak the information. How much information can they reliably leak, per person who is leaking? We show that the answer is \(\left(\frac{-\log(1-c)}{c}-\log(e)\right)\) bits.
Full version of the paper can be found here: http://arxiv.org/abs/1402.3125
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aumann, R.J.: Interactive epistemology I: Knowledge. International Journal of Game Theory 28(3), 263–300 (1999)
Brody, J., Jakobsen, S., Scheder, D., Winkler, P.: Cryptogenography. In: ITCS (2014)
Cover, T.M., Thomas, J.A.: Elements of information theory, New York, NY, USA. Wiley-Interscience (1991)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218–229. ACM, New York (1987)
Hopper, N.J.: Toward a theory of Steganography. PhD thesis, Carnegie Mellon University (2004)
Jakobsen, S.: Information theoretical cryptogenography. arXiv:1402.3125 [cs.CR] (2014)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73–85 (1989)
Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27 (1948)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakobsen, S.K. (2014). Information Theoretical Cryptogenography. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43948-7_56
Download citation
DOI: https://doi.org/10.1007/978-3-662-43948-7_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43947-0
Online ISBN: 978-3-662-43948-7
eBook Packages: Computer ScienceComputer Science (R0)