Refining image steganography distribution for higher security multimedia counting-based secret-sharing
- PDF / 2,740,796 Bytes
- 31 Pages / 439.37 x 666.142 pts Page_size
- 18 Downloads / 169 Views
Refining image steganography distribution for higher security multimedia counting-based secret-sharing Taghreed AlKhodaidi 1 & Adnan Gutub 2 Received: 12 December 2019 / Revised: 20 August 2020 / Accepted: 25 August 2020 # Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract
Counting-based secret sharing is becoming a vital efficient multimedia technique for raising the security of sensitive data especially when collective access to data are essential. Secret sharing distributes shares to participants forcing their joint availability in order to give permission. The share keys of the system deserve to be remembered and highly protected against intruders, presenting a challenging issue, noticing that shares are normally produced without giving participants any preference. Therefore, this research adds image steganography technique to the counting-based secret-sharing system to gain more applicable security. The paper proposes redistribution of LSB image steganography to embed share keys in colour cover image. The proposed method ensured that the shares hiding locations differ within cover images to increase the level of security. The paper analysis show that stegoimage quality and security is attractive. It showed interesting results in terms of performance and payload capacity motivating this research to be a direction for coming improvements. Keywords Information security . Secret sharing scheme . Share key . Counting based secret sharing . Steganography . Image steganography . Cover image
1 Introduction Secret sharing technique is a security approach of information for collective access. It uses a target key (TK) as main accessing authentication tool to access data. The system develops many share keys for distribution to users such that some of them, or all, are essential to be combined to give
* Adnan Gutub [email protected] Taghreed AlKhodaidi [email protected]
1
Computer Science Department at Al-Qunfudhah, Umm Al-Qura University, Al-Qunfudhah, Saudi Arabia
2
Computer Engineering Department, Umm Al-Qura University, Makkah, Saudi Arabia
Multimedia Tools and Applications
the proper access. Every user is responsible for securing his share keys in order to be called whenever the combination is needed [9]. The secret sharing idea was introduced in 1979 by Shamir [39] and Blakley [13] (k, n) threshold schemes independently. The principle secret (k, n) scheme indicates that minimum of k users are essential to be available to reconstruct TK to allow authentic accessing the system [6]. A multi secret sharing scheme (m, k, n) includes multi secret. The secret sharing scheme contains a collection A of a subset of a group named the access structure and a set of n group. Any subset not in A cannot disclose any information about the target key. The multi secret sharing system allows each group to reconstruct the secret. In the secret sharing scheme, all participants have equal privileges, but in different cases may not be equal. Multiple plans used in secret sharing schemes, which diffe
Data Loading...
