Abstract
The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restriction of regular mappings to permutations gives a convenient tool for investigation of the relation between permutations and ideal secret sharing generated by them.
| Original language | English |
|---|---|
| Pages (from-to) | 238-244 |
| Number of pages | 7 |
| Journal | International Journal of Network Security |
| Volume | 2 |
| Issue number | 3 |
| Publication status | Published - 2006 |