Results 21 to 30 of about 11,934 (254)
Rational quantum secret sharing. [PDF]
Sci Rep, 2018 AbstractThe traditional quantum secret sharing does not succeed in the presence of rational participants. A rational participant’s motivation is to maximize his utility, and will try to get the secret alone. Therefore, in the reconstruction, no rational participant will send his share to others.
Qin H, Tang WKS, Tso R.
europepmc +5 more sources
Lattice-based Threshold Secret Sharing Algorithm [PDF]
Jisuanji gongcheng, 2016 The secret sharing algorithm based on the traditional mathematical assumption is difficult to resist the attack of the quantum algorithm.Therefore,a lattice-based threshold secret sharing algorithm is proposed.The basic process of the secret sharing ...
ZHANG Hongjun,LIU Ke,MOU Zhansheng
doaj +1 more source
Simple Approach to Realizing Verifiable Secret Sharing for Secure Cloud System
IEEE Access, 2022 In $(k, n)$ threshold secret sharing, a secret is converted into $n$ shares such that any threshold $k$ or more shares allow for the reconstruction of this secret; however, the total storage cost increases.
Keiichi Iwamura +1 more
doaj +1 more source
Boolean-Based (k, n, m) Multi-Secret Image Sharing
Axioms, 2022 Multi-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property.
Chien-Chang Chen +2 more
doaj +1 more source
Secret Sharing with Binary Shares
, 2018 Shamir's celebrated secret sharing scheme provides an efficient method for encoding a secret of arbitrary length $\ell$ among any $N \leq 2^\ell$ players such that for a threshold parameter $t$, (i) the knowledge of any $t$ shares does not reveal any information about the secret and, (ii) any choice of $t+1$ shares fully reveals the secret. It is known
Lin, Fuchun +4 more
openaire +6 more sources
Angewandte Chemie, EarlyView.A novel carbon dots material (BUL‐CDs) with an initial afterglow brightness (406 cd m−2) far exceeding that of other afterglow luminescent materials was developed. Furthermore, the BUL‐CDs exhibited time‐dependent afterglow colors, excitation‐dependent afterglow colors, and thermochromic afterglow in response to triplet variables.
Yupeng Liu +13 more
wiley +2 more sources
Sharing one secret vs. sharing many secrets
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
(k,n) secret image sharing scheme capable of cheating detection
EURASIP 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
Constructions of some secret sharing schemes based on linear codes [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика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
Journal of Cryptology, 2014 A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parties can efficiently reconstruct the secret while any "unqualified" subset of parties cannot efficiently learn anything about the secret.
Komargodski, Ilan +2 more
openaire +3 more sources