Smart expansion of target key for more handlers to access multimedia counting-based secret sharing

被引:0
作者
Adnan Gutub
Taghreed AlKhodaidi
机构
[1] Umm Al-Qura University,Computer Engineering Department
[2] Umm Al-Qura University,Computer Science Department at Al
来源
Multimedia Tools and Applications | 2020年 / 79卷
关键词
Counting-based secret sharing; Information security; Key management; Shares generation; Secret reconstruction; Target key expansion;
D O I
暂无
中图分类号
学科分类号
摘要
The secret sharing scheme is a data security tool to provide safe reliability and robustness for multi-user authentication systems. This work focus on expanding counting-based secret sharing technique to generate more shares for more handlers’ services considering security as well as simple and fast computation. The research considers resolving some originally published imperfections in the share’s generation phase proposing new smart expansion models validated to be optimized practical and efficient. We proposed seven possible models to expand the number of participants for applicable share’s keys generated from the target key. The smart security randomness of the shares and target keys adjusted were all analyzed to select the best choice based on consistency randomness test. The study further used standard simulations applied on two different applicable multimedia target keys sizes of 16-bits and 64-bits showing attractive remarks pointing for further research improvements to continue. The improved smart system has been analyzed according to distortion security and capacity parameters showing attractive contributions.
引用
收藏
页码:17373 / 17401
页数:28
相关论文
共 31 条
  • [1] Al Mahmoud Q(2013)Polynomial differential-based strong (n, t, n)-verifiable secret sharing IET Inf Secur 7 312-317
  • [2] Asmuth C(1983)A modular approach to key safeguarding IEEE Trans Inf Theory 29 208-210
  • [3] Bloom J(2009)A proactive secret sharing scheme in matrix projection method Int J Secur Netw 4 201-209
  • [4] Bai L(1993)Efficient sharing of many secrets Proc STACS 1993 692-703
  • [5] Zou X(2003)Sharing one secret vs. sharing many secrets Theor Comput Sci 295 123-140
  • [6] Blundo C(2006)Fast 160-bits GF(p) elliptic curve crypto hardware of high-radix scalable multipliers Int Arab J Inf Technol (IAJIT) 3 342-349
  • [7] De Santis A(2006)Secret Sharing Schemes with Applications in Security Protocols Sci Ann Cuza Univ 16 63-96
  • [8] Vaccaro U(1989)Secret sharing scheme realizing general access structure Electron Commun Jpn 72 56-64
  • [9] Di Crescenzo G(2006)Sharing multiple secrets: models, schemes and analysis Des Codes Crypt 39 89-111
  • [10] Gutub A(1981)On sharing secrets and reed-Solomon codes Commun ACM 24 583-584