Perfect Secret Sharing Schemes for Access Structures Based on Graphs
碩士 === 國立交通大學 === 應用數學系所 === 102 === A perfect secret sharing scheme based on a graph G is a randomized distribution of a secret among the vertices of the graph so that the secret can be recovered from the information assigned to the endvertices of any edge, while the total information assigned...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63666583867727925901 |