Skip to main content
SpringerLink
Log in

Secure Repayable Storage System

  • Conference paper
Book cover Global E-Security (ICGeS 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 12))

Included in the following conference series:

  • 675 Accesses

Abstract

This paper proposes a method to create a system that allows data to be stored in several locations in secure and reliable manner. The system should create several shares from the data such that only pre-specified subsets of these shares can be used to retrieve the original data. The shares then will be distributed to shareholders over a local and/or wide area network. The system should allow requesting some/all shares from shareholders and using them to rebuild the data.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
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.

References

  1. Beimel, Ishai, Y.: On the Power of Nonlinear Secret-Sharing. In: Proc. IEEE Conference on Computational Complexity, Chicago, IL, June 2001, pp. 188–202 (2001)

    Google Scholar 

  2. Shamir: How to Share a Secret. Communications of the ACM 22, 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Simmons, G.: An Introduction to Shared Secret and/or Shared Control Schemes and their Application. In: Contemporary Cryptology - The Science of Information Integrity, pp. 441–497. IEEE Press, New York (1991)

    Google Scholar 

  4. Lagrange Interpolating Polynomial (accessed, September 2007), http://mathworld.wolfram.com/LagrangeInterpolatingPolynomial.html

  5. Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game, or a Completeness Theorem for Protocols with Honest Majority. In: Proc. 19th ACM Conference on Theory of Computing, New York, NY, January 1987, pp. 218–229 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Saudi Arabia

    T. M. Alkharobi

Authors
  1. T. M. Alkharobi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, The Burroughs, Middlesex University, NW4 4BT, London, UK

    Hamid Jahankhani

  2. Harrow School of Computer Science, University of Westminster, Watford Road, HA1 3TP, Harrow, UK

    Kenneth Revett

  3. School of Computing and Technology, University of East London, University Way, E16 2RD, London, UK

    Dominic Palmer-Brown

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alkharobi, T.M. (2008). Secure Repayable Storage System. In: Jahankhani, H., Revett, K., Palmer-Brown, D. (eds) Global E-Security. ICGeS 2008. Communications in Computer and Information Science, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69403-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69403-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69402-1

  • Online ISBN: 978-3-540-69403-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation