Pages that link to "Item:Q1912864"
From MaRDI portal
The following pages link to An efficient construction of perfect secret sharing schemes for graph-based structures (Q1912864):
Displaying 7 items.
- A secret sharing scheme with a short share realizing the \((t,n)\) threshold and the adversary structure (Q692299) (← links)
- Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs (Q897709) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- Perfect secret sharing schemes for graph access structures on six participants (Q2854182) (← links)
- Perfect secret sharing scheme based on vertex domination set (Q3451391) (← links)
- A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA (Q4963104) (← links)
- ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK (Q5249040) (← links)