Secure Shares Generation via M-Blocks Partitioning for Counting-Based Secret Sharing

DOI: https://doi.org/10.36909/jer.v8i3.8079
Keywords: Counting-based secret sharing, Shares generation, Shares construction, Key management, Key distribution, Information security

Abstract

Counting-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.

Author Biographies

Adnan Gutub, Umm Al-Qura University
Prof. Adnan Abdul-Aziz Gutub is ranked as Full Professor in Computer Engineering specialized in Information and Computer Security within College of Computers and Information Systems at Umm Al-Qura University (UQU). He has been working as the Vice Dean of the Custodian of the Two Holy Mosques Institute of the Hajj & OmrahResearch, Known publicly as Hajj Research Institute (HRI), within (UQU), Makkah Al-Mukarramah, all Muslims religious Holy City located within the Kingdom of Saudi Arabia. Adnan’s academic experience in Computer Engineering was gained from his previous long-time work as Associate Professor, Assistant Professor, Lecturer, and Graduate Assistant, all in Computer Engineering at King Fahd University of Petroleum and Minerals (KFUPM) in Dhahran, Saudi Arabia. He received his Ph.D. degree (2002) in Electrical and Computer Engineering  from Oregon State University, USA. He had his BS in Electrical Engineering and MS in Computer Engineering both from KFUPM, Saudi Arabia. Adnan's research work can be observed through his 90+ publications (international journals and conferences) as well as his 5 US patents registered officially by USPTO. His main research interests involved optimizing, modeling, simulating, and synthesizing VLSI hardware for crypto and security computer arithmetic operations. He worked on designing efficient integrated circuits for the Montgomery inverse computation in different finite fields. He has some work in modeling architectures for RSA and elliptic curve crypto operations. His interest in computer security also involved steganography and secret-sharing focusing on image based steganography and Arabic text steganography as well as counting based secret sharing. Adnan’s research interest in computing and information technology have been broaden to also relate to smart crowd management and intelligent transportation engineering systems because of the involvement in Hajj and OmrahResearch at UQU - Makkah. In summer 2013, Adnan has been awarded 3-month visiting scholar grant in collaboration with Purdue University, West Lafayette, Indiana, USA. He had been involved in research of current studies related to Arabic Text Steganography in Data Security as well as Elliptic Curve Crypto Processor Designs. His activities at Purdue was in relation to three main research groups: Distributed Multimedia Systems Laboratory, Center for Education and Research in Information Assurance and Security (CERIAS), Visual Analytics for Command, Control, and Interoperability Environments (VACCIEN). Previously, Adnan have been twice awarded the UK visiting internship for 2 months of summer 2005 and summer 2008, both sponsored by the British Council in Saudi Arabia. The 2005 summer research visit was at Brunel University to collaborate with the Bio-Inspired Intelligent System (BIIS) research group in a project to speed-up a scalable modular inversion hardware architecture. The 2008 visit was at University of Southampton with the Pervasive Systems Centre (PSC) for research related to text steganography and data security. Administratively, Adnan Gutub filled many executive and managerial academic positions at KFUPM as well as UQU. At KFUPM - Dhahran, he had the experience of chairing the Computer Engineering department (COE) for five years until moving to Makkah in 2010. Then, at UQU - Makkah, Adnan Chaired the Information Systems Department at the College of Computers and Information Systems followed by his leadership of the Center of Research Excellence in Hajj and Omrah (HajjCoRE) serving as HajjCoRE director for around 3-years until the end of 2013. Then, he was assigned his last position (until March 2016) as the Vice Dean of HRI, i.e. the Custodian of the Two Holy Mosques Institute of the Hajj & Omrah Research. For more details about Adnan and his activities, you are welcome to visit the links at the top of the webpage!!
Adel Al-Qurashi, Umm Al-Qura University

Adel Mohammad Al-Qurashi is a graduate student pursuing Master of Sciences (MS) degree in Computer Sciences & Engineering, at Umm Al Qura University (UQU) fully sponsored by UQU with support from Ministry of Education. Adel completed his Bachelor degree in Computer Science from King Abdulaziz University, Saudi Arabia. Beside his graduate student involvement, he is currently working as a computer science instructor at Secondary School as with the Government Education for Ministry of Education, in Taif, Saudi Arabia. His computer technical experience covered several areas such as networks, cybersecurity, programming with C++ and Java, as well as web design with HTML5, PHP, and JavaScript. His MS program at UQU is specialized in the Information Security track offered by the College of Computer and Information Systems offered at UQU-Makkah Campus, Saudi Arabia. Adel's research interest involved Cryptography, Steganography and Secret Sharing. His Master Thesis topic is about Improving Security and Reliability of Counting-Based Secret Sharing Scheme, where this research is his current contribution.

References

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.

Published
2020-08-13
Issue
Vol 8 No 3 (2020): Journal of Engineering Research
Section
Computer Engineering