DocumentCode
2966956
Title
Some Structural and Security Properties of the Modular Secret Sharing
Author
Galibus, Tatsiana ; Matveev, Gennadii ; Shenets, Nikolay
Author_Institution
Dept. of Math. Modelling & Data Anal., Belorussian State Univ., Minsk, Belarus
fYear
2008
fDate
26-29 Sept. 2008
Firstpage
197
Lastpage
200
Abstract
We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. The proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the ring of integers. Our threshold schemes are perfect i.e. secure in the sense of information theory and ideal i.e. efficient in the terms of memory storage (the size of the secret is equal to the size of the shares). Then we consider the modular secret sharing schemes with pairwise co-prime moduli over the ring of polynomials and the ring of integers. We give a complete description of the access structures that can be realized by such modular schemes.
Keywords
Galois fields; cryptography; information theory; polynomials; Galois field; access structure; information theory; integer ring; memory storage; modular secret sharing scheme; pairwise co-prime moduli; security property; threshold scheme; univariate polynomial; Cryptography; Data analysis; Data security; Galois fields; Information security; Information theory; Mathematical model; Mathematics; Polynomials; Scientific computing;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC '08. 10th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-0-7695-3523-4
Type
conf
DOI
10.1109/SYNASC.2008.14
Filename
5204811
Link To Document