DocumentCode :
2332032
Title :
Two Optimum Secret Sharing Schemes Revisited
Author :
Cao, Zhengjun ; Markowitch, Olivier
Author_Institution :
Dept. of Comput. Sci., Univ. Libre de Bruxelles, Brussels
fYear :
2008
fDate :
20-20 Nov. 2008
Firstpage :
157
Lastpage :
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 :
cryptography; interpolation; Lagrange interpolation; Shamir scheme; optimum secret sharing scheme; public hash function; Costs; Cryptography; Equations; Information management; Information technology; Interpolation; Lagrangian functions; Polynomials; Seminars; Technology management;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Future Information Technology and Management Engineering, 2008. FITME '08. International Seminar on
Conference_Location :
Leicestershire, United Kingdom
Print_ISBN :
978-0-7695-3480-0
Type :
conf
DOI :
10.1109/FITME.2008.95
Filename :
4746465
Link To Document :
بازگشت