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.

View at publisher

Abstract

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:

4 citations in Scopus
4 citations in Web of Science®
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® 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 the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 73323
Item Type: Journal Article
Refereed: Yes
Additional Information: ISBN: 978-3-540-43861-8; Book Subtitle:
7th Australasian Conference, ACISP 2002 Melbourne, Australia, July 3–5, 2002 Proceedings
DOI: 10.1007/3-540-45450-0_9
ISSN: 0302-9743
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Deposited On: 03 Jul 2014 02:51
Last Modified: 21 Jun 2017 20:01

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page