Ideal threshold schemes from orthogonal arrays
Data(s) |
2002
|
---|---|
Resumo |
The work investigates the design of ideal threshold secret sharing in the context of cheating prevention. We showed that each orthogonal array is exactly a defining matrix of an ideal threshold scheme. To prevent cheating, defining matrices should be nonlinear so both the cheaters and honest participants have the same chance of guessing of the valid secret. The last part of the work shows how to construct nonlinear secret sharing based on orthogonal arrays. |
Identificador | |
Publicador |
Springer |
Relação |
DOI:10.1007/3-540-36159-6_40 Pieprzyk, Josef & Zhang, Xiam-Mo (2002) Ideal threshold schemes from orthogonal arrays. Lecture Notes in Computer Science : Information and Communications Security, 2513, pp. 469-479. |
Fonte |
Science & Engineering Faculty |
Palavras-Chave | #Threshold Secret Sharing #Orthogonal Arrays #Cheating Detection #Nonlinear Functions |
Tipo |
Journal Article |