Ideal threshold schemes from MDS codes
Pieprzyk, Josef & Zhang, Xian-Mo (2003) Ideal threshold schemes from MDS codes. Lecture Notes in Computer Science : Information Security and Cryptology — ICISC 2002, 2587, pp. 253-263.
We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret. The construction is later generalised so the resulting secret sharing is resistant against the Tompa-Woll cheating.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||Paper presented in the 5th International Conference Seoul, Korea, November 28–29, 2002. Print ISBN 978-3-540-00716-6|
|Keywords:||Secret Sharing, Threshold Schemes, Cheating Detection, Identidfication|
|Divisions:||Current > QUT Faculties and Divisions > Science & Engineering Faculty|
|Deposited On:||08 Jul 2014 00:33|
|Last Modified:||08 Jul 2014 00:33|
Repository Staff Only: item control page