Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Wireless Personal Communications
Erschienen in: Wireless Personal Communications 1/2017

26.04.2017

A Verifiable (k,n,m)-Threshold Multi-secret Sharing Scheme Based on NTRU Cryptosystem

verfasst von: Ali Nakhaei Amroudi, Ali Zaghain, Mahdi Sajadieh

Erschienen in: Wireless Personal Communications | Ausgabe 1/2017

Einloggen

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

search-config
loading …

Abstract

The existing secret sharing schemes suffer from resistance against quantum attacks or requirement to a secure channel. In this paper, we introduce a verifiable multi-secret sharing scheme using NTRU cryptosystem which is a post quantum cryptosystem. Our scheme is based on multivariate polynomials and uses hash functions for verification. In addition, our scheme does not require a secure channel and all public data are resistant against quantum attacks.
Vorheriger Artikel Radio Transmitter Identification Based on Collaborative Representation
Nächster Artikel Average BER Performance of Orthogonal Space–Time Block Coding System with Antenna Selection Over Generalized η–μ Fading Channel

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
Literatur
1.
Ballico, E., & Elia, M. (2016). On evaluating multivariate polynomials over finite fields. Quaestiones Mathematicae, 39(1), 1–8.MathSciNetCrossRef
2.
Blakley, G. R. (1979). Safeguarding cryptography keys. In Proceedings of the AFIPS 1979 national computer conference (pp. 313-317).
3.
Chan, C.-W., & Chang, C.-C. (2005). A scheme for threshold multi-secret sharing. Applied Mathematics Computation, 166(1), 1–14.MathSciNetCrossRefMATH
4.
Chang, T. Y., Hwang, M. S., & Yang, W. P. (2005). An improvement on the Lin-Wu (t, n)-threshold verifiable multi-secret sharing scheme. Applied Mathematics Computation, 163, 169–178.MathSciNetCrossRefMATH
5.
Das, A., & Adhikari, A. (2010). An efficient multi-use multi-secret sharing scheme based on hash function. Applied Mathematics Letters, 23(9), 993–996.MathSciNetCrossRefMATH
6.
Dehkordi, M. H., & Mashhadi, S. (2008). An efficient threshold verifiable multi-secret sharing. Computer Standards and Interfaces, 30(3), 187–190.CrossRefMATH
7.
Dehkordi, M. H., & Farzaneh, Y. (2015). A new verifiable multi-secret sharing scheme realizing adversary structure. Wireless Personal Communications, 82(3), 1749–1758.CrossRef
8.
Dehkordi, M. H., & Mashhadi, S. (2008). New efficient and practical verifiable multi-secret sharing schemes. Information Sciences, 178(9), 2262–2274.MathSciNetCrossRefMATH
9.
Dehkordi, M. H., & Mashhadi, S. (2008). Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves. Computer Communications, 31(9), 1777–1784.CrossRef
10.
Dehkordi, M. H., & Ghasemi, R. (2016). A lightweight public verifiable multi secret sharing scheme using short integer solution. Wireless Personal Communications, 91(3), 1459–1469.CrossRef
11.
Eslami, Z., & Ahmadabadi, J. Z. (2010). A verifiable multi-secret sharing scheme based on cellular automata. Information Sciences, 180(15), 2889–2894.MathSciNetCrossRefMATH
12.
Forouzan, B. A. (2007). Cryptography and network security. New York: McGraw-Hill Inc.
13.
Grenet, B. (2016). Bounded-degree factors of lacunary multivariate polynomials. Journal of Symbolic Computation, 75, 171–192.MathSciNetCrossRefMATH
14.
Hoffstein J., Pipher J., & Silverman J.H. (1998). NTRU: a ring-based public key cryptosystem. In algorithmic number theory. Lecture notes in computer science, (Vol. 1423, pp. 267-288). Berlin: Springer.
15.
16.
Hu, C., Liao, X., & Cheng, X. (2012). Verifiable multi-secret sharing based on LFSR sequences. Theoretical Computer Science, 445, 52–62.MathSciNetCrossRefMATH
17.
Kouzmenko, R. (2006), Generalizations of the NTRU cryptosystem. Master’s thesis, Polytechnique, Montreal, Canada.
18.
Lenstra, A. K., Lenstra, Jr., H. W., Manasse, M. S., & Pollard, J. M. (1990), The number field sieve, In Proceeding of the 22nd annual ACM symposium on theory of computing (pp. 564-572). New York: ACM
19.
Liaojun, P., Huixian, L., & Yumin, W. (2006). An efficient and secure multi-secret sharing scheme with general access structures. Wuhan University Journal of Natural Sciences, 11(6), 1649–1652.MathSciNetCrossRefMATH
20.
Mashhadi, S., & Dehkordi, M. H. (2015). Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem. Information Sciences, 294, 31–40.MathSciNetCrossRefMATH
21.
22.
Pang, L.-J., & Wang, Y.-M. (2005). A new (t, n) multi-secret sharing scheme based on Shamirs secret sharing. Applied Mathematics Computation, 167, 840–848.MathSciNetCrossRefMATH
23.
Rosenberg, S. (2017). Square-free values of multivariate polynomials over function fields in linear sparse sets. International Journal of Number Theory, 13(01), 77–108.MathSciNetCrossRefMATH
24.
25.
Shao, J. (2014). Efficient verifiable multi-secret sharing scheme based on hash function. Information Sciences, 278, 104–109.MathSciNetCrossRefMATH
26.
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
27.
Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring, In Proceedings, 35th annual symposium on foundations of computer science, IEEE (pp. 124-134).
28.
Steffensen, J. F. (2006). Interpolation (2nd ed.). New York: Dover Publications, Inc.MATH
29.
Vincze, C. (2016). Algebraic dependency of roots of multivariate polynomials and its applications to linear functional equations. Periodica Mathematica Hungarica, 74(1), 112–117.MathSciNetCrossRefMATH
30.
Yang, C. C., Chang, T. Y., & Hwang, M. S. (2004). A (t, n) multi-secret sharing scheme. Applied Mathematics and Computation, 151(2), 483–490.MathSciNetCrossRefMATH
31.
32.
Zhao, J., Zhang, J., & Zhao, R. (2007). A practical verifiable multi-secret sharing scheme. Computer Standards and Interfaces, 29(1), 138–141.CrossRef
Metadaten
Titel
A Verifiable (k,n,m)-Threshold Multi-secret Sharing Scheme Based on NTRU Cryptosystem
verfasst von
Ali Nakhaei Amroudi
Ali Zaghain
Mahdi Sajadieh
Publikationsdatum
26.04.2017
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 1/2017
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-017-4245-9

Weitere Artikel der Ausgabe 1/2017

Wireless Personal Communications 1/2017 Zur Ausgabe

OriginalPaper

Minimized SER and QOS Based Power Allocation Strategies for Multi HDAF Relay Cooperative Network

OriginalPaper

Cost Reduction in Location Management Using Reporting Cell Planning and Particle Swarm Optimization

OriginalPaper

Low Power Consuming 1 KB (32 × 32) Memory Array Using Compact 7T SRAM Cell

OriginalPaper

Signal Cyclostationarity Detection Based Spectrum Sensing Using Simple Diversity Combining Technique and Its Implementation

OriginalPaper

Modeling and Statistical Analysis of Scenario Metric Parameters of Ad Hoc on Demand Distance Vector Routing Protocol

OriginalPaper

An Improved E-Payment System and Its Extension to a Payment System for Visually Impaired and Blind People with User Anonymity

Neuer Inhalt

    Bildnachweise