- Subscribe to this page:
- RSS
- Email Alert
Universitat Rostock
(2 results)-
Whitepapers
Natural Generalizations of Threshold Secret Sharing
December 3, 2012, 12:00am PST
The authors present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous papers, are natural generalizations of threshold...
Provided by Universitat Rostock
-
Whitepapers
Secret Sharing Schemes for Very Dense Graphs
July 18, 2012, 12:00am PDT
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any information on the secret....
Provided by Universitat Rostock
-
Whitepapers
Secret Sharing Schemes for Very Dense Graphs
July 18, 2012, 12:00am PDT
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any information on the secret....
Provided by Universitat Rostock
-
Whitepapers
Natural Generalizations of Threshold Secret Sharing
December 3, 2012, 12:00am PST
The authors present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous papers, are natural generalizations of threshold...
Provided by Universitat Rostock
Keep Up with TechRepublic
Submit a Paper
Get your content listed in our directory!
Our directory is the largest library of vendor-supplied technical content on the Web. It’s also the first place IT decision makers turn to when researching technology solutions. Our members are already finding your competitors’ papers here - shouldn’t they find yours, too? It's FREE so click here and submit your white paper, case study, data sheet, research report, or other document today!
