An efficient construction of perfect secret sharing schemes for graph-based structures

DOI10.1016/0898-1221(96)00022-3zbMath0851.94022OpenAlexW2003145413MaRDI QIDQ1912864

Hung-Min Sun, Shiuh-Pyng Shieh

Publication date: 1 December 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00022-3

zbMATH Keywords

networkcryptographysecret sharing schemesdata securityaccess structures

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA, Secret sharing schemes for graph-based prohibited structures, A secret sharing scheme with a short share realizing the \((t,n)\) threshold and the adversary structure, ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK

Cites Work

• Some improved bounds on the information rate of perfect secret sharing schemes
• Multiple assignment scheme for sharing secret
• How to share a secret
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item