@inproceedings{302fffa3171a487ba935435704a05804,
title = "Constructions of cheating immune secret sharing",
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.",
author = "Josef Pieprzyk and Zhang, {Xian Mo}",
year = "2002",
language = "English",
isbn = "3540433198",
volume = "2288",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "226--243",
booktitle = "Information Security and Cryptology (ICISC 2001)",
address = "United States",
note = "4th International Conference on Information Security and Cryptology, ICISC 2001 ; Conference date: 06-12-2001 Through 07-12-2001",
}