Cheating prevention in linear secret sharing

Josef Pieprzyk, Xian Mo Zhang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

10 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 7th Australasian Conference, ACISP 2002, Proceedings
EditorsLynn Batten, Jennifer Seberry
Place of PublicationNew York; London
PublisherSpringer, Springer Nature
Pages121-135
Number of pages15
Volume2384
ISBN (Print)3540438610, 9783540438618
Publication statusPublished - 2002
Event7th Australasian Conference on Information Security and Privacy, ACISP 2002 - Melbourne, Australia
Duration: 3 Jul 20025 Jul 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2384
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th Australasian Conference on Information Security and Privacy, ACISP 2002
Country/TerritoryAustralia
CityMelbourne
Period3/07/025/07/02

Keywords

  • Cheating detection
  • Cheating identification
  • Cryptography
  • Linear secret sharing schemes
  • Secret sharing

Fingerprint

Dive into the research topics of 'Cheating prevention in linear secret sharing'. Together they form a unique fingerprint.

Cite this