Results 181 to 190 of about 375,511 (221)
ECACS: An Enhanced Certificateless Authentication Scheme for Smart Car Sharing. [PDF]
Sensors (Basel)Shen Z, Kou X, Yang T.
europepmc +1 more source
Secure latent Dirichlet allocation. [PDF]
Front Digit HealthVeugen T +3 more
europepmc +1 more source
ApproximateSecret Sharing in Field of Real Numbers. [PDF]
Entropy (Basel)Wan J, Wang Z, Yu Y, Yan X.
europepmc +1 more source
Enhanced security of affine ciphers using digraph transformation and a modified three pass protocol. [PDF]
Sci RepBete S +4 more
europepmc +1 more source
Cellular automata based key distribution for lightweight hybrid image encryption with elliptic curve cryptography. [PDF]
Sci RepYogi B, Khan AK, Roy S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Secret Sharing System and Secret Sharing Matrix
2009 International Conference on Computational Intelligence and Security, 2009To make the secret sharing management more effective and safe, based on the (k, n) threshold secret sharing scheme, this article propose a new concept of generalized (k, n)-secret sharing matrix, and proposed a more safe (t, k, n) threshold secret sharing scheme by generalizing the (t, k, n) threshold secret sharing matrix.
Lingyun Li +3 more
openaire +2 more sources
Designs, Codes and Cryptography, 1998
Traditional approaches to the secret sharing problem are focused to the problem of how to divide a secret into shares distributed among a set of users in such a way that only a qualified subset of users can reconstruct the secret while any unqualified group of users have no information about the secret.
Jingmin He, Ed Dawson
openaire +1 more source
Traditional approaches to the secret sharing problem are focused to the problem of how to divide a secret into shares distributed among a set of users in such a way that only a qualified subset of users can reconstruct the secret while any unqualified group of users have no information about the secret.
Jingmin He, Ed Dawson
openaire +1 more source
Probability of shares in secret sharing schemes
Information Processing Letters, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo +2 more
openaire +3 more sources
IEEE Transactions on Information Theory, 1983
Summary: A ``secret sharing system'' permits a secret to be shared among \(n\) trustees in such a way that any \(k\) of them can recover the secret, but any \(k-1\) have complete uncertainty about it. A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a ...
Jonathan W. Greene +2 more
openaire +2 more sources
Summary: A ``secret sharing system'' permits a secret to be shared among \(n\) trustees in such a way that any \(k\) of them can recover the secret, but any \(k-1\) have complete uncertainty about it. A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a ...
Jonathan W. Greene +2 more
openaire +2 more sources
Information Processing Letters, 1998
A secret sharing scheme is a protocol to share a secret s among a set of participants P in such a way that only qualified subsets of P can reconstruct the value of s whereas any other subset of P, non-qualified to know s, cannot determine anything about the value of the secret.
BLUNDO, Carlo +2 more
openaire +3 more sources
A secret sharing scheme is a protocol to share a secret s among a set of participants P in such a way that only qualified subsets of P can reconstruct the value of s whereas any other subset of P, non-qualified to know s, cannot determine anything about the value of the secret.
BLUNDO, Carlo +2 more
openaire +3 more sources