Ideal threshold schemes from orthogonal arrays

Josef Pieprzyk, Xiam Mo Zhang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

1 Citation (Scopus)

Abstract

The work investigates the design of ideal threshold secret sharing in the context of cheating prevention. We showed that each orthogonal array is exactly a defining matrix of an ideal threshold scheme. To prevent cheating, defining matrices should be nonlinear so both the cheaters and honest participants have the same chance of guessing of the valid secret. The last part of the work shows how to construct nonlinear secret sharing based on orthogonal arrays.

Original languageEnglish
Title of host publicationInformation and Communications Security - 4th International Conference, ICICS 2002, Proceedings
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Pages469-479
Number of pages11
Volume2513
ISBN (Print)3540001646
Publication statusPublished - 2002
Event4th International Conference on Information and Communications Security, ICICS 2002 - Singapore, Singapore
Duration: 9 Dec 200212 Dec 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2513
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Information and Communications Security, ICICS 2002
CountrySingapore
CitySingapore
Period9/12/0212/12/02

Keywords

  • Cheating detection
  • Nonlinear functions
  • Orthogonal arrays
  • Threshold secret sharing

Fingerprint Dive into the research topics of 'Ideal threshold schemes from orthogonal arrays'. Together they form a unique fingerprint.

Cite this