Cheating prevention in secret sharing

Hossein Ghodosi; Josef Pieprzyk

doi:10.1007/10718964_27

Cheating prevention in secret sharing

Hossein Ghodosi, Josef Pieprzyk

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

6 Citations (Scopus)

Abstract

The commonly used technique for cheating detection requires that extra information be given to each participant. However, in a secret sharing scheme when the size of shares increases the security of the system degrades. In this paper we study the cheating problem in Shamir's scheme (in the sense of Tompa and Woll [1] attack) and present alternative solutions to this problem. First we consider cheating prevention via longer shares. Next we introduce redundant secret sharing schemes and show how they can be used for cheating prevention. Nonlinear secret sharing offers also some protection against cheaters. The work concludes with a discussion about a combined approach.

Original language	English
Title of host publication	Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings
Place of Publication	Berlin ; London
Publisher	Springer, Springer Nature
Pages	328-341
Number of pages	14
Volume	1841
ISBN (Print)	3540677429
DOIs	https://doi.org/10.1007/10718964_27
Publication status	Published - 2000
Externally published	Yes
Event	5th Australasian Conference on Information Security and Privacy, ACISP 2000 - Brisbane, Australia Duration: 10 Jul 2000 → 12 Jul 2000

Publication series

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

Other

Other	5th Australasian Conference on Information Security and Privacy, ACISP 2000
Country/Territory	Australia
City	Brisbane
Period	10/07/00 → 12/07/00

Access to Document

10.1007/10718964_27

Cite this

Ghodosi, H., & Pieprzyk, J. (2000). Cheating prevention in secret sharing. In Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings (Vol. 1841, pp. 328-341). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1841). Springer, Springer Nature. https://doi.org/10.1007/10718964_27

Ghodosi, Hossein ; Pieprzyk, Josef. / Cheating prevention in secret sharing. Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. Vol. 1841 Berlin ; London : Springer, Springer Nature, 2000. pp. 328-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{497b5ab1301a4ec1888a67d2683fd1b3,

title = "Cheating prevention in secret sharing",

abstract = "The commonly used technique for cheating detection requires that extra information be given to each participant. However, in a secret sharing scheme when the size of shares increases the security of the system degrades. In this paper we study the cheating problem in Shamir's scheme (in the sense of Tompa and Woll [1] attack) and present alternative solutions to this problem. First we consider cheating prevention via longer shares. Next we introduce redundant secret sharing schemes and show how they can be used for cheating prevention. Nonlinear secret sharing offers also some protection against cheaters. The work concludes with a discussion about a combined approach.",

author = "Hossein Ghodosi and Josef Pieprzyk",

year = "2000",

doi = "10.1007/10718964_27",

language = "English",

isbn = "3540677429",

volume = "1841",

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

publisher = "Springer, Springer Nature",

pages = "328--341",

booktitle = "Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings",

address = "United States",

note = "5th Australasian Conference on Information Security and Privacy, ACISP 2000 ; Conference date: 10-07-2000 Through 12-07-2000",

}

Ghodosi, H & Pieprzyk, J 2000, Cheating prevention in secret sharing. in Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. vol. 1841, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1841, Springer, Springer Nature, Berlin ; London, pp. 328-341, 5th Australasian Conference on Information Security and Privacy, ACISP 2000, Brisbane, Australia, 10/07/00. https://doi.org/10.1007/10718964_27

Cheating prevention in secret sharing. / Ghodosi, Hossein; Pieprzyk, Josef.
Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. Vol. 1841 Berlin ; London: Springer, Springer Nature, 2000. p. 328-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1841).

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

TY - GEN

T1 - Cheating prevention in secret sharing

AU - Ghodosi, Hossein

AU - Pieprzyk, Josef

PY - 2000

Y1 - 2000

N2 - The commonly used technique for cheating detection requires that extra information be given to each participant. However, in a secret sharing scheme when the size of shares increases the security of the system degrades. In this paper we study the cheating problem in Shamir's scheme (in the sense of Tompa and Woll [1] attack) and present alternative solutions to this problem. First we consider cheating prevention via longer shares. Next we introduce redundant secret sharing schemes and show how they can be used for cheating prevention. Nonlinear secret sharing offers also some protection against cheaters. The work concludes with a discussion about a combined approach.

AB - The commonly used technique for cheating detection requires that extra information be given to each participant. However, in a secret sharing scheme when the size of shares increases the security of the system degrades. In this paper we study the cheating problem in Shamir's scheme (in the sense of Tompa and Woll [1] attack) and present alternative solutions to this problem. First we consider cheating prevention via longer shares. Next we introduce redundant secret sharing schemes and show how they can be used for cheating prevention. Nonlinear secret sharing offers also some protection against cheaters. The work concludes with a discussion about a combined approach.

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

U2 - 10.1007/10718964_27

DO - 10.1007/10718964_27

M3 - Conference proceeding contribution

AN - SCOPUS:33744898755

SN - 3540677429

VL - 1841

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

SP - 328

EP - 341

BT - Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings

PB - Springer, Springer Nature

CY - Berlin ; London

T2 - 5th Australasian Conference on Information Security and Privacy, ACISP 2000

Y2 - 10 July 2000 through 12 July 2000

ER -

Ghodosi H, Pieprzyk J. Cheating prevention in secret sharing. In Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. Vol. 1841. Berlin ; London: Springer, Springer Nature. 2000. p. 328-341. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/10718964_27

Cheating prevention in secret sharing

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this