566 research outputs found
Elucidation of Verifiable Secret Sharing Schemes for Images
Abstract: Images proved to be better medium for sharing sensitive data. Earlier secret sharing schemes were based on numbers and further were also applied on images. Most of the existing schemes proposed do not have the capability of verification of the shares and hence are prone to cheating either by the original secret holder or the participants. Some of these schemes provided security but required additional computation in the form of certificate vectors or error correction codes The intent of this paper is to discuss the verifiable secret sharing schemes. The paper analyses these schemes and presents a comparative study of the same. The parameters used for comparative study are threshold, cheater identification, techniques used for verification, need secure channel, etc. This paper will support in choosing the verifiable secret sharing scheme for specific applications
On Proactive Verifiable Secret Sharing Schemes
The paper has been presented at the International Conference Pioneers of Bulgarian
Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006.
The material in this paper was presented in part at the 11th Workshop on Selected Areas in Cryptography (SAC) 2004This paper investigates the security of Proactive Secret Sharing
Schemes. We first consider the approach of using commitment to 0 in the
renewal phase in order to refresh the player's shares and we present two types
of attacks in the information theoretic case. Then we prove the conditions
for the security of such a proactive scheme. Proactivity can be added also
using re-sharing instead of commitment to 0. We investigate this alternative
approach too and describe two protocols. We also show that both techniques
are not secure against a mobile adversary.
To summarize we generalize the existing threshold protocols to protocols
for general access structure. Besides this, we propose attacks against the
existing proactive verifiable secret sharing schemes, and give modifications
of the schemes that resist these attacks
Society-oriented cryptographic techniques for information protection
Groups play an important role in our modern world. They are more reliable and more trustworthy than individuals. This is the reason why, in an organisation, crucial decisions are left to a group of people rather than to an individual. Cryptography supports group activity by offering a wide range of cryptographic operations which can only be successfully executed if a well-defined group of people agrees to co-operate. This thesis looks at two fundamental cryptographic tools that are useful for the management of secret information. The first part looks in detail at secret sharing schemes. The second part focuses on society-oriented cryptographic systems, which are the application of secret sharing schemes in cryptography. The outline of thesis is as follows
Cheating Detection and Cheater Identification in CRT-based Secret Sharing Schemes
In this paper we analyze the cheating detection and
cheater identification problems for the secret sharing schemes
based on the Chinese remainder theorem (CRT), more exactly
for Mignotte [1] and Asmuth-Bloom [2] schemes. We prove
that the majority of the solutions for Shamir’s scheme [3] can
be translated to these schemes and, moreover, there are some
interesting specific solutions
- …