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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Corson, S., Macker, J.: Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations. RFC 2501 (January 1999)
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)
Shamir, A.: How to Share a Secret. Communications of ASM 22 (11) (November 1979)
Beimel, A., Tassa, T., Weinreb, E.: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM Journal on Discrete Mathematics 22(1) (February 2008)
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)
Bonnefoi, P.-F., Sauveron, D.: MANETS: An Exclusive choice between use and security? Computing and Informatics 22, 1001–1013 (2003) (October 22, 2007)
Graph Theory by Narshing Deo [PHI]
Brute Force Attack, http://en.wikipedia.org/wiki/Brute_force_attack
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)