Skip to main content

Near Optimal Secret Sharing for Information Leakage Maximization

  • Conference paper
Trends in Applied Intelligent Systems (IEA/AIE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6098))

  • 1395 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Shamir, A.: How to Share a Secret. Massachusetts Institute of Technology (1979)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Levitin, G.: Optimal Defense Strategy against Intentional Attacks. IEEE Transactions on Reliability 56(1) (2007)

    Google Scholar 

  7. Fisher, M.L.: An Application Oriented Guide to Lagrangean Relaxation. Interfaces 15(2), 10–21 (1985)

    Article  Google Scholar 

  8. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics