Combinatorial bounds for broadcast encryption
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 512-526
- https://doi.org/10.1007/bfb0054150
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Broadcast EncryptionPublished by Springer Nature ,2001
- An Optimal Class of Symmetric Key Generation SystemsPublished by Springer Nature ,2000
- On Some Methods for Unconditionally Secure Key Distribution and Broadcast EncryptionDesigns, Codes and Cryptography, 1997
- Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key DistributionPublished by Springer Nature ,1996
- Space requirements for broadcast encryptionPublished by Springer Nature ,1995
- Perfectly-Secure Key Distribution for Dynamic ConferencesPublished by Springer Nature ,1993
- A short proof of Sperner's lemmaJournal of Combinatorial Theory, 1966
- On generalized graphsActa Mathematica Hungarica, 1965
- Intersection Theorems for Systems of SetsJournal of the London Mathematical Society, 1960
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928