SSDLP: Sharing Secret Data between Leader and Participant

This paper investigates the problem of sharing the secret document containing a secret data between leader and participant(s) depending on specific conditions and rules. The participant(s) can retrieve part of the secret document but will not be able to retrieve any secret data without the leader. At the same time, the leader may have a little information about the secret document but cannot retrieve the secret data and the secret document without cooperating with participant(s). To evaluate the proposed model and the system efficiency, four tests are suggested, which are concatenation and sharing data test, leader visual test, information entropy analysis, and correlation analysis. Results show that the proposed model is efficient in sharing the data between the leader and participant(s) and the model can achieve our concept of the data sharing between leader and participant(s). However, by analyzing the proposed model using numerical tests and visual tests, the results show that the visual tests will not give attackers useful information about the original data, while the numerical tests show that the entropy attacks are not possible and the correlation between the adjacent pixels will not give useful information. Finally, the results show that the proposed model is strong against different types of attacks. 1. Introduction The secret sharing mechanism is a mechanism used in the large network to share the secret key between participants in the network, in which each participant has his own shadow. The purpose of secret sharing is to secure the key between different participants, to allow the authorized participants to retrieve the secret information, and to recover the secret key if some shadows are lost or distorted. Therefore, the key could be retrieved if and only if a specific number of participants collaborated together by using their shadows. In 1979, Shamir [1] and Blakley [2] introduced the prototype of the secret sharing named as ( , )-threshold secret sharing system. The problem statement introduced by Shamir in his work is the following. “Eleven scientists are working on a secret project. They wish to lockup the document in a cabinet so that the cabinet can be opened if and only if six or more of the scientists are present. What is the smallest number of locks needed? What is the smallest number of keys to the locks each scientist must carry?” In this paper, we try to reformulate the problem to a new problem called leader and participant sharing puzzle as follows. Eleven scientists are working on a secret project containing a secret data.