The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures-Reference-Cited by-同舟云学术

The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures

Published:2014-10 Issue:4 Volume:30 Page:1073-1084
ISSN:0168-9673
Container-title:Acta Mathematicae Applicatae Sinica, English Series
language:en
Short-container-title:Acta Math. Appl. Sin. Engl. Ser.

Author:

Tang Chun-ming,Dai Shu-guang

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s10255-014-0431-7.pdf

Reference13 articles.

1. Anderson, R.J., Ding, C., Helleseth, T., Klove, T. How to build robust shared control systems. Design, Codes and Cryptography, 15: 111–124 (1998)

2. Ashikhmin, A., Barg, A. Minimal vectors in linear codes. IEEE Trans. Inf. Theory, 44(5): 2010–2017 (1998)

3. Dai, S., Tang, C., Chen, Y. The Optimal Linear Multi-Secret Sharing Scheme for Non-Threshold Access Structure. ACM International Conference Proceeding Series, SIN’11-Proceedings of the 4th International Conference on Security of Information and Networks, 2011, 43–48

4. Lecture Notes in Computer Science;O Farras,2010

5. Lecture Notes in Computer Science;WA Jackson,1994

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A 3D Model Authentication Scheme Based on Secret Sharing in Cloud Environment;Proceedings of the 2019 8th International Conference on Networks, Communication and Computing;2019-12-13

2. Efficient multisecret sharing scheme using new proposed computational security model;International Journal of Communication Systems;2017-08-23