Secret Sharing Schemes Based on the Dual Code of the Code of a Symmetric （v, k, λ）-Design and Minimal Access Sets
Secret Sharing Schemes Based on the Dual Code of the Code of a Symmetric （v, k, λ）-Design and Minimal Access Sets
摘要
Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric （V, k, λ）-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric （v, k, λ）-design.
参考文献14
-
1Blakley, G. R. 1979. "Safeguarding Cryptographic Keys." In Proc. 1979 National Computer Conf., New York, 313-7.
-
2Ding, C., Kohel, D., and Ling, S. 2000. "Secret Sharing with a Class of Ternary Codes." Theor. Comp. Sci. 246: 285-98.
-
3Ding, C., and Yuan, J. 2003. "Covering and Secret Sharing with Linear Codes." In Discrete Mathematics and Theoretical Computer Science (Lecture Notes in Computer Science) 2731: 11-25. Berlin, Germany: Springer-Verlag.
-
4Hill, R. 1986. A First Course in Coding Theory. Oxford: Oxford University.
-
5Kamin, E. D., Greene, J. W., and Hellman, M. E. 1983. "On Secret Sharing Systems." IEEE Trans. Inf. Theory IT-29 (1): 35-41.
-
6Lander, E. S. 1983. Symmetric Designs an Algebraic Approach. Cambridge: Cambridge University.
-
7Massey, J. L. 1993. "Minimal Codewords and Secret Sharing." In Proc. 6th Joint Swedish-Russian Workshop on Information Theory, 276-9.
-
8Mc Eliece, R. J., and Sarwate, D. V. 1981. "On Sharing Secrets and Reed-Solomon Codes." Commun. Assoc. Comp. Math. 24: 583-4.
-
9Okada, K., and Kurusowa, K. 2000. "MDS Secret Sharing Scheme Secure against Cheaters." IEEE Trans. Inf. Theory46 (3): 1078-81.
-
10Ozadam, H., 0zbudak, F., and Saygl, Z. 2007. "Secret Sharing Schemes and Linear Codes." Information Security Cryptology Conference with International Participation, Proceedings, 101-6.
-
1Selda Calkavur.Some Secret Sharing Schemes Based on the Finite Fields[J].Computer Technology and Application,2016,7(6):269-272.
-
2Selda Calkavur.A New Method to Construct Secret Sharing Schemes Based on Linear Codes[J].Computer Technology and Application,2015,6(2):89-94.
-
3袁毅,靳番.DECODING BEYOND THE BOUND OF THE COMPLEX-ROTARY CODE AND ITS DUAL CODE[J].Journal of Electronics(China),1991,8(1):86-89.
-
4吴振寰,Gao,Ying,Wu,Zhehui.Set (k, n)-Exactly covering problem[J].High Technology Letters,2010,16(4):433-436.
-
5刁大生,张成杰,张永生,郭光灿.Class of Unlockable Bound Entangled States and Their Applications[J].Chinese Physics Letters,2008,25(7):2366-2369.
-
6张英俏,金星日,张寿.Secret sharing of quantum information via entanglement swapping[J].Chinese Physics B,2006,15(10):2252-2255. 被引量：3
-
7徐大专.ERROR-DETECTING CODES AND UNDETECTED ERROR PROBABILITIES[J].Journal of Electronics(China),1994,11(1):37-43.
-
8刘木兰,周展飞.Ideal homomorphic secret sharing schemes over cyclic groups[J].Science China(Technological Sciences),1998,41(6):650-660.
-
9郑仕标.Teleportation of Quantum States through Mixed Entangled Pairs[J].Chinese Physics Letters,2006,23(9):2356-2359.
-
10DAI ShuGuang,WEI JinFeng,ZHANG FangGuo.Memory leakage-resilient secret sharing schemes[J].Science China(Information Sciences),2015,58(11):187-195. 被引量：1
