On the information rate of perfect secret sharing schemes
M Van Dijk - Designs, codes and cryptography, 1995 - Springer
In this paper, information rates of perfect secret sharing schemes are studied, in particular
schemes based on connected graphs on six vertices. We discuss a method to derive …
schemes based on connected graphs on six vertices. We discuss a method to derive …
Perfect secret sharing schemes on five participants
WA Jackson, KM Martin - Designs, codes and cryptography, 1996 - Springer
A perfect secret sharing scheme is a system for the protection of a secret among a number of
participants in such a way that only certain subsets of these participants can reconstruct the …
participants in such a way that only certain subsets of these participants can reconstruct the …
Almost affine codes
J Simonis, A Ashikhmin - Designs, Codes and Cryptography, 1998 - Springer
An almost affine code is a code C for which the size of all codes obtained by multiple
puncturing of C is a power of the alphabet size. Essentially, almost affine codes are the …
puncturing of C is a power of the alphabet size. Essentially, almost affine codes are the …
Authenticated data structures for graph and geometric searching
MT Goodrich, R Tamassia, N Triandopoulos… - Cryptographers' Track at …, 2003 - Springer
Authenticated data structures provide cryptographic proofs that their answers are as
accurate as the author intended, even if the data structure is maintained by a remote host …
accurate as the author intended, even if the data structure is maintained by a remote host …
[PDF][PDF] Secret sharing schemes with applications in security protocols.
S Iftene - Sci. Ann. Cuza Univ., 2006 - Citeseer
A secret sharing scheme starts with a secret and then derives from it certain shares (or
shadows) which are distributed to users. The secret may be recovered only by certain …
shadows) which are distributed to users. The secret may be recovered only by certain …
Ideal multipartite secret sharing schemes
O Farràs, J Martí-Farré, C Padró - Journal of cryptology, 2012 - Springer
Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …
which the set of participants is divided into several parts and all participants in the same part …
[HTML][HTML] Matroid representations by partitions
F Matúš - Discrete Mathematics, 1999 - Elsevier
A matroid on the ground set N with the rank function r is said to be partition representable of
degree d⩾ 2 if partitions ξ i, i∈ N, of a finite set Ω of the cardinality dr (N), exist such that the …
degree d⩾ 2 if partitions ξ i, i∈ N, of a finite set Ω of the cardinality dr (N), exist such that the …
Lower bounds for monotone span programs
A Beimel, A Gál, M Paterson - Computational Complexity, 1996 - Springer
Span programs provide a linear algebraic model of computation. Lower bounds for span
programs imply lower bounds for formula size, symmetric branching programs, and contact …
programs imply lower bounds for formula size, symmetric branching programs, and contact …
A strong ramp secret sharing scheme using matrix projection
L Bai - 2006 International symposium on a World of wireless …, 2006 - ieeexplore.ieee.org
This paper presents a strong (k, n) threshold-based ramp secret sharing scheme with k
access levels. The secrets are the elements represented in a square matrix S. The secret …
access levels. The secrets are the elements represented in a square matrix S. The secret …
Changing thresholds in the absence of secure channels
KM Martin, J Pieprzyk, R Safavi-Naini… - Information Security and …, 1999 - Springer
The ways the threshold parameter can be modified after the setup of a secret sharing
scheme is the main theme of this work. The considerations are limited to the case when …
scheme is the main theme of this work. The considerations are limited to the case when …