A Trusted Multi-Party Authentication Scheme Based on Proactive-ElGamal Threshold Secret Sharing System

2012 ◽  
Vol 235 ◽  
pp. 20-24
Author(s):  
Yu Guang Yang ◽  
Hai Ping Chai
Keyword(s):  
Secret Sharing ◽  
Discrete Logarithm ◽  
Authentication Scheme ◽  
Discrete Logarithm Problem ◽  
Lower Efficiency ◽  
Threshold Secret Sharing ◽  
Elgamal Cryptosystem ◽  
Authentication Schemes

In most existing authentication schemes users are authenticated by the server one by one which results in lower efficiency of authentication when the number of users is large. Aiming at the drawback, this paper propose an efficient trusted multi-party authentication scheme based on threshold secret sharing, the discrete logarithm problem and ElGamal cryptosystem. Using (t,n) threshold secret sharing idea, the paper propose a (t,n) threshold authentication scheme which can not only simultaneously authenticate t users satisfying some specific conditions, but also authenticate new users dynamically by distributing a new authentication key for the new user which was produced by t old users and the new user together. Finally, the security and efficiency of the proposed scheme are analyzed.

scholarly journals Linear (t,n) Secret Sharing Scheme with Reduced Number of Polynomials

2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Kenan Kingsley Phiri ◽  
Hyunsung Kim
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Threshold Secret Sharing ◽  
Sharing Scheme ◽  
Cheating Detection ◽  
Linear Scheme ◽  
Elgamal Cryptosystem ◽  
Important Branch

Threshold secret sharing is concerned with the splitting of a secret into n shares and distributing them to some persons without revealing its information. Any t ≤ n persons possessing the shares have the ability to reconstruct the secret, but any persons less than t cannot do the reconstruction. Linear secret sharing scheme is an important branch of secret sharing. The purpose of this paper is to propose a new polynomial based linear (t, n) secret sharing scheme, which is based on Shamir’s secret sharing scheme and ElGamal cryptosystem. Firstly, we withdraw some required properties of secret sharing scheme after reviewing the related schemes and ElGamal cryptosystem. The designed scheme provides the properties of security for the secret, recoverability of the secret, privacy of the secret, and cheating detection of the forged shares. It has half computation overhead than the previous linear scheme.

Composite Discrete Logarithm Problem and a Reconstituted ElGamal Cryptosystem Based on the Problem

2020 ◽  
pp. 163-181
Author(s):  
Çağla Özyılmaz ◽  
Ayşe Nallı
Keyword(s):  
Discrete Logarithm ◽  
Fibonacci Sequence ◽  
The Other ◽  
Discrete Logarithm Problem ◽  
The Third ◽  
Elgamal Cryptosystem ◽  
New System

In this chapter, the authors have defined a new ElGamal cryptosystem by using the power Fibonacci sequence module m. Then they have defined a new sequence module m and the other ElGamal cryptosystem by using the new sequence. In addition, they have compared that the new ElGamal cryptosystems and ElGamal cryptosystem in terms of cryptography. Then the authors have defined the third ElGamal cryptosystem. They have, particularly, called the new system as composite ElGamal cryptosystem. The authors made an application of composite ElGamal cryptosystem. Finally, the authors have compared that composite ElGamal cryptosystem and ElGamal cryptosystem in terms of cryptography and they have obtained that composite ElGamal cryptosystem is more advantageous than ElGamal cryptosystem.

scholarly journals A New Remote Fuzzy User Password Authentication Scheme Using Sub-tree for Cloud Computing

2021 ◽  
Vol 15 ◽  
pp. 92-105
Author(s):  
Chandrashekhar Meshram ◽  
Cheng-Chi Lee ◽  
Muhammad Khurram Khan ◽  
Kailash Kalare ◽  
Sarita Gajbhiye Meshram
Keyword(s):  
Cloud Computing ◽  
Discrete Logarithm ◽  
Computational Cost ◽  
Authentication Scheme ◽  
Internet Technology ◽  
Computing Environment ◽  
Password Authentication ◽  
Cloud Computing Environment ◽  
Internet Technologies ◽  
Authentication Schemes

Recent advancements in internet technology and the infrastructure have attracted more people and organizations to do everything online. Internet technologies have provided amazing and smooth ease for electronic sales and purchases. However, many people have refused to use these internet technologies in electronic purchases because of unstable and insecure forms. New hacking techniques and new types of attacks have been tackled to make these internet technologies better and safer. Smartcard-based password authentication schemes have been the mainstream in recent years, featuring their highly lightweight, easy-to-use equipment and lowcost apps. Various secure and faster authentication schemes have been proposed in the literature. However, most of the existing authentication schemes have found vulnerable to recent attacks and have security flaws. This paper provides and efficient way for authentication using the partial discrete logarithm and sub-tree structure. The proposed scheme has seen effective and more useful in cloud computing environment. The analysis based on the security and the computational cost shows that the proposed authentication scheme proves to be more secure and efficient compared to other protocols that serve the same purposes.

scholarly journals Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem

1992 ◽  
Vol 21 (388) ◽  
Author(s):  
Torben Pryds Pedersen
Keyword(s):  
Secret Sharing ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Shannon Information ◽  
Public Key ◽  
Additional Property ◽  
Secret Key ◽  
Verifiable Secret Sharing ◽  
The Public ◽  
High Level

Secret sharing allows a secret key to be distributed among n persons, such that k(1 <= k <= n) of these must be present in order to recover it at a later time. This report first shows how this can be done such that every person can verify (by himself) that his part of the secret is correct even though fewer than k persons get no Shannon information about the secret. However, this high level of security is not needed in public key schemes, where the secret key is uniquely determined by a corresponding public key. It is therefore shown how such a secret key (which can be used to sign messages or decipher cipher texts) can be distributed. This scheme has the property, that even though everybody can verify his own part, sets of fewer than k persons cannot sign/decipher unless they could have done so given just the public key. This scheme has the additional property that more than k persons can use the key without compromising their parts of it. Hence, the key can be reused. This technique is further developed to be applied to undeniable signatures. These signatures differ from traditional signatures as they can only be verified with the signer's assistance. The report shows how the signer can authorize agents who can help verifying signatures, but they cannot sign (unless the signer permits it).

DIRECTED USER AUTHENTICATION SCHEME BASED ON DISCRETE LOGARITHM

1999 ◽  
Vol 09 (05n06) ◽  
pp. 299-306 ◽  
Author(s):  
SHAOHUA TANG ◽  
WEIHUA MA
Keyword(s):  
User Authentication ◽  
Mutual Authentication ◽  
Discrete Logarithm ◽  
Authentication Scheme ◽  
User Authentication Scheme ◽  
Authentication Schemes ◽  
And Performance

One new concept, "directed" authentication is presented in this letter. By "directed", we mean "of one direction", i.e., only the specified verifier can validate the verifiee's identity, anyone else cannot verify it without the help of this specified verifier. One strong directed authentication scheme based on the discrete logarithm is proposed in this letter, and the security and performance of which are also analyzed. It is shown in this letter that the proposed scheme is secure and the performance is superior to those of the mutual authentication schemes based on ID-based cryptosystems.

scholarly journals On the first fall degree of summation polynomials

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers
Keyword(s):  
Elliptic Curve ◽  
Gröbner Basis ◽  
Discrete Logarithm ◽  
Polynomial Systems ◽  
Discrete Logarithm Problem ◽  
Grobner Basis ◽  
Weil Descent ◽  
Degree Bound

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

Sign in / Sign up

Export Citation Format

Share Document