Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
A proxy blind signature scheme is a special form of blind signature which allows a designated person called proxy signer to sign on behalf of two or more original signers without knowing the content of the message or document. It combines the advantages of proxy signature, blind signature and multi-signature scheme and satisfies the security properties of both proxy and blind signature scheme. Most of the exiting proxy blind signature schemes were developed based on the mathematical hard problems integer factorization (IFP) and simple discrete logarithm (DLP) which take sub-exponential time to solve. This paper describes an secure simple proxy blind signature scheme based on Elliptic Curve Discrete Logarithm Problem (ECDLP) takes fully-exponential time. This can be implemented in low power and small processor mobile devices such as smart card, PDA etc. Here also we describes implementation issues of various scalar multiplication for ECDLP
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.
2010
This paper describes an efficient simple proxy blind signature scheme. The security of the scheme is based on Elliptic Curve Discrete Logarithm Problem(ECDLP). They claim that this system can be implemented in low power and small processor mobile devices such as smart card, PDA etc.
International Journal of Mathematics in Operational Research, 2016
Partially blind signature is cryptographic system that is used in several protocols including e-cash and e-commerce systems. In proxy partially blind signature, part of the message is approved by the signer and the signature supplicant. Elliptic curve discrete logarithmic (ECDL) is an extremely difficult to solve problem as compared to any standard inverse operation of a one-way-trap door function including discrete logarithm problem or factorisation problem. In this paper, we propose a new proxy partially blind signature scheme based on ECDL. The main attractive features of the proposed scheme are the low computational cost and the low communication overhead. Moreover, the new scheme provides an extra level of security properties of both the partially blind signature and proxy signature. Several security analysis are shown to prove the security and the efficiency of the proposed scheme.
A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of two or more original signers without knowing the content of the message or document. It combines the advantages of proxy signature, blind signature and multi-signature scheme. This paper describes an efficient proxy blind multi-signature scheme. The security of the proposed schemes is based on the difficulty of breaking the one-way hash function and the elliptic curve discrete logarithm problem (ECDLP). This can be implemented in low power and small processor handheld devices such as smart card, PDA etc which work in low power and small processor. This scheme utilizes a trusted third party called certificate authority to ensure that signatures can only be generated during valid delegation period. It satisfies the security properties of both proxy and blind signature scheme.
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...
The ISC International Journal of Information Security, 2021
In recent years, due to their potential applications, proxy blind signatures became an active research topic and are an extension of the basic proxy signature. A proxy blind signature scheme enables a proxy signer to produce a blind signature on behalf of an original signer. Such schemes are useful in many practical applications such as e-commerce, e-voting, e-tendering systems. Many proxy blind signature schemes have been proposed in the literature. In order to improve the efficiency and to adopt resource constrained devices, in this paper, we propose a pairing free ID-based proxy blind signature scheme with message recovery. The proposed scheme is proven secure against the random oracle model under the hardness assumption of the elliptic curve discrete logarithm problem. We compare our scheme with the other proxy blind signature schemes. The efficiency analysis shows that our scheme is more efficient in terms of computational and communicational point of view. Also due to the message recovery property, our scheme can be deployed easily in low band width devices. https://www.isecure-journal.com/article_115537.html
Ijca Proceedings on International Conference on Emergent Trends in Computing and Communication, 2014
Internet has become an Integral part and prime need of every human being in their day to day life. People now prefer to do transaction over the internet than doing it offline as it reduces time consumption. In such scenarios, securing customer data is one of the biggest challenges for software developers. For this reason Security protocols like Blind Signature Scheme came into picture where requester is allowed obtain a signature from the signer who signs a message without reading the content of the message, and cannot link the protocol with the resulting message signature pair. Blind Signature scheme is mostly used for E-commerce applications like Digital payment system, Electronic-voting system as it provides security goals like blindness, untraceability, correctness and nonforgeability. Neal Koblitz and Victor S. Miller has presented Elliptic curve cryptography (ECC) which is an approach to public key cryptography based on algebraic structure of elliptic curves in over finite fields. Elliptic curve cryptosystem is more efficient than other public key cryptosystem due to difficulty in solving elliptic curve discrete logarithm problem. Using the benefits of elliptic curve cryptography we have presented implementation of blind signature scheme using JAVA.
2021
Blind signatures provide authenticity, integrity, nonrepudiation, blindness and untraceability of the message contents. In blind signature, the signer signs the message without revealing the contents of a message. Certificateless blind signature scheme is the combination of certificateless scheme and blind signature scheme. In certificateless blind signature scheme there is no need of certificates to verify the authenticity of the public key of user. In this research, the “Certificatrless blind signature scheme using ECC” of Nayak et al is analyzed. The analysis shows that the proposed certificateless blind signature scheme is not secure against the known cryptanalysis attacks. In fact, an attacker can easily reveal the secret key of the signer by mounting a forgery attack and can become a fake signer. After a successful cryptanalysis, a modified version of the scheme is presented. In the modified version of the scheme, the elliptic curve encryption and decryption is introduced in t...
International Journal of Electrical and Computer Engineering (IJECE), 2018
In various types of electronic transactions, including election systems and digital cash schemes, user anonymity and authentication are always required. Blind signatures are considered the most important solutions to meeting these requirements. Many studies have focused on blind signature schemes; however, most of the studied schemes are single blind signature schemes. Although blind multi-signature schemes are available, few studies have focused on these schemes. In this article, blind multi-signature schemes are proposed based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). The proposed schemes are based on the GOST R34.10-2012 digital signature standard and the EC-Schnorr digital signature scheme, and they satisfy blind multi-signature security requirements and have better computational performance than previously proposed schemes. The proposed schemes can be applied in election systems and digital cash schemes. Keyword: Blind signature EC-Schnorr signature GOST R34.10-2012 standard Multi-signature scheme Random oracle model (ROM) 1. INTRODUCTION David Chaum first proposed the idea of blind signatures based on the RSA signature scheme in 1983 [1]. Subsequently, a number of research studies on blind signatures was completed to protect the anonymity of users and prevent fake online transactions. In recent decades, elliptic curves have emerged as important factors in digital and crypto theory. The security level of cryptography systems is based on elliptic curve cryptography (ECC) and the difficulty of elliptic curve discrete logarithm problems (ECDLPs). The advantages of ECC cryptosystems compared with other public-key cryptography systems is that ECC ciphers provide security attributes comparable to traditional public-key cryptography systems despite their smaller key lengths. Reports have estimated that the 3248-bit length in the RSA cryptosystem has the same security level as the 256-bit length of the ECC cryptosystem. Thus, the installation of ECC consumes less system resources and energy and provides a higher level of security. Because of the advantage of small key length, ECC has been widely applied in many fields. Digital signatures based on the difficulty of ECDLPs were first introduced in 1991 in the independent research of NealsKoblitz [2]. Since the 2000s, the USA, Russia, Japan, Korea and several European countries have investigated these problems and have developed standard system solutions, such as the standards by ISO, ANSI, IEEE, SECG, and FIPS. ECDLP is the predominant cryptosystem in Russia. In 2001, Russia produced the GOST R34.10-2001 digital signature standard based on ECDLP with a 256-bit key length. The newest Russia version of the digital signature is GOST R34.10-2012 [3], which has a key length between 256 bits and 512 bits.
2016
Proxy blind multi-signature, it combines the properties of proxy-signature, blind signature and multi-signature,which has been applied in different application.In this paper, we showed a new proxy to proxy blind multi-signature based on difficulty of solving the discrete logarithm problem (DLP) which fulfill the absence of single proxy signer in Dongre’s[9] scheme by delegating his signing capabilities to a designated proxy signer. Moreover, we are taking this existing scheme into a new level or in next grade in order to sign the document on behalf of group of original signers.
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.
2008
In this paper, a novel Blind Signature Scheme (BSS) based on Elliptic Curve Discrete Logarithm Problem (ECDLP) has been proposed. The signer signs the encrypted message after receiving it from the requester. Hence the signer has no scope to learn the contents of the message that he has signed. But there is a scope to verify the authenticity of the signature on the original message by the requester and any other third party. The model has been validated using a customer and bank example and the proof of correctness has been made. The applicability of the proposed scheme can be extended to e-voting and others where the requester needs a blind signature on the message.
Blind signature allows a requester to obtain signature from a signer on any document in such a way that, the authority learns nothing about the message that is being signed. Due to the blindness and untraceability properties of Blind Signature Scheme, it can be used in cryptographic applications such as web based e-voting, digital cash etc. In this paper, a novel blind signature scheme based on Elliptic Curve Discrete Logarithm Problem has been proposed. The model has been explained using a customer-and-bank example and the proof of correctness has been made.
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.
TELKOMNIKA Telecommunication Computing Electronics and Control, 2019
One of the important objectives of information security systems is providing authentication of the electronic documents and messages. In that, blind signature schemes are an important solution to protect the privacy of users in security electronic transactions by highlighting the anonymity of participating parties. Many studies have focused on blind signature schemes, however, most of the studied schemes are based on single computationally difficult problem. Also, digital signature schemes from two difficult problems were proposed but the fact is that only finding solution to single hard problem then these digital signature schemes are breakable. In this paper, we propose a new signature schemes base on the combination of the RSA and Schnorr signature schemes which are based on two hard problems: IFP and DLP. Then expanding to propose a single blind signature scheme, a blind multi-signature scheme, which are based on new baseline schemes.
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.
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.
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...
Bulletin of Electrical Engineering and Informatics, 2012
Digital proxy multi-signature and blind signature scheme are found very electronic voting and electronic cash transaction. In delegate their signing power to a proxy signer in such a way that the proxy signer can sign any message on behalf of original signers. In blind signature signature and the identity of the requester. Proxy blind signature and blind signature. In this paper, we propose a new proxy blind multi on integer factorization problem (IFP) and discrete logarithm problem (DLP) to It satisfies the security properties of both the blind
International Journal of Innovation, Management and Technology, 2014
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.