Cheating prevention in linear secret sharing
Pieprzyk, Josef & Zhang, Xian-Mo (2002) Cheating prevention in linear secret sharing. Lecture Notes in Computer Science : Information Security and Privacy, 2384, pp. 121-135.
Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.
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:||ISBN: 978-3-540-43861-8; Book Subtitle:
7th Australasian Conference, ACISP 2002 Melbourne, Australia, July 3–5, 2002 Proceedings
|Divisions:||Current > QUT Faculties and Divisions > Science & Engineering Faculty|
|Deposited On:||03 Jul 2014 02:51|
|Last Modified:||03 Jul 2014 02:51|
Repository Staff Only: item control page