Skip to main content

VSPACE: A New Secret Sharing Scheme Using Vector Space

  • Conference paper
Computer Networks and Information Technologies (CNC 2011)

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

  • 891 Accesses

Abstract

In this paper, a new secret sharing scheme utilizing the vector space is proposed. Initially, the basis vectors of each character of the secret are found on the basis of a random partition value, N. Next, the basis vectors of each partition are distributed in separate files and kept well distributed throughout the network. Only an authenticated person who knows the location of the shares can collect all the shares, distributed throughout the network, remove the redundancy and take original basis vectors to reconstruct the actual secret. The scheme is well secured against Brute Force attacks and partial discloser problem. Malicious behaviors are restricted by assigning dummy shares as long as they are not trustworthy.

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

Access this chapter

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
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Corson, S., Macker, J.: Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations. RFC 2501 (January 1999)

    Google Scholar 

  2. Yang, H., Luo, H., Ye, F., Songwulu, Zhang, L.: Security in Mobile ADHOC NETWORKS: Challenges and Solutions. In: IEEE Wireless Communications and Networking conference (2004)

    Google Scholar 

  3. Shamir, A.: How to Share a Secret. Communications of ASM 22 (11) (November 1979)

    Google Scholar 

  4. Beimel, A., Tassa, T., Weinreb, E.: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM Journal on Discrete Mathematics 22(1) (February 2008)

    Google Scholar 

  5. Michiardi, P., Molva, R.: CORE: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad hoc Networks. In: Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security, pp. 107–121 (September 2002)

    Google Scholar 

  6. Bonnefoi, P.-F., Sauveron, D.: MANETS: An Exclusive choice between use and security? Computing and Informatics 22, 1001–1013 (2003) (October 22, 2007)

    Google Scholar 

  7. Graph Theory by Narshing Deo [PHI]

    Google Scholar 

  8. Brute Force Attack, http://en.wikipedia.org/wiki/Brute_force_attack

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choudhury, P., Banerjee, A., Satyanarayana, V., Ghosh, G. (2011). VSPACE: A New Secret Sharing Scheme Using Vector Space. In: Das, V.V., Stephen, J., Chaba, Y. (eds) Computer Networks and Information Technologies. CNC 2011. Communications in Computer and Information Science, vol 142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19542-6_95

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19542-6_95

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19541-9

  • Online ISBN: 978-3-642-19542-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics