Abstract
The work investigates cheating prevention in secret sharing. It is argued that cheating is immune against cheating if the cheaters gain no advantage over honest participants by submitting invalid shares to the combiner. This work addresses the case when shares and the secret are taken from GF(p t). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second model deals with cheaters who submit a mixture of valid and invalid shares. For these two models, cheating immunity is defined, properties of cheating immune secret sharing are investigated and their constructions are given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Carpentieri. A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography, 5(3):183–187, 1995.
M. Carpentieri, A. De Santis, and U. Vaccaro. Size of shares and probability of cheating in threshold schemes. Advances in Cryptology-EUROCRYPT’93, LNCS No. 765, pages 118–125. Springer-Verlag, 1993.
P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings ofthe 28th IEEE Symposium on Foundations ofComputer Science, pages 427–437. IEEE, 1987.
K. Nyberg and L. R. Knudsen. Provable security against differential cryptanalysis. In Advances in Cryptology-CRYPTO’92, LNCS No. 740, pages 566–574. Springer-Verlag, 1993.
T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology-CRYPTO’91, LNCS No. 576, pages 129–140. Springer-Verlag, 1992.
T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of 21st ACM Symposium on Theory of Computing, pages 73–85, 1989.
B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In M. Wiener, editor, Advances in Cryptology-CRYPTO’99, LNCS No. 1666, pages 148–164. Springer-Verlag, 1999.
J. Seberry, X. M. Zhang, and Y. Zheng. Nonlinearity and propagation characteristics of balanced boolean functions. Information and Computation, 119(1):1–13, 1995.
M. Stadler. Publicly verifiable secret sharing. In U. Maurer, editor, Advances in Cryptology-EUROCRYPT’96, LNCS No. 1070, pages 190–199. Springer-Verlag, 1996.
D. R. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
Martin Tompa and Heather Woll. How to share a secret with cheaters. In A. M. Odlyzko, editor, Advances in Cryptology-CRYPTO’86, LNCS No. 263, pages 261–265. Springer-Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pieprzyk, J., Xian-Mo, Z. (2001). Cheating Prevention in Secret Sharing over GF(p t). In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-45311-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43010-0
Online ISBN: 978-3-540-45311-6
eBook Packages: Springer Book Archive