A NOVEL ECDLP-BASED BLIND SIGNATURE SCHEME WITH AN ILLUSTRATION

International Journal of Innovation, Management and Technology, 2014

2015

Abstract: Proxy partially blind signature allows a proxy signer to explicitly embed presaged common information c into the blind signature without loss of blindness property. The focus of this paper is to present the efficient stamped proxy partially blind signature (SPPBS) scheme based on elliptic curve discrete logarithm problem (ECDLP) with collision-resistant cryptographic hash function which records the time stamp during signing phase of the proxy partially blind signature and to allow the original signer to revoke delegating power whenever necessary The proposed scheme satisfies all the security properties of proxy blind signature, i.e. distinguishability, nonrepudation, unforgeability, identifiability, unlinkability, and prevention of misuse. Furthermore, the proposed scheme requires minimal operation in proxy delegation, partially blinding, signing extraction and verification thus makes it very efficient. This can be implemented in low power and small processor handheld devi...

Proxy blind Signature is a digital signature where an original signer delegates his/her signing capability to a proxy signer who performs message signing blindly, on behalf of original signer but he cannot make a linkage between the blind signature and the identity of the message's owner. Recently, Qi et al proposed an improved proxy blind signature scheme based on factoring and elliptic curve discrete log problem (ECDLP). In this paper we show that Qi et al's scheme does not hold the identifiability and unlinkability properties. Moreover, we also point out that their scheme is not secure against universal forgery attack. Furthermore, we propose an improved proxy blind signature scheme to remedy the weaknesses of Qi et al.'s scheme. The security and performance of the improved scheme are also analyzed.

2013

In this paper, we propose a blind signature scheme and three practical educed schemes based on elliptic curve discrete logarithm problem. The proposed schemes impart the GOST signature structure and utilize the inherent advantage of elliptic curve cryptosystems in terms of smaller key size and lower computational overhead to its counterpart public key cryptosystems such as RSA and ElGamal. The proposed schemes are proved to be secure and have less time complexity in comparison with the existing schemes.

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2017

Blind signature is an interesting cryptographic primitive which allows user to get signature on his document from signatory authority, without leaking any information. Blind signature is useful in many e-commerce applications where user's anonymity is the main concern. Since the Zhang et al., was the first to propose the identity based blind signature, many schemes based on bilinear pairing have been proposed. But the computational cost of pairing operation on elliptic curve is around 20 times the point multiplication on an elliptic curve. In order to save the running time, we present a new Identity-Based Blind Signature (ID-BS) scheme whose security is based on elliptic curve discrete logarithm problem (ECDLP). Performance comparison shows that proposed scheme reduces the cost of computation. Security analysis shows that proposed scheme is secure against the adversary and achieves the property of blindness and Non-forgeabillity. At the end; we propose an e-cash payment system based on our ID-based blind signature scheme.

2016

In this paper, we propose a blind signature scheme and three practical educed schemes based on elliptic curve discrete logarithm problem. The proposed schemes impart the GOST signature structure and utilize the inherent advantage of elliptic curve cryptosystems in terms of smaller key size and lower computational overhead to its counterpart public key cryptosystems such as RSA and ElGamal. The proposed schemes are proved to be secure and have less time complexity in comparison with the existing schemes.

Information Technology,(ICIT 2007 …, 2008

In this paper, a novel Blind Signature Scheme (BSS) based on Nyberg-Rueppel Signature Scheme (NRSS) using Elliptic Curve Discrete Logarithm Problem (ECDLP) has been proposed. Blind signature allows a requester to obtain signature from a signer on any document, in such a ...

Nowadays anonymity, rights delegations and hiding information play primary role in communications through internet. We proposed a proxy blind signcryption scheme based on elliptic curve discrete logarithm problem (ECDLP) meet all the above requirements. The design scheme is efficient and secure because of elliptic curve crypto system. It meets the security requirements like confidentiality, Message Integrity, Sender public verifiability, Warrant unforgeability, Message Unforgeability, Message Authentication, Proxy Non-Repudiation and blindness. The proposed scheme is best suitable for the devices used in constrained environment.

Электромагнитные волны и электронные системы No5 за 2015 г., 2015

This paper introduced the new blind signature scheme inspired from Schnorr signaturescheme. The proposed signature scheme is proved to be more security than previous researchesin this field by hiding the original author of a message .

Blind signature schemes, as important cryptographic primitives, are useful protocols that guarantee the anonymity of the participants. In this paper, a new blind signature based on the strong RSA assumption is presented. The new blind signature scheme is quite efficient and statefree. It does not require the signer to maintain any state and can be proven secure against adaptive chosen message attack under a reasonable tractability assumption, the so-called Strong RSA assumption. Moreover, a hash function can be incorporated in to the scheme in such a way that it is also secure in the random oracle model under the standard RSA assumption.

International Journal of Scientific & Engineering Research, 2018

The Blind signature is similar to digital signature except that a message is signed by a signer without knowing the content of the message. It is one of the most famous cryptographic techniques in E-voting system (EVS) that guarantee the anonymity of the voters. In this paper, first, we analyze a recently introduced blind signature scheme and show that, the attacker can forge a legitimate signature for any desired message without obtaining the signer’s private key. In other words, Mohsen et al.’s blind signature scheme is universally forgeable. Then, a new blind signature scheme based on the discrete logarithm problem (DLP) and the modified ElGamal digital signature is presented. The proposed blind signature scheme meets all properties of blind signature such as correctness, blindness, unforgeability and untraceability. Therefore, the proposed blind signature scheme is more efficient in EVS to ensure voter anonymity, in other words to remove voter’s identity from his cast ballot.

2012

Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on factoring (FAC) problem and elliptic curve discrete logarithms (ECDL) problem. As the proposed scheme is focused on factoring and ECDLP hard problems, it has a solid structure and will totally leave the intruder bemused because it is very unlikely to solve the two hard problems simultaneously. In order to assess the security level of the proposed scheme a performance analysis has been conducted. Results have proved that the proposed scheme effectively deals with the partial blindness, randomization, unlinkability and unforgeability properties. Apart from this we have also investigated the computat...

International Journal of Computer Applications, 2013

Security of the consumer"s data over internet is the major problem in present time. In this paper we have analyzed blind signature schemes based on RSA and with taking advantage of elliptic curve cryptography to achieve the security goals. Blind signature scheme is one of the security protocol to obtain signature from a signer such that signer sign the message without reading the content of the message and also he could not link the protocol with the resulting message signature pair [7]. Blind signature scheme is used to achieve certain security goals like blindness, untraceability, authenticity, unforgeability [1]. We have analyzed blind signature scheme to achieve the security goals using Elliptic Curve Cryptosystem. Elliptic curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was initially presented by Neal Koblitz and Victor S. Miller. Elliptic curve cryptosystem has advantages in terms of smaller key size and lower computational overhead in comparison with public key cryptosystem [2]. Many researchers have been presented the secure blind signature scheme with their own goals and limitations. Two properties a blind signature scheme should hold digital signature and blind signature. By using concept of Elliptic Curve Cryptosystem and blinding algorithm, the signer generates the blind signature without reading content of the message [5]. The scheme avoids the collision between different digital signatures generated by the same singer. The blind signature is a secure technique can be applied in ebusiness and other applications. Blind signature schemes are widely used for various applications of E-commerce like digital payment systems and electronic voting system etc where to maintain the privacy of consumer is necessary [9].

Proceedings - 2010 2nd International Conference on Multimedia Information Networking and Security, MINES 2010, 2010

In this paper, we aim to improve the recently proposed Yang et al.'s proxy blind signature scheme in order to withstand the security flaw in their scheme. The security of the improved scheme is enhanced in the signing phase and based on difficulty of solving the discrete logarithm problem (DLP). The analysis shows that the proposed scheme resolves security problem in Yang et al.'s scheme and also meets the aspects of security features needed by a proxy blind signature.

In this paper we have designed a partially blind signature scheme for the blinded e-cash based payment system using ECC-based self-certified public key cryptosystems. Using partially blind signatures to design the e-cash scheme can avoid the unlimited growth of the bank's database which keeps all spent e-cashes for preventing double spending, and also let the signer assure himself that the message contains accurate information such as the face value of the e-cash without seeing it. In addition, the proposed e-cash system is constructed using elliptic curve cryptosystems (ECC) under the limited-storage environment such as smart cards, and therefore able to efficiently use smart cards to store the coins. Furthermore, in order to avoid criminals to abuse the anonymity, the proposed electronic payment system is traceable by the trustee in the case of fraudulent transactions. We affirm the proposed efficient security schemes will make the electronic cash payment system securely workable for Internet consumers.