Secured digital signature based on factor problem over non-commutative groups
01 Dec 2016-pp 1-4
TL;DR: This article designs a secured digital signature based on properties of non-commutative group and demonstrates the digital signature in singular groups like GL n (Fq), UT n (fq) and the Braid Groups.
Abstract: In this article, we design a secured digital signature based on properties of non-commutative group. The security of digital signature is based on the hardness of the Factor problem over non-commutative groups. We believe that the Factor problem over non-commutative groups is NP hard. To promote this towards implementation strongly, we will demonstrate the digital signature in singular groups like GL n (F q ), UT n (F q ) and the Braid Groups. Finally we explained security analysis.
Citations
More filters
08 Oct 2018
TL;DR: This expert smart meter system has a proficient linear O(n) communication cost and is proven to protect customer's privacy even in the presence of a corrupted substation and some malicious smart meters.
Abstract: Purpose
The purpose of this paper is to replace electronic meters with smart meters. Smart meters will provide high resolution real-time end-user power consumption data for utilities to better monitor and control the system, which is used for end users to better manage their energy usage and bills. By using smart meters, we can reduce the errors and also minimize human intervention in processing information in an efficient way. So that time will be reduced for organization functionalities and accuracy will be increase.
Design/methodology/approach
The authors propose a new cryptosystem based on factor problem over non commutative groups. They tried to use this cryptosystem in the field of electricity. They extend and transform this projected cryptosystem to design expert smart meters based on homomorphic encryption with factor problem.
Findings
In these smart meters, a monitoring system is integrated that preserves customer’s privacy by homomorphically accumulating the consumption of all n members of a specific domain.
Originality/value
This expert smart meter system has a proficient linear O(n) communication cost and is proven to protect customer's privacy even in the presence of a corrupted substation and some malicious smart meters.
References
More filters
23 Aug 1985
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Abstract: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
7,514 citations
TL;DR: A digital signature scheme based on two well-known assumptions based on the difficulties of simultaneously solving the factoring and discrete logarithms problems with almost the same sizes of arithmetic moduli is presented.
Abstract: A digital signature scheme based on two well-known assumptions is presented. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring and discrete logarithms problems with almost the same sizes of arithmetic moduli. Each user in the system uses common arithmetic moduli and only requires one public key and one private key.
48 citations
01 Sep 1995
TL;DR: The purpose of this comment is to show that the security of the signature scheme is not as secure as they have claimed.
Abstract: J. He and T. Kiesler (1994) proposed a digital signature scheme to embed both the discrete logarithm problem and the factorisation problem in the processing of signing to enhance the security of the original El Gamal signature scheme (1985). The purpose of this comment is to show that the security of the signature scheme is not as secure as they have claimed. >
31 citations
01 Jul 1994
TL;DR: In this paper, the authors proposed the use of more than one hard problem in the design of cryptographic protocols to enhance their security, such as the discrete logarithm problem and the factorization problem.
Abstract: The paper proposes the use of more than one hard problem in the design of cryptographic protocols to enhance their security. Specifically, both the discrete logarithm problem and the factorisation problem are embedded in the process of signing to enhance the security of the original El Gamal signature scheme.
22 citations
TL;DR: A new digital signature scheme based on the difficulty of simultaneously factoring a composite number and computing discrete logarithms is proposed, which each user uses common arithmetic moduli and only owns one private key and one public key.
Abstract: This article proposes a new digital signature scheme based on the difficulty of simultaneously factoring a composite number and computing discrete logarithms. In the proposed scheme, each user uses...
22 citations