Counting-based secret sharing technique for multimedia applications
- 222 Downloads
Secret Sharing is required in situations where access to important resources has to be protected by more than one person. We propose new secret-sharing scheme that works based on parallel counting of the ones within the shares to generate the secret output. Our work presented two different modeling variations that are mainly different in the secret-sharing keys generation where both are studied elaborating their pros and cons. Our counting-based secret shares key reconstruction is implemented and simulated considering the security level required by the usage functions. Comparisons showed interesting results that are attractive to be considered. This secret sharing method is of great benefit to all multimedia secret sharing applications such as securing bank sensitive accounts and error tracking, voting systems trust, medical agreements, wills and inheritance authentication management.
KeywordsSecret sharing Key management Shares generation Information security Key distribution technique
The authors would like to thank Umm Al-Qura University (UQU) for hosting this research. Appreciation is given to our Master program allowing the graduate student (Miss Nouf Al-Juaid) as co-author of this paper from Shaqra University to work this research with us performing the modeling, testing and all simulations. Thanks to the Department of Information and Technical Services at the Custodian of the Two Holy Mosques Institute of the Hajj and Umrah Research for encouraging this teamwork. Thanks to the hosting department, i.e. Computer Engineering Department at the College of Computer & Information Systems, for motivating this wonderful cooperation guided within Umm Al-Qura University, Makkah, Saudi Arabia.
- 3.G.R. Blakley 1979 “Safeguarding cryptographic keys”, Proc. of 1979 AFIPS National Computer Conference 48:313–317Google Scholar
- 4.Blundo C, De Santis A, Gargano L, Vaccaro U (1993) Secret sharing schemes with veto capabilities. Proceedings of the First French-Israeli Workshop, Paris, France:19–21Google Scholar
- 6.Gutub A (2007) Area flexible GF(2k) elliptic curve cryptography coprocessor. International Arab Journal of Information Technology (IAJIT) 4(1):1–10Google Scholar
- 8.Gutub A (2007) Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations. Kuwait Journal of Science & Engineering (KJSE) 34(2):165–182Google Scholar
- 9.Gutub A (2010) Preference of efficient architectures for GF(p) elliptic curve crypto operations using multiple parallel multipliers. Int J Secur 4(4):46–63Google Scholar
- 10.Gutub A, Amin A (1999) An expandable Montgomery modular multiplication processor. Eleventh international conference on microelectronics, ICM'99, pages: 173–176, KuwaitGoogle Scholar
- 11.Gutub A, Tahhan H (2003) Improving cryptographic architectures by adopting efficient adders in their modular multiplication hardware. The 9th annual gulf internet symposium, Khobar, Saudi Arabia, October 13-15Google Scholar
- 14.Krawczyk H (1993) Secret Sharing Made Short. Proceedings of the 13th Annual International Cryptology Conference (CRYPTO’ 93), Santa Barbara, California, USA, 22–26 August, pp 136–146Google Scholar
- 21.Wang K, Zou X, Sui Y (2009) A Multiple Secret Sharing Scheme based on Matrix Projection. Proc. of the 33rd Annual IEEE International Computer Software and Applications Conference, pp 400–405Google Scholar