Cheating prevention in secret sharing over GF(pt)

Josef Pieprzyk; Xian Mo Zhang

doi:10.1007/3-540-45311-3_8

Cheating prevention in secret sharing over GF(p^t)

Josef Pieprzyk, Xian Mo Zhang

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

14 Citations (Scopus)

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 modeldeal s 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.

Original language	English
Title of host publication	Progress in Cryptology - INDOCRYPT 2001
Subtitle of host publication	Second International Conference on Cryptology in India Chennai, India, December 16–20, 2001 Proceedings
Editors	C. Pandu Rangan, Cunsheng Ding
Place of Publication	Berlin; New York
Publisher	Springer, Springer Nature
Pages	79-90
Number of pages	12
ISBN (Electronic)	9783540453116
ISBN (Print)	9783540430100
DOIs	https://doi.org/10.1007/3-540-45311-3_8
Publication status	Published - Dec 2001
Event	2nd International Conference on Cryptology in India, INDOCRYPT - 2001 - Chennai, India Duration: 16 Dec 2001 → 20 Dec 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2247
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	2nd International Conference on Cryptology in India, INDOCRYPT - 2001
Country/Territory	India
City	Chennai
Period	16/12/01 → 20/12/01

Keywords

Cheating immunity
Nonlinear secret sharing
Secret sharing

Access to Document

10.1007/3-540-45311-3_8

Cite this

Pieprzyk, J., & Zhang, X. M. (2001). Cheating prevention in secret sharing over GF(p^t). In C. P. Rangan, & C. Ding (Eds.), Progress in Cryptology - INDOCRYPT 2001: Second International Conference on Cryptology in India Chennai, India, December 16–20, 2001 Proceedings (pp. 79-90). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2247). Springer, Springer Nature. https://doi.org/10.1007/3-540-45311-3_8

Pieprzyk, Josef ; Zhang, Xian Mo. / Cheating prevention in secret sharing over GF(p^t). Progress in Cryptology - INDOCRYPT 2001: Second International Conference on Cryptology in India Chennai, India, December 16–20, 2001 Proceedings. editor / C. Pandu Rangan ; Cunsheng Ding. Berlin; New York : Springer, Springer Nature, 2001. pp. 79-90 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8a14fa458d7a463186dcd64623cdead0,

title = "Cheating prevention in secret sharing over GF(pt)",

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(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s 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.",

keywords = "Cheating immunity, Nonlinear secret sharing, Secret sharing",

author = "Josef Pieprzyk and Zhang, {Xian Mo}",

year = "2001",

month = dec,

doi = "10.1007/3-540-45311-3_8",

language = "English",

isbn = "9783540430100",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "79--90",

editor = "Rangan, {C. Pandu} and Cunsheng Ding",

booktitle = "Progress in Cryptology - INDOCRYPT 2001",

address = "United States",

note = "2nd International Conference on Cryptology in India, INDOCRYPT - 2001 ; Conference date: 16-12-2001 Through 20-12-2001",

}

Pieprzyk, J & Zhang, XM 2001, Cheating prevention in secret sharing over GF(p^t). in CP Rangan & C Ding (eds), Progress in Cryptology - INDOCRYPT 2001: Second International Conference on Cryptology in India Chennai, India, December 16–20, 2001 Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2247, Springer, Springer Nature, Berlin; New York, pp. 79-90, 2nd International Conference on Cryptology in India, INDOCRYPT - 2001, Chennai, India, 16/12/01. https://doi.org/10.1007/3-540-45311-3_8

Cheating prevention in secret sharing over GF(p^t). / Pieprzyk, Josef; Zhang, Xian Mo.
Progress in Cryptology - INDOCRYPT 2001: Second International Conference on Cryptology in India Chennai, India, December 16–20, 2001 Proceedings. ed. / C. Pandu Rangan; Cunsheng Ding. Berlin; New York: Springer, Springer Nature, 2001. p. 79-90 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2247).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Cheating prevention in secret sharing over GF(pt)

AU - Pieprzyk, Josef

AU - Zhang, Xian Mo

PY - 2001/12

Y1 - 2001/12

N2 - 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(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s 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.

AB - 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(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s 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.

KW - Cheating immunity

KW - Nonlinear secret sharing

KW - Secret sharing

UR - http://www.scopus.com/inward/record.url?scp=84974708355&partnerID=8YFLogxK

U2 - 10.1007/3-540-45311-3_8

DO - 10.1007/3-540-45311-3_8

M3 - Conference proceeding contribution

AN - SCOPUS:84974708355

SN - 9783540430100

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 79

EP - 90

BT - Progress in Cryptology - INDOCRYPT 2001

A2 - Rangan, C. Pandu

A2 - Ding, Cunsheng

PB - Springer, Springer Nature

CY - Berlin; New York

T2 - 2nd International Conference on Cryptology in India, INDOCRYPT - 2001

Y2 - 16 December 2001 through 20 December 2001

ER -

Pieprzyk J, Zhang XM. Cheating prevention in secret sharing over GF(p^t). In Rangan CP, Ding C, editors, Progress in Cryptology - INDOCRYPT 2001: Second International Conference on Cryptology in India Chennai, India, December 16–20, 2001 Proceedings. Berlin; New York: Springer, Springer Nature. 2001. p. 79-90. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45311-3_8