Abstract
In this paper, we propose a mathematical programming model to describe an offense-defense scenario. In the offense problem, the objective of attackers is to compromise nodes in order to steal information. Therefore, the attackers try to recover secrets through compromising certain nodes and to maximize the information leakage as much as possible. During the attack actions, the attacker must allocate a limited budget to collect a large enough number of shares and decrypted keys through compromising certain nodes. Therefore, we advocate Lagrangean Relaxation algorithms and the proposed heuristics to find a near optimal solution. Through solutions from the perspective of the attacker, we then induce some efficient defense mechanisms for the network operators.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Azadmanesh, A., Krings, A.W., Oman, P.W.: Security and Survivability of Networked Systems. In: Proceedings of the 38th IEEE Hawaii International Conference on System Sciences (2005)
Al-Kuwaiti, M., Kyriakopoulos, N., Hussein, S.: Network Dependability, Fault-tolerance, Reliability, Security, Survivability. In: A Framework for Comparative Analysis. The George Washington University (2006)
Shamir, A.: How to Share a Secret. Massachusetts Institute of Technology (1979)
Subbiah, A., Blough, D.M.: An Approach for Fault Tolerant and Secure Data Storage in Collaborative Work Environments. School of Electrical and Computer Engineering Georgia Institute of Technology (2005)
Ganger, G.R., Kiliççöte, H., Strunk, J.D., Wylie, J.J., Bigrigg, M.W., Khosla, P.K.: Survivable Information Storage Systems. Garnegie Mellon University (2000)
Levitin, G.: Optimal Defense Strategy against Intentional Attacks. IEEE Transactions on Reliability 56(1) (2007)
Fisher, M.L.: An Application Oriented Guide to Lagrangean Relaxation. Interfaces 15(2), 10–21 (1985)
Herzberg, A., Krawczyk, H., Yung, M., Jarecki, S.: Proactive Secret Sharing or How to Cope with Perpetual Leakage. IBM T.J. Watson Research Center (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, F.YS., Chu, KC., Chen, PY., Chen, GW. (2010). Near Optimal Secret Sharing for Information Leakage Maximization. In: GarcÃa-Pedrajas, N., Herrera, F., Fyfe, C., BenÃtez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13033-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-13033-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13032-8
Online ISBN: 978-3-642-13033-5
eBook Packages: Computer ScienceComputer Science (R0)