Results 11 to 20 of about 4,019 (261)

Multi Secret Image Sharing Scheme of General Access Structure with Meaningful Shares

open access: yesMathematics, 2020
A Multi Secret Image sharing scheme can share several secret images among certain participators securely. Boolean-based secret sharing schemes are one kind of secret sharing method with light-weighted computation compared to the previous complex ...
Hongliang Cai, Dan Tang
doaj   +1 more source

Constructions of some secret sharing schemes based on linear codes [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика
There are perfect and ideal threshold secret sharing schemes, for example, Shamir’s secret sharing  scheme. For the case of general secret sharing schemes with an arbitrary access structure, it is possible to construct a perfect scheme for any
Ratseev, Sergey Mihailovich
doaj   +1 more source

(k,n) secret image sharing scheme capable of cheating detection

open access: yesEURASIP Journal on Wireless Communications and Networking, 2018
In a (k,n) threshold secret image sharing scheme, a secret image is encrypted into n image-shadows that satisfy the following: (1) any less than k image-shadows get no information on the image and (2) any k or more image-shadows can reconstruct the ...
Yan-Xiao Liu   +2 more
doaj   +1 more source

Some Multisecret-Sharing Schemes over Finite Fields

open access: yesMathematics, 2020
A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot.
Selda Çalkavur, Patrick Solé
doaj   +1 more source

Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure

open access: yesJournal of Mathematical Cryptology, 2013
An n-player -secure robust secret sharing scheme is a (t,n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least , from the set of all shares even if up to t players provide incorrect ...
Jhanwar Mahabir P.   +1 more
doaj   +1 more source

Dynamic Multi-secret Sharing Scheme in Vector Space Without Trusted Center [PDF]

open access: yesJisuanji gongcheng, 2017
The existing secret sharing scheme in the vector space cannot achieve the secret share update or the dynamic addition and deletion of members,and it is hard to ensure the existence of trusted center,so a multi-secret sharing scheme without trusted center
WANG Yuli,DU Weizhang
doaj   +1 more source

A Group Identification Protocol with Leakage Resilience of Secret Sharing Scheme

open access: yesComplexity, 2020
Secret sharing has been study for many years and has had a number of real-word applications. There are several methods to construct the secret-sharing schemes. One of them is based on coding theory. In this work, we construct a secret-sharing scheme that
Ping Li   +5 more
doaj   +1 more source

(t,n) multi-secret sharing scheme extended from Harn-Hsu’s scheme

open access: yesEURASIP Journal on Wireless Communications and Networking, 2018
Multi-secret sharing scheme has been well studied in recent years. In most multi-secret sharing schemes, all secrets must be recovered synchronously; the shares cannot be reused any more.
Tong Zhang, Xizheng Ke, Yanxiao Liu
doaj   +1 more source

Hierarchical secret sharing scheme for WSN based on linear homogeneous recurrence relations

open access: yesInternational Journal of Distributed Sensor Networks, 2022
Wireless sensor network is a key technology in the sensing layer of the Internet of Things. Data security in wireless sensor network is directly related to the authenticity and validity of data transmitted in the Internet of Things.
Yan Lin   +3 more
doaj   +1 more source

Multi-Secret Sharing Schemes [PDF]

open access: yes, 1994
A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1,..., sm among a set of participants P. In this paper we put forward a general theory of multi-secret sharing schemes by using an information theoretical framework. We prove lower bounds on the size of information held by each participant for various access structures.
Carlo Blundo   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy