nach oben

Wireless Personal Communications

Erschienen in:

31.10.2016

(t, n) Multi-Secret Sharing Scheme Based on Bivariate Polynomial

verfasst von: Lein Harn, Ching-Fang Hsu

Erschienen in: Wireless Personal Communications | Ausgabe 2/2017

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

In a (t, n) secret sharing scheme (SS), a dealer divides the secret into n shares in such way that any t or more than t shares can reconstruct the secret but fewer than t shares cannot reconstruct the secret. The multi-SS is an extension of the (t, n) SS in which shares can be reused to reconstruct multiple secrets. Thus, the efficiency of the multi-SS is better than the efficiency of the (t, n) SS. In this paper, we propose the first multi-SS using a bivariate polynomial. Our design is unique in comparing with all existing multi-SSs. Shares generated using a bivariate polynomial can not only be used to reconstruct multiple secrets but also be used to establish pairwise keys between any pair of shareholders. The pairwise keys can protect exchange information in the secret reconstruction to prevent outsiders from obtaining the recovered secrets. All existing multi-SSs require additional key establishment to accomplish this.

Vorheriger Artikel A Survey on Cooperative MAC Protocols in IEEE 802.11 Wireless Networks

Nächster Artikel Modeling and Analysis of the TXOPLimit Efficiency with the Packet Fragmentation in an IEEE 802.11e-EDCA Network Under Noise-Related Losses

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

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

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 "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Asmuth, C. A., & Bloom, J. (1983). A modular approach to key safeguarding. IEEE Transactions on Information Theory, 30(2), 208–210.MathSciNetCrossRef

Blakley, G. R. (1979). Safeguarding cryptographic keys. In Proceedings of AFIPS’79 national computer conference (Vol. 48, pp. 313–317). Montvale: AFIPS Press.

Benaloh, J. C. (1987). Secret sharing homomorphisms: Keeping shares of a secret. In Advances in cryptology—CRYPTO’86, in LNCS (Vol. 263, pp. 251–260). New York: Springer.

Gennaro, R., Ishai, Y., Kushilevitz, E., & Rabin, T. (2001). The round complexity of verifiable secret sharing and secure multicast. In STOC (pp. 580–589).

Harn, L., & Lin, C. (2010). Authenticated group key transfer protocol based on secret sharing. IEEE Transactions on Computers, 59(6), 842–846.MathSciNetCrossRefMATH

Harn, L. (2013). Group authentication. IEEE Transactions on Computers, 62(9), 1893–1898.MathSciNetCrossRefMATH

Harn, L. (2014). Secure secret reconstruction and multi-secret sharing schemes with unconditional security. Security and Communication Networks, 7(3), 567–573.CrossRef

Harn, L. (1995). Efficient sharing (broadcasting) of multiple secrets. IEE Computers and Digital Techniques, 142(3), 237–240.CrossRef

Harn, L. (1995). Comment multistage secret sharing based on one-way function. Electronic Letters, 31(4), 262.CrossRef

10.

He, J., & Dawson, E. (1994). Multistage secret sharing based on one-way function. Electronic Letters, 30(19), 1591–1592.CrossRef

11.

He, J., & Dawson, E. (1995). Multi-secret sharing scheme based on one-way function. Electronic Letters, 31(2), 93–94.CrossRef

12.

Katz, J., Koo, C., & Kumaresan, R. (2008). Improved the round complexity of VSS in point-to-point networks. In Proceedings of ICALP ‘08, Part II, in: LNCS (Vol. 5126, pp. 499–510). New York: Springer.

13.

Kumaresan, R., Patra, A., & Rangan, C. P. (2010). The round complexity of verifiable secret sharing: the statistical case. In Advances in cryptology—ASIACRYPT 2010, in: LNCS (Vol. 6477, pp. 431–447). New York: Springer.

14.

Lin, T. Y., & Wu, T. C. (1999). (t, n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems. IEE Proceedings of Computers & Digital Techniques, 146(5), 264–268.CrossRef

15.

Lin, H. Y., & Yeh, Y. S. (2008). Dynamic multi-secret sharing scheme. International Journal of Contemporary Mathematical Sciences, 3(1), 37–42.MathSciNetMATH

16.

Mignotte, M. (1983). How to share a secret. In Cryptography-proceedings of the workshop on cryptography, lecture notes in computer science (Vol. 149, pp. 371–375). New York: Springer.

17.

Nirmala, S. J., Bhanu, S. M. S., & Patel, A. A. (2012). A comparative study of the secret sharing algorithms for secure data in the cloud. International Journal on Cloud Computing: Services and Architecture (IJCCSA), 2(4), 63–71.

18.

Nojoumian, M., & Stinson, D. R. (2012). Social secret sharing in cloud computing using a new trust function. In Proceeding of 2012 tenth annual international conference on privacy, security and trust (pp. 16–167).

19.

Nikov, V., & Nikova, S. (2005). On proactive secret sharing schemes. In LNCS (Vol. 3357, pp. 308–325). New York: Springer.

20.

Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11), 612–613.MathSciNetCrossRefMATH

21.

Shao, J., & Cao, Z. (2005). A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Applied Mathematics and Computation, 168(1), 135–140.MathSciNetCrossRefMATH

22.

Takahashi, S., & Iwamura, K. (2013). Secret sharing scheme suitable for cloud computing. In Proceeding of 2013 IEEE 27th international conference on advanced information networking and applications (pp. 530–537).

23.

Yang, C. C., Chang, T. Y., & Hwang, M. S. (2004). A (t, n) multi secret sharing scheme. Applied Mathematics and Computation, 151, 483–490.MathSciNetCrossRefMATH

Titel: (t, n) Multi-Secret Sharing Scheme Based on Bivariate Polynomial
verfasst von: Lein Harn
Ching-Fang Hsu
Publikationsdatum: 31.10.2016
Verlag: Springer US
Erschienen in: Wireless Personal Communications / Ausgabe 2/2017
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI: https://doi.org/10.1007/s11277-016-3862-z

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 "Technik"

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 2/2017

A Wireless On-line Temperature Monitoring System for Rotating Electrical Machine

Efficient Lattice Reduction Aided Detectors Under Realistic MIMO Channels

Towards Development of a Low Cost Early Fire Detection System Using Wireless Sensor Network and Machine Vision

Design and Performance Evaluation of Metamaterial Inspired MIMO Antennas for Wireless Applications

Performance Analysis of Scheduled TAS Cognitive Radio System with Generalized Selection Combining

Numerical Modeling of Human Tissues and Scattering Parameters for Microwave Cancer Imaging Systems