Ideal threshold schemes from orthogonal arrays

Pieprzyk, Josef & Zhang, Xiam-Mo (2002) Ideal threshold schemes from orthogonal arrays. Lecture Notes in Computer Science : Information and Communications Security, 2513, pp. 469-479.

View at publisher


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.

Impact and interest:

1 citations in Scopus
Search Google Scholar™
1 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 73479
Item Type: Journal Article
Refereed: Yes
Additional Information: Paper presented in the 4th International Conference, ICICS 2002 Singapore, December 9–12, 2002. Print ISBN 978-3-540-00164-5
Keywords: Threshold Secret Sharing , Orthogonal Arrays, Cheating Detection, Nonlinear Functions
DOI: 10.1007/3-540-36159-6_40
ISBN: 978-3-540-00164-5
ISSN: 0302-9743
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Deposited On: 08 Jul 2014 00:38
Last Modified: 08 Jul 2014 00:38

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page