A characterisation of ideal weighted secret sharing schemes
Beimel, Tassa and Weinreb [SIAM J. Discrete Math. 22 (2008), 360–397] and Farràs and Padró [Lecture Notes in Comput. Sci. 5978, Springer, 2010, 219–236] partially characterised access structures of ideal weighted secret sharing schemes in terms of the operation of composition. They proved that any w...
Main Authors: | Hameed Ali, Slinko Arkadii |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2015-12-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2015-0002 |
Similar Items
Similar Items
-
Fast strategies in biased Maker--Breaker games
by: Mirjana Mikalački, et al.
Published: (2018-10-01) -
Generalized minimum spanning tree games
by: PhuocHoang Le, et al.
Published: (2016-05-01) -
The impacts of tropical cyclones on the net carbon balance of eastern US forests (1851–2000)
by: J P Fisk, et al.
Published: (2013-01-01) -
Feedback Nash equilibria in optimal taxation problems
by: Krastanov Mikhail, et al.
Published: (2009-12-01) -
Secret sharing and duality
by: Csirmaz Laszlo
Published: (2020-11-01)