Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures

DOI10.1016/J.TCS.2004.02.030zbMath1068.94020OpenAlexW2000650782MaRDI QIDQ596095

Vanesa Daza, Paolo D'Arco, Carles Padró, Carlo Blundo

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.030

zbMATH Keywords

ProtocolsDistributed systemsKey distribution

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Randomness in distribution protocols
• Some improved bounds on the information rate of perfect secret sharing schemes
• An explication of secret sharing schemes
• Perfectly secure key distribution for dynamic conferences
• Geometric secret sharing schemes and their duals
• Tight bounds on the information rate of secret sharing schemes
• Anonymous secret sharing schemes
• On some methods for unconditionally secure key distribution and broadcast encryption
• The size of a share must be large
• Mutually trusted authority-free secret sharing schemes
• On the information rate of perfect secret sharing schemes
• Secret sharing schemes with bipartite access structure
• How to share a secret
• Using encryption for authentication in large networks of computers
• Decomposition constructions for secret-sharing schemes
• New bounds on the information rate of secret sharing schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures