Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes
| العنوان: | Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes |
|---|---|
| المؤلفون: | Prabal Paul, Appala Naidu Tentu, China Venkaiah Vadlamudi |
| المصدر: | Lecture Notes in Computer Science ISBN: 9783642452772 IWOCA |
| بيانات النشر: | Springer Berlin Heidelberg, 2013. |
| سنة النشر: | 2013 |
| مصطلحات موضوعية: | Set (abstract data type), Scheme (programming language), Discrete mathematics, Ideal (set theory), Computer science, Computer Science::Multimedia, Secret sharing, Time complexity, computer, Ground field, Separable space, Access structure, computer.programming_language |
| الوصف: | An ideal conjunctive hierarchical secret sharing scheme, constructed based on the Maximum Distance Separable (MDS) codes, is proposed in this paper. The scheme, what we call, is computationally perfect. By computationally perfect, we mean, an authorized set can always reconstruct the secret in polynomial time whereas for an unauthorized set this is computationally hard. Also, in our scheme, the size of the ground field is independent of the parameters of the access structure. Further, it is efficient and requires O(n 3), where n is the number of participants. |
| ردمك: | 978-3-642-45277-2 |
| DOI: | 10.1007/978-3-642-45278-9_44 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::a28555194b6b930c26aafe24cfe47174 https://doi.org/10.1007/978-3-642-45278-9_44 |
| رقم الانضمام: | edsair.doi...........a28555194b6b930c26aafe24cfe47174 |
| قاعدة البيانات: | OpenAIRE |
| ردمك: | 9783642452772 |
|---|---|
| DOI: | 10.1007/978-3-642-45278-9_44 |