Abstract
Polynomial-based secret sharing techniques are most preferred in many applications. Image secret sharing techniques based on polynomial functions become computationally heavy if image size is large. Sequential operations are not that effective for construction and reconstruction algorithms on large size images. Parallel computing works efficiently when load and time reduction on a single machine is required. The concurrent execution of polynomial operations on image pixel values while applying steps of construction of shares and reconstruction of the secret makes the scheme more efficient. Hadoop-based concurrent approach is proposed for polynomial-based image secret sharing scheme. The experimental results show that Hadoop-based cluster speeds up the process up to 18% by one slave and up to 14% by adding two slave nodes. The addition in number of slave nodes accelerates the performance up to 50% for very large size images in the polynomial-based secret sharing algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shamir (1979) How to share a secret. Commun ACM 22(11):612–613
Thein CC, Lin JC (2002) Secret image sharing. Comput Graph 26:765–770
Patil S, Deshmuth P (2012) An explication of multifarious secret sharing schemes. Int J Comput Appl 46(19):0975–8887
Sonali P (2018) Efficient image secret sharing using parallel processing for row-wise encoding and decoding. In: International conference on intelligent computing and applications, advances in intelligent systems and computing. Springer Nature Singapore Pvt Ltd, Singapore, p 632
Sachdeva K, Kaur J, Singh G (2017) Image processing on multi node hadoop cluster. In: International conference on electrical, electronics, communication, computer and optimization techniques (ICEECCOT)
Premchaiswadi W, Romsaiyud W (2012) Optimizing and tuning map reduce jobs to improve the large-scale data analysis process. Int J Intell Syst
Arkan A, Al-Hamodi G, Songfeng LU (2016) MRFP: discovery frequent patterns using mapreduce frequent pattern growth. In: International conference on network and information systems for computer
Chen H, Lin TY, Zhibing Z, Zhong J (2013) Parallel mining frequent patterns over big transactional data in extended mapreduce. In: IEEE international conference on granular computing (GrC)
Archita B, Deipali G (2015) CFI mining using DAG based on MapReduce. Int J Emerg Trends Technol Comput Sci (IJETTCS) 4(3)
Mohamed HA (2012) Hadoop mapreduce for remote sensing image analysis. Int J Emerg Technol Adv Eng (IJETAE) 2(4)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Patil, S., Raut, R., Sorte, C., Jha, G. (2022). Accelerating Polynomial-Based Image Secret Sharing Using Hadoop. In: Marriwala, N., Tripathi, C.C., Jain, S., Mathapathi, S. (eds) Emergent Converging Technologies and Biomedical Systems . Lecture Notes in Electrical Engineering, vol 841. Springer, Singapore. https://doi.org/10.1007/978-981-16-8774-7_6
Download citation
DOI: https://doi.org/10.1007/978-981-16-8774-7_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-8773-0
Online ISBN: 978-981-16-8774-7
eBook Packages: EngineeringEngineering (R0)