Article
Publicly Available
On secret sharing schemes, matroids and polymatroids
-
Jaume Martí-Farré
Published/Copyright:
July 30, 2010
Received: 2009-07-29
Revised: 2010-06-08
Published Online: 2010-07-30
Published in Print: 2010-October
© de Gruyter 2010
Articles in the same Issue
- On secret sharing schemes, matroids and polymatroids
- The power of primes: security of authentication based on a universal hash-function family
- Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
- On the asymptotic effectiveness of Weil descent attacks
- The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
Keywords for this article
Secret sharing;
optimization of secret sharing schemes for general access structures;
ideal secret sharing schemes;
matroids;
polymatroids
Articles in the same Issue
- On secret sharing schemes, matroids and polymatroids
- The power of primes: security of authentication based on a universal hash-function family
- Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
- On the asymptotic effectiveness of Weil descent attacks
- The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
