Two Optimum Secret Sharing Schemes Revisited
Authors:
- Zhengjun CaoZCZhengjun Cao
- Olivier MarkowitchOMOlivier Markowitch
- 1 November 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 157-160
Abstract
In 2006, Obana et al proposed two optimum secret sharing schemes secure against cheating. They extend the secret s in the Shamir's scheme to an array of three elements, (s, e0, e1), and construct two equations for checking validity. Each item in the equations should be reconstructed using Lagrange's interpolation. In this paper, we revisit these schemes by introducing a public hash function to construct equations for checking validity. The revisited schemes become more efficient because they only extend the secret to an array of two elements. The new scheme for a single secret saves about 1/3 cost of the original.Keywords
This publication has 11 references indexed in Scilit:
- Multiplicative Linear Secret Sharing Schemes Based on Connectivity of GraphsIEEE Transactions on Information Theory, 2007
- Optimum Secret Sharing Scheme Secure against CheatingSIAM Journal on Discrete Mathematics, 2006
- Parallel Multi-party Computation from Linear Multi-secret Sharing SchemesLecture Notes in Computer Science, 2005
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing2001
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme2000
- The Size of a Share Must Be LargeJournal of Cryptology, 1997
- t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes1995
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- How to share a secret with cheatersJournal of Cryptology, 1989
- How to share a secretCommunications of the ACM, 1979