Constructions of cheating immune secret sharing

Josef Pieprzyk, Xian Mo Zhang

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

13 Citations (Scopus)

Abstract

The work addresses the problem of cheating prevention in secret sharing. Two cheating scenarios are considered. In the first one, the cheaters always submit invalid shares to the combiner. In the second one, the cheaters collectively decide which shares are to be modified so the combiner gets a mixture of valid and invalid shares from the cheaters. The secret scheme is said to be k-cheating immune if any group of k cheaters has no advantage over honest participants. The paper investigates cryptographic properties of the defining function of secret sharing so the scheme is k-cheating immune. Constructions of secret sharing immune against k cheaters are given.

Original languageEnglish
Title of host publicationInformation Security and Cryptology (ICISC 2001)
Subtitle of host publication4th International Conference Proceedings
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages226-243
Number of pages18
Volume2288
ISBN (Print)3540433198, 9783540433194
Publication statusPublished - 2002
Event4th International Conference on Information Security and Cryptology, ICISC 2001 - Seoul, Korea, Republic of
Duration: 6 Dec 20017 Dec 2001

Publication series

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

Other

Other4th International Conference on Information Security and Cryptology, ICISC 2001
CountryKorea, Republic of
CitySeoul
Period6/12/017/12/01

Fingerprint

Dive into the research topics of 'Constructions of cheating immune secret sharing'. Together they form a unique fingerprint.

Cite this