Journal of Combinatorial Theory Series B
Geometric secret sharing schemes and their duals
Designs, Codes and Cryptography
Linear Algebra Approach to Secret Sharing Schemes
Selected papers from the Workshop on Information Protection, Error Control, Cryptology, and Speech Compression
How to (Really) Share a Secret
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On the Composition of Matroids and Ideal Secret Sharing Schemes
Designs, Codes and Cryptography
A Representation of a Family of Secret Sharing Matroids
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
Ideal Multipartite Secret Sharing Schemes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Hypergraph decomposition and secret sharing
Discrete Applied Mathematics
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
Designs, Codes and Cryptography
A new construction method for networks from matroids
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
On secret sharing schemes, matroids and polymatroids
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Matroids can be far from ideal secret sharing
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the index coding problem and its relation to network coding and matroid theory
IEEE Transactions on Information Theory
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Ideal secret sharing schemes for useful multipartite access structures
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Characterizing ideal weighted threshold secret sharing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On codes, matroids and secure multi-party computation from linear secret sharing schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.06 |
An almost affine code is a code Cfor which the size of all codes obtained by multiple puncturingof C is a power of the alphabet size. Essentially,almost affine codes are the same as ideal perfect secret haringschemes or partial affine geometries. The present paper exploresthese interrelations, gives short proofs of known and new results,and derives some properties of the distance distribution of almostaffine codes.