Contact us
 |
[email protected] |
 |
3275638434 |
 |
 |
| Paper Publishing WeChat |
Useful Links
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Article
Some Secret Sharing Schemes Based on the Finite Fields
Author(s)
Selda Çalkavur
Full-Text PDF
XML 1799 Views
DOI:10.17265/1934-7332/2016.06.001
Affiliation(s)
Department of Mathematics, Kocaeli University, Kocaeli 41135, Turkey
ABSTRACT
A (t, n)—secret sharing scheme is a method of distribution of information among n participants such that t > 1 can reconstruct the secret but (t - 1) cannot. We explore some (k, n)—secret sharing schemes based on the finite fields.
KEYWORDS
Secret sharing, threshold secret sharing scheme, finite field
Cite this paper
References
[1] Shamir, A. 1979. “How to Share a Secret.” Comm. of the ACM 22: 612-3.
[2] Massey, J. L. 1993. “Minimal Codewords and Secret Sharing.” In Proc. of 6th Joint Swedish-Russian Workshop on Information Theory, Mölle, Sweden.
[3] McEliece, R. J., and Sarwate, D. V. 1981. “On Sharing Secrets and Reed-Solomon Codes.” Common. Assoc. Comp. Mach. 24: 583-4.
[4] Lidl, R., and Nieddereiter, H. 1997. Finite Fields. vol. 20. Cambridge: Cambridge University Press.
[5] Özadam, H., Özbudak, F., and Saygı, Z. 2007. “Secret Sharing Schemes and Linear Codes.” In Proceedings of Information Security Cryptology Conference with International Participation, 101-6.
[2] Massey, J. L. 1993. “Minimal Codewords and Secret Sharing.” In Proc. of 6th Joint Swedish-Russian Workshop on Information Theory, Mölle, Sweden.
[3] McEliece, R. J., and Sarwate, D. V. 1981. “On Sharing Secrets and Reed-Solomon Codes.” Common. Assoc. Comp. Mach. 24: 583-4.
[4] Lidl, R., and Nieddereiter, H. 1997. Finite Fields. vol. 20. Cambridge: Cambridge University Press.
[5] Özadam, H., Özbudak, F., and Saygı, Z. 2007. “Secret Sharing Schemes and Linear Codes.” In Proceedings of Information Security Cryptology Conference with International Participation, 101-6.