Results 51 to 60 of about 375,511 (221)
Journal of Combinatorial Theory, Series B, 1992 A matroid \(M\) is secret-sharing if there is a finite set \(S\) and a matrix \(A=\{a_{ij}:i\in I, j\in E(M)\}\) with entries in \(S\) such that for all \(X\subseteq E(M)\), the submatrix \(\{a_{ij}:i\in I, j\in X\}\) has precisely \(| S|^{rk(x)}\) distinct rows. The author shows that the Vamos matroid is not secret-sharing.
openaire +3 more sources
Optimal non-perfect uniform secret sharing schemes [PDF]
, 2014 A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the ...
A. Beimel +19 more
core +1 more source
Hypergraph decomposition and secret sharing
Discrete Applied Mathematics, 2003 AbstractA secret sharing scheme is a protocol by which a dealer distributes a secret among a set of participants in such a way that only qualified sets of them can reconstruct the value of the secret whereas any non-qualified subset of participants obtain no information at all about the value of the secret.
G. Di Crescenzo, GALDI, CLEMENTE
openaire +6 more sources
How to share a secret with cheaters [PDF]
Journal of Cryptology, 1989 This paper demonstrates that \textit{A. Shamir}'s scheme [Commun. ACM 22, 612-613 (1979; Zbl 0414.94021)] is not secure against certain forms of cheating. A small modification to his scheme retains the security and efficiency of the original, is secure against these forms of cheating, and preserves the property that its security does not depend on any ...
Martin Tompa, Heather Woll
openaire +3 more sources
On alternative approach for verifiable secret sharing [PDF]
, 2002 Secret sharing allows split/distributed control over the secret (e.g. master key). Verifiable secret sharing (VSS) is the secret sharing extended by verification capacity. Usually verification comes at the price.
Kotulski, Zbigniew +2 more
core +2 more sources
Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
, 2012 In a recent work, Markham and Sanders have proposed a framework to study quantum secret sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and public channels ...
K. Rietjens +2 more
core +1 more source
Bounds on the Information Rate of Quantum Secret Sharing Schemes
, 2010 An important metric of the performance of a quantum secret sharing scheme is its information rate. Beyond the fact that the information rate is upper bounded by one, very little is known in terms of bounds on the information rate of quantum secret ...
Sarvepalli, Pradeep
core +1 more source
Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate
IEEE Transactions on Quantum EngineeringIn some quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. However, it is unclear whether some shares can be distributed before a secret is given in the ramp quantum ...
Ryutaroh Matsumoto
doaj +1 more source
A Novel Secret Sharing Method Based on Binary Sequence
Dianxin kexue, 2015 A novel secret sharing method was proposed based on binary sequence,which was quite different from the traditional secret sharing method.This secret sharing method was based on binary secret sequence using bit operations.The secret here included but not ...
Yexia Cheng +5 more
doaj +2 more sources
Circular quantum secret sharing
, 2006 A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three.
Bennett C H Brassard G +17 more
core +1 more source