Constructions of cheating immune secret sharing


Autoria(s): Pieprzyk, Josef; Zhang, Xian-Mo
Data(s)

2002

Resumo

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.

Identificador

http://eprints.qut.edu.au/73350/

Relação

http://dl.acm.org/citation.cfm?id=687995

Pieprzyk, Josef & Zhang, Xian-Mo (2002) Constructions of cheating immune secret sharing. In ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology, Seoul, South Korea, pp. 226-243.

Fonte

Science & Engineering Faculty

Tipo

Conference Paper