nach oben

Arabian Journal for Science and Engineering

Erschienen in:

06.03.2020 | Research Article-Computer Engineering and Computer Science

Trustworthy Target Key Alteration Helping Counting-Based Secret Sharing Applicability

verfasst von: Taghreed AlKhodaidi, Adnan Gutub

Erschienen in: Arabian Journal for Science and Engineering | Ausgabe 4/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Sensitive information used online has resulted in the emergence of many security systems to be protected by secret keys. One of these security systems is the so-called secret sharing, in which certain key portions are distributed to allow sharing access by a specified number of participants. The sharing system requires that several users enter their shares, at the same time, to rebuild the main target key (TK) to access sensitive data within the system. Normally, the number of shares is limited by the number of zeros within TK as of our focus on the recent counting-based secret sharing strategy. If the number of participants is more than TK zeros, the complete system cannot work needing to reconsider regenerating TK again. In this work, we improved the original system of counting-based secret sharing to accommodate more participants via longer trustworthy TK selection. We proposed several possible models to enlarge the number of participants for applicable share’s keys generated from TK. The trustworthy security randomness of the new shares and adjusted target keys were all measured to select the best choice based on standard reliability randomness test. The study experimented the proposal on typical simulations applied on different target keys applicable sizes. The results presented that the final target key TK created as having the highest ratio of randomness to be preferred choice proven secure and reliable to protect information within the system.

Vorheriger Artikel Reduced Reference Image Quality Assessment Technique Based on DWT and Path Integral Local Binary Patterns

Nächster Artikel Bottleneck Feature-Based Hybrid Deep Autoencoder Approach for Indian Language Identification

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MathSciNetMATHCrossRef

Sahu, A.K.; Swain, G.: Dual stego-imaging based reversible data hiding using improved LSB matching. Int. J. Intell. Eng. Syst. 12, 63–74 (2019)

Blakley, G.R.: Safeguarding cryptographic keys. In: Afips, p. 313 (1979)

Ito, M.; Saito, A.; Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. (Part III Fundam. Electron. Sci.) 72(9), 56–64 (1989)MathSciNetCrossRef

Beimel, A.: Secret-sharing schemes: a survey. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6639 LNCS, pp. 11–46 (2011)

Iftene, S.: Secret sharing schemes with applications in security protocols. Sci. Ann. Cuza Univ. 16, 63–96 (2006)MathSciNetMATH

Kaya, K.: Threshold Cryptography With Chinese Remainder Theorem. Doctoral dissertation, PhD thesis, Bilkent University, Department of Computer Engineering (2009)

Wang, K.; Zou, X.; Sui, Y.: A multiple secret sharing scheme based on matrix projection. In: 33rd Annual IEEE International Computer Software and Applications Conference, pp. 400–405 (2009)

Gutub, A.; Alaseri, K.: Refining Arabic text stego-techniques for shares memorization of counting-based secret sharing. J. King Saud Univ. Comput. Inf. Sci. (2019). https://doi.org/10.1016/j.jksuci.2019.06.014 CrossRef

10.

Alsaidi, A.; Gutub, A.; Alkhodaidi, T.: Cybercrime on transportation airline. J. Forensic Res. 10(4), 1–4 (2019)

11.

Samkari, H.; Gutub, A.: Protecting medical records against cybercrimes within Hajj period by 3-layer security. Recent Trends Inf. Technol. Appl. 2(3), 1–21 (2019). https://doi.org/10.5281/zenodo.3543455 CrossRef

12.

Shen, J.; Zhou, T.; He, D.; Zhang, Y.; Sun, X.; Xiang, Y.: Block design-based key agreement for group data sharing in cloud computing. IEEE Trans. Dependable Secure Comput. 16, 996–1010 (2019)CrossRef

13.

Alassaf, N.; Gutub, A.: Simulating light-weight-cryptography implementation for IOT healthcare data security applications. Int. J. E-Health Med. Commun.: IJEHMC 10(4), 1–15 (2019)CrossRef

14.

Chen, W.; Lei, H.; Qi, K.: Lattice-based linearly homomorphic signatures in the standard model. Theor. Comput. Sci. 634, 47–54 (2016)MathSciNetMATHCrossRef

15.

Li, T.; Chen, W.; Tang, Y.; Yan, H.: A homomorphic network coding signature scheme for multiple sources and its application in IoT. Secur. Commun. Netw. 2018, 1–6 (2018). https://doi.org/10.1155/2018/9641273 CrossRef

16.

Gutub, A.; Alaseri, K.: Hiding shares of counting-based secret sharing via Arabic text steganography for personal usage. Arab. J. Sci. Eng. (2019). https://doi.org/10.1007/s13369-019-04010-6 CrossRef

17.

Alaseri, K.; Gutub, A.: Merging secret sharing within Arabic text steganography for practical retrieval. IJRDO J. Comput. Sci. Eng. 4(9), 1–17 (2018)

18.

Liu, Z.; Weng, J.; Li, J.; Yang, J.; Fu, C.; Jia, C.: Cloud-based electronic health record system supporting fuzzy keyword search. Soft Comput. 20(8), 3243–3255 (2016)CrossRef

19.

Ma, Y.; Luo, X.; Li, X.; Bao, Z.; Zhang, Y.: Selection of rich model steganalysis features based on decision rough set $\alpha$-positive region reduction. IEEE Trans. Circuits Syst. Video Technol. 29(2), 336–350 (2019)CrossRef

20.

Zhang, Y.; Qin, C.; Zhang, W.; Liu, F.; Luo, X.: On the fault-tolerant performance for a class of robust image steganography. Sig. Process. 146, 99–111 (2018)CrossRef

21.

Gutub, A.; Al-Ghamdi, M.: Image based steganography to facilitate improving counting-based secret sharing. 3D Res. (2019). https://doi.org/10.1007/s13319-019-0216-0 CrossRef

22.

Bai, L.; Zou, X.: A proactive secret sharing scheme in matrix projection method. Int. J. Secur. Netw. 4(4), 201–209 (2009)CrossRef

23.

Tassa, T.: Hierarchical threshold secret sharing. J. Cryptol. 20(2), 237–264 (2007)MathSciNetMATHCrossRef

24.

Herzberg, A.; Jarecki, S.; Krawczyk, H.; Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) Advances in Cryptology—CRYPT0’ 95: 15th Annual International Cryptology Conference Santa Barbara, California, USA, August 27–31, 1995 Proceedings. Springer, Berlin, pp. 339–352 (1995)

25.

Gutub, A.; Al-Ghamdi, M.: Hiding shares by multimedia image steganography for optimized counting-based secret sharing. Multimed. Tools Appl. (2020). https://doi.org/10.1007/s11042-019-08427-x CrossRef

26.

Blundo, C.; Cresti, A.; De Santis, A.; Vaccaro, U.: Fully dynamic secret sharing schemes. Theor. Comput. Sci. 165(2), 407–440 (1996)MathSciNetMATHCrossRef

27.

Gutub, A.; Al-Juaid, N.; Khan, E.: Counting-based secret sharing technique for multimedia applications. Multimed. Tools Appl. 78, 5591–5619 (2019). https://doi.org/10.1007/s11042-017-5293-6 CrossRef

28.

Sarrna, K.S.; Larnkuche, H.S.; Urnarnaheswari, S.: A review of secret sharing schemes. Res. J. Inf. Technol. 5(2), 67–72 (2013)

29.

Ding, W.; Liu, K.; Liu, L.; Yan, X.: Participants increasing for Shamirs polynomial-based secret image sharing scheme. In: IEEE 3rd International Conference on Big Data Security on Cloud, pp. 32–36 (2017)

30.

Yan, X.; Lu, Y.; Chen, Y.; Lu, C.; Zhu, B.; Liao, Q.: Secret image sharing based on error-correcting codes. In: 3rd IEEE International Conference on Big Data Security on Cloud, pp. 86–89 (2017)

31.

Nojoumian, M.: Unconditionally secure proactive verifiable secret sharing using new detection and recovery techniques. In: 2016 14th Annual Conference on Privacy, Security and Trust, PST 2016, pp. 269–274 (2016)

32.

Wang, D.; Zhang, L.; Ma, N.; Li, X.: Two secret sharing schemes based on Boolean operations. Pattern Recogn. 40(10), 2776–2785 (2007)MATHCrossRef

33.

Wan, S.; Lu, Y.; Yan, X.; Liu, L.: A novel visual secret sharing scheme based on QR codes. Int. J. Digit. Crime Forensics 9(3), 38–48 (2017)CrossRef

34.

Al Mahmoud, Q.: Polynomial differential-based strong (n, t, n)-verifiable secret sharing. IET Inf. Secur. 7(4), 312–317 (2013)CrossRef

35.

Lu, L.: (t, p)-Threshold Point Function Secret Sharing Scheme Based on Polynomial Interpolation and Its Application, pp. 269–275 (2016)

36.

Raja Koti, B.; Kumar, K.N.; Raj Kumar, G.V.S.: Secret image sharing technique based on bitwise XOR. IJCSET 6(5), 138–143 (2016)

37.

Blundo, C.; De Santis, A.; Vaccaro, U.: Efficient sharing of many secrets. Proc. STACS 1993, 692–703 (1993)MATH

38.

Di Crescenzo, G.: Sharing one secret vs. sharing many secrets. Theor. Comput. Sci. 295(1–3), 123–140 (2003)MathSciNetMATHCrossRef

39.

Baron, J. et al.: How to withstand mobile virus attacks. In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, pp. 51–59 (1991)

40.

Martin, K.M.; Safavi-Naini, R.; Wang, H.: Bounds and techniques for efficient redistribution of secret shares to new access structures. Comput. J. 42(8), 638–649 (1999)MATHCrossRef

41.

Maeda, A.; Miyaji, A.; Tada, M.: Efficient and unconditionally secure verifiable threshold changeable scheme. In: Proceedings of the 6th Australasian Conference on Information Security and Privacy. Lecture Notes in Computer Science, vol. 2119, Springer, 2001, pp. 403–416 (2001)

42.

Martin, K.M.; Pieprzyk, J.; Safavi-Naini, R.; Wang, H.: Changing thresholds in the absence of secure channels. In: Information Security and Privacy—4th Australasian Conference, vol. 1587, pp. 177–191 (1999)

43.

Jia, X.; Wang, D.; Nie, D.; Luo, X.; Zheng, J.: A new threshold changeable secret sharing scheme based on the Chinese Remainder Theorem. Inf. Sci. 473, 13–30 (2019)MathSciNetCrossRef

44.

Zhang, Z.; Meng, Y.; Ling, S.; Liu, M.; Wang, H.: Threshold changeable secret sharing schemes revisited. Theor. Comput. Sci. 418, 106–115 (2012)MathSciNetMATHCrossRef

45.

Laih, C.-S.; Lee, J.Y.; Harn, L.; Hwang, T.: Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space, vol. 435 LNCS. Department of Electrical Engineering, National Cheng Kung University, Springer (1990)

46.

Steinfeld, R.; Pieprzyk, J.; Wang, H.: Lattice-based threshold-changeability for standard CRT secret-sharing schemes. Finite Fields Appl. 12(4), 653–680 (2006)MathSciNetMATHCrossRef

47.

Steinfeld, R.; Pieprzyk, J.; Wang, H.: Lattice-based threshold changeability for standard shamir secret-sharing schemes. IEEE Trans. Inf. Theory 53(7), 2542 (2007)MathSciNetMATHCrossRef

48.

Harn, L.; Lin, C.; Li, Y.: Fair secret reconstruction in (t, n) secret sharing. J. Inf. Secur. Appl. 23, 1–7 (2015)

49.

Tompa, M.; Heather, W.: How to share a secret with cheaters. J. Cryptol. 1(3), 133–138 (1989)MathSciNetMATHCrossRef

50.

Ogata, W.; Kurosawa, K.: Optimum secret sharing scheme secure against cheating. Eurocrypt 1070(1), 200–211 (1996)MathSciNetMATH

51.

McEliece, R.J.; Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Commun. ACM 24(9), 583–584 (1981)MathSciNetCrossRef

52.

Asmuth, C.; Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208–210 (1983)MathSciNetCrossRef

53.

Desmedt, Y.; Di Crescenzo, G.; Burmester, M.: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Advances in Cryptology, pp. 19–32 (1995)

54.

Dehkordi, M.H.; Mashhadi, S.; Oraei, H.: A proactive multi stage secret sharing scheme for any given access structure. Wirel. Pers. Commun. 104(1), 491–503 (2019)CrossRef

55.

Zarepour-ahmadabadi, J.; Shiri-ahmadabadi, M.; Miri, A.; Latif, A.: A new gradual secret sharing scheme with diverse access structure. Wirel. Pers. Commun. 99(3), 1329–1344 (2018)CrossRef

56.

Wan, S.; Lu, Y.; Yan, X.; Wang, Y.; Chang, C.: Visual secret sharing scheme for (k, n) threshold based on QR code with multiple decryptions. J. Real Time Image Proc. 14(1), 25–40 (2018)CrossRef

57.

Al-Qurashi, A.; Gutub, A.: Reliable secret key generation for counting-based secret sharing. J. Comput. Sci. Comput. Math. 8(4), 87–101 (2018). https://doi.org/10.20967/jcscm.2018.04.006 CrossRef

58.

Al-Ghamdi, M.; Al-Ghamdi, M.; Gutub, A.: Security enhancement of shares generation process for multimedia counting-based secret-sharing technique. Multimed. Tools Appl. 78, 16283–16310 (2019). https://doi.org/10.1007/s11042-018-6977-2 CrossRef

59.

Van Son, R.: Measure Password strength. http://www.fon.hum.uva.nl/rob/PasswordStrength.html (2011). Accessed 16 July 2018

60.

Bassham, L.; Rukhin, A.; Soto, J.; Nechvatal, J.; Smid, M.; Leigh, S.; Levenson, M.; Vangel, M.; Heckert, N.; Banks, D.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22 Rev 1a, Gaithersburg, MD, US (2010)

61.

Gutub, A.: Merging GF(p) elliptic curve point adding and doubling on pipelined VLSI cryptographic ASIC architecture. Int. J. Comput. Sci. Netw. Secur.: IJCSNS 6(3A), 44–52 (2006)

62.

Gutub, A.: Fast 160-bits GF(p) elliptic curve crypto hardware of high-radix scalable multipliers. Int. Arab J. Inf. Technol.: IAJIT 3(4), 342–349 (2006)

63.

Gutub, A.; Alkhodaidi, T.: Smart expansion of target key for more handlers to access multimedia counting-based secret sharing. Multimed. Tools Appl. (2020). https://doi.org/10.1007/s11042-020-08695-y CrossRef

64.

Karim, S.; Rahman, S.; Hossain, I.: A new approach for LSB based image steganography using secret key. In: International Conference on Computer and Information Technology (ICCIT 2011), pp. 286–291 (2011)

65.

Kurup, S.; Rodrigues, A.; Bhise, A.: Data hiding scheme based on octagon shaped shell. In: International Conference on Advances in Computing, Communications and Informatics (ICACCI), pp. 1982–1986 (2015)

66.

Hussain, M.; et al.: Image steganography in spatial domain: a survey. Sig. Process. Image Commun. 65, 46–66 (2018)CrossRef

Titel: Trustworthy Target Key Alteration Helping Counting-Based Secret Sharing Applicability
verfasst von: Taghreed AlKhodaidi
Adnan Gutub
Publikationsdatum: 06.03.2020
Verlag: Springer Berlin Heidelberg
Erschienen in: Arabian Journal for Science and Engineering / Ausgabe 4/2020
Print ISSN: 2193-567X
Elektronische ISSN: 2191-4281
DOI: https://doi.org/10.1007/s13369-020-04422-9

Premium Partner

Marktübersichten

Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.

Zur Marktübersicht

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 4/2020

On Stability Analysis of Particle Swarm Optimization Algorithm

Detection Framework for Content-Based Cybercrime in Online Social Networks Using Metaheuristic Approach

New Approaches in Metaheuristic to Classify Medical Data Using Artificial Neural Network

Initial Seed Selection for Mixed Data Using Modified K-means Clustering Algorithm

Information Flow Tracking and Auditing for the Internet of Things Using Software-Defined Networking

Bottleneck Feature-Based Hybrid Deep Autoencoder Approach for Indian Language Identification

Premium Partner

Marktübersichten