Generation of key predistribution schemes using secret sharing schemes

DOI10.1016/S0166-218X(02)00448-1zbMath1023.94008OpenAlexW2002229126MaRDI QIDQ1811107

Germán Sáez

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00448-1

zbMATH Keywords

forbiddeninformation ratesecret sharing schemekey predistribution schemeprivileged usersubset of users

Mathematics Subject Classification ID

Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

A novel group key transfer for big data security ⋮ Finding the maximal adversary structure from any given access structure

Cites Work

• An explication of secret sharing schemes
• Geometric secret sharing schemes and their duals
• On some methods for unconditionally secure key distribution and broadcast encryption
• Ideal secret sharing schemes with multiple secrets
• How to share a secret
• On secret sharing systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generation of key predistribution schemes using secret sharing schemes