Ideal secret sharing schemes from permutations
| Data(s) |
2006
|
|---|---|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador | |
| Publicador |
Femto Technique Co., Ltd |
| Relação |
http://eprints.qut.edu.au/73465/1/73465%28pub%29.pdf http://ijns.femto.com.tw/download_paper.jsp?PaperID=IJNS-2005-08-31-2&PaperName=ijns-v2-n3/ijns-2006-v2-n3-p238-244.pdf Pieprzyk, Josef & Zhang, Xian-Mo (2006) Ideal secret sharing schemes from permutations. International Journal of Network Security, 2(3), pp. 238-244. |
| Direitos |
Copyright 2006 Femto Technique Co., Ltd |
| Fonte |
Science & Engineering Faculty |
| Tipo |
Journal Article |
