Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

IJNSEC
2006

favoriteEmaildiscussreport

111views more IJNSEC 2006»

Ideal Secret Sharing Schemes from Permutations

13 years 5 months ago

Ideal Secret Sharing Schemes from Permutations

Download ijns.femto.com.tw

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.

Josef Pieprzyk, Xian-Mo Zhang

Real-time Traffic

Ideal Secret Sharing | IJNSEC 2006 | Regular Mappings | Secret Sharing |

claim paper

Related Content

» Ideal Hierarchical Secret Sharing Schemes

» On Codes Matroids and Secure Multiparty Computation from Linear Secret Sharing Schemes

» On Ideal Nonperfect Secret Sharing Schemes

» Ideal Multipartite Secret Sharing Schemes

» Characterizing Ideal Weighted Threshold Secret Sharing

» ErrorSet Codes and Related Objects

» Secret sharing schemes on access structures with intersection number equal to one

» Hierarchical Threshold Secret Sharing

» On Secret Sharing Schemes Matroids and Polymatroids

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	IJNSEC
Authors	Josef Pieprzyk, Xian-Mo Zhang

Comments (0)