Some Structural and Security Properties of the Modular Secret Sharing

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Symbolic and Numeric Algorithms for Scientific Computing, Proceedings s. 197 - 200
Hlavní autoři: Galibus, T., Matveev, G., Shenets, N.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2008
Témata:
Cryptography
Data analysis
Data security
Galois fields
Information security
Information theory
Mathematical model
Mathematics
Polynomials
Scientific computing
ISBN:0769535232, 9780769535234
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:0769535232
9780769535234
DOI:10.1109/SYNASC.2008.14