Secure Shares Generation via M-Blocks Partitioning for Counting-Based Secret Sharing
AbstractCounting-based secret sharing is presented recently as a promising approach serving multi-user authentication applications. The scheme originally generates its shares via simple flipping of one or two 0-bits within the entire secret key at various locations. Reconstructing the secret key combines chosen shares, based on (n,k) threshold, in parallel specific counting to recover back the secret key. This paper proposes modifying the shares generation process, for security enhancement, by dividing the secret key into blocks. Each block involves flipping specific bits simultaneously, generating ambiguous shares improving the access system security. The proposed blocks flipping shares methods is implemented in different 64-bits models via fair testing Java platform. Experimentations showed interesting comparisons results providing remarkable secure contributions. The work can be considered an opening applicability direction for further attractive research in improving the counting-based secret sharing technique.
Alassaf, N., Gutub, A., Parah, S. & Al-Ghamdi, M. 2018. Enhancing Speed of SIMON: A Light-Weight-Cryptographic Algorithm for IoT Applications. Multimedia Tools and Applications, ISSN: 1380-7501, DOI: 10.1007/s11042-018-6801-z.
Alaseri, K. & Gutub, A. 2018. Merging Secret Sharing within Arabic Text Steganography for Practical Retrieval. IJRDO - Journal of Computer Science and Engineering, ISSN: 2456-1843, Vol. 4, No. 9.
Al-Ghamdi, M., Al-Ghamdi, M. & Gutub, A. 2018. Security Enhancement of Shares Generation Process for Multimedia Counting-Based Secret-Sharing Technique. Multimedia Tools and Applications, ISSN: 1380-7501, DOI: 10.1007/s11042-018-6977-2.
Al-Juaid, N., Gutub, A. & Khan, E. 2018. Enhancing PC Data Security via Combining RSA Cryptography and Video Based Steganography. Journal of Information Security and Cybercrimes Research (JISCR), Vol. 1, No. 1, pp. 8-18, Published by Naif Arab University for Security Sciences (NAUSS).
Al-Khodaidi, T. & Gutub, A. 2019. Scalable Shares Generation to Increase Participants of Counting-Based Secret Sharing Technique. International Journal of Information and Computer Security, ISSN 1744-1765, In Press.
AlQurashi, A. & Gutub, A. 2018. Reliable Secret Key Generation For Counting-Based Secret Sharing. Journal of Computer Science & Computational Mathematics, Vol. 8, No. 4.
Alsaidi, A., Al-lehaibi, K., Alzahrani, H., Al-Ghamdi, M. & Gutub, A. 2018. Compression Multi-Level Crypto Stego Security of Texts Utilizing Colored Email Forwarding. Journal of Computer Science & Computational Mathematics (JCSCM), Vol. 8, No. 3, pp. 33-42, DOI: 10.20967/jcscm.2018.03.002, Published by Science & Knowledge Research Society.
Bai, Li, & XuKai, Zou 2009. A proactive secret sharing scheme in matrix projection method. International Journal of Security and Networks, Vol. 4, No. 4, pp. 201-209.
Beimel, A., Tassa, T. & Weinreb, E. 2005. Characterizing ideal weighted threshold secret sharing. Theory of Cryptography Conference, Springer, pp. 600-619.
Binu, V.P. & Sreekumar, A. 2016. Secret Sharing Schemes with Extended Capabilities and Applications. Diss. Cochin University of Science and Technology.
Blakley, G.R. 1979. Safeguarding cryptographic keys. Proc. of AFIPS National Computer Conference, Vol. 48, pp. 313-317.
Castiglione, Arcangelo, Alfredo, De Santis, Barbara, & Masucci, 2014. Hierarchical and shared key assignment. IEEE International Conference on Network-Based Information Systems (NBiS), pp. 263–270.
Ding, C., Pei, D., & Salomaa, A. 1996. Chinese remainder theorem: applications in computing, coding, cryptography. World Scientific.
Gutub, A., Al-Juaid, N. & Khan, E. 2017. Counting-Based Secret Sharing Technique for Multimedia Applications. Multimedia Tools and Applications, ISSN: 1380-7501, DOI: 10.1007/s11042-017-5293-6.
Gutub, A. 2006. Fast 160-Bits GF(p) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers. International Arab Journal of Information Technology (IAJIT), Vol. 3, No. 4, pp. 342–349.
Iftene, S. 2006. Secret Sharing Schemes with Applications in Security Protocols”, Sci. Ann. Cuza Univ, Vol. 16, pp. 63-96.
Kaya Kamer, 2009. Threshold Cryptography with Chinese Remainder Theorem”, Diss. PhD thesis, Bilkent University, Department of Computer Engineering.
Morillo, P., Padro, C., Saez, G. & Villar J.L. 1999. Weighted threshold secret sharing schemes. Information Processing Letters, Vol. 70, No. 5, pp. 211-216.
Mignotte, M. 1982. How to share a secret. In Cryptography- Proceedings of the Workshop on Cryptography, Springer, Vol.149 pp. 371-375.
Rukhin, A. et al, 2001. A statistical test suite for random and pseudorandom number generators for cryptographic applications. Booz-Allen and Hamilton Inc., McLean VA.
Shamir, A. 1979. How to share a secret. Communications of the ACM, Vol. 22, No. 11, pp. 612- 613.
Simmons, G.S. 1992. An introduction to shared secret and/or shared control schemes and their application. Contemporary cryptology.
Sorin & Iftene, 2007. General secret sharing based on the chinese remainder theorem with applications in e-voting. Electronic Notes in Theoretical Computer Science, Vol. 186, No. 2, pp. 67–84.
Tassa, T. 2007. Hierarchical threshold secret sharing. Journal of Cryptology, Springer, Vol. 20, No. 2, pp. 237–264.