Name
Abstract | ||
|---|---|---|
We introduce a linear code based on resilient maps on vector spaces over finite fields, we give a basis of this code and upper and lower bounds for its minimal distance. Then the use of the introduced code for building vector space secret sharing schemes is explained and an estimation of the robustness of the schemes against cheaters is provided. |
Year | Venue | Field |
|---|---|---|
2015 | IACR Cryptology ePrint Archive | Vector space,Secure multi-party computation,Secret sharing,Upper and lower bounds,Computer science,Theoretical computer science,Verifiable secret sharing,Linear code,Shamir's Secret Sharing,Homomorphic secret sharing |
DocType | Volume | Citations |
Journal | 2015 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Carlos Ku-Cauich | 1 | 5 | 2.93 |
| Guillermo Morales-luna | 2 | 99 | 28.89 |