Abstract
Motivated by the proactive security problem, we study the question of maintaining secrecy against a mobile eavesdropper that can eavesdrop to a bounded number of communication channels in each round of the protocol. We characterize the networks in which secrecy can be maintained against an adversary that can eavesdrop to t channels in each round. Using this characterization, we analyze the number of eavesdropped channels that complete graphs can withhold while maintaining secrecy.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beimel, A., Franklin, M.: Edge eavesdropping games (2006), http://www.cs.bgu.ac.il/~beimel/Papers/
Bienstock, D., Seymour, P.: Monotonicity in graph searching. J. of Algorithms 12(2), 239–245 (1991)
Buhrman, H., Garay, J.A., Hoepman, J.H.: Optimal resiliency against mobile faults. In: 25th International Symp. on Fault-Tolerant Computing, pp. 83–88 (1995)
Cai, N., Yeung, R.W.: Secure network coding. In: International Symposium on Information Theory (2002)
Feldman, J., Malkin, T., Stein, C., Servedio, R.A.: On the capacity of secure network coding. In: Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing (2004)
Franklin, M., Galil, Z., Yung, M.: Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. J. of the ACM 47(2), 225–243 (2000)
Garay, J.A.: Reaching (and maintaining) agreement in the presence of mobile faults. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 253–264. Springer, Heidelberg (1994)
Garay, J.A., Gennaro, R., Jutla, C.S., Rabin, T.: Secure distributed storage and retrieval. Theoretical Computer Science 243(1-2), 363–389 (2000)
Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995)
Jain, K.: Security based on network topology against the wiretapping attack. IEEE Magazine, Special issue on Topics in Wireless Security (2004)
Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoretical Computer Science 47, 205–218 (1986)
LaPaugh, A.: Recontamination does not help to search a graph. J. of the ACM 40(2), 224–245 (1993)
Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: Proc. of the 10th ACM Symp. on Principles of Distributed Computing, pp. 51–59 (1991)
Parsons, T.D.: Pursuit evasion in a graph. In: Theory and Application of Graphs, pp. 426–441. Springer, Heidelberg (1976)
Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28(4), 656–715 (1949)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beimel, A., Franklin, M. (2006). Edge Eavesdropping Games. In: De Prisco, R., Yung, M. (eds) Security and Cryptography for Networks. SCN 2006. Lecture Notes in Computer Science, vol 4116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832072_1
Download citation
DOI: https://doi.org/10.1007/11832072_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38080-1
Online ISBN: 978-3-540-38081-8
eBook Packages: Computer ScienceComputer Science (R0)