Untraceable Blind Multisignature
Ankit Kumar Namdeo2015
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Multisignature is a variant of digital signature which enables a document to be signed by multiple signers simultaneously in a collaboration. It ensures the fairness property of the signer. Blind signature is another variant of digital signature in which a message is signed without disclosing its content. Blindness is an important property of blind signature in which, the message and the signature are unlinkable after signature is attached to the message.In this Thesis, we designed a Blind Multisignature protocol with security features of blind signatures and multisignature. The security of the scheme lies in hard computational assumptions such as Integer Factorization problem (IFP), computational Diffie-Hellman problem (CDHP) and discrete logarithmic problem (DLP). The correctness of the scheme is tested mathematically and the scheme is also implemented in Java platform. The computational cost of the proposed scheme is low and the signature length (in byte) is nominal with the mess...
Related papers
Blind multi-signature scheme based on factoring and discrete logarithm problem
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.
32 A Proxy to Proxy Blind Multi-Signature Scheme based
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.
Discussion on New Blind Signature Protocols Based on a New Hard Problem
2018
This report will discuss on an idea proposed in a journal which published on 2017, which covered within blind signature protocol domain. In that journal, authors covered the fundamental behind blind signature protocol, history of creation, the challenges on current practices and proposing 3 new algorithms to overcome on current challenges. Original journal accessible at https://pdfs.semanticscholar.org/d3f7/9ff8af49542adb72864981c0fe2a757f28bb.pdf
A New Design Partially Blind Signature Scheme Based On Two Hard Mathematical Problems
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...
Short blind signatures
Journal of Computer Security, 2013
Blind signatures allow users to obtain signatures on messages hidden from the signer; moreover, the signer cannot link the resulting message/signature pair to the signing session. This paper presents blind signature schemes, in which the number of interactions between the user and the signer is minimal and whose blind signatures are short. Our schemes are defined over bilinear groups and are proved secure in the common-reference-string model without random oracles and under standard assumptions: CDH and the decision-linear assumption. (We also give variants over asymmetric groups based on similar assumptions.) The blind signatures are Waters signatures, which consist of 2 group elements. Moreover, we instantiate partially blind signatures, where the message consists of a part hidden from the signer and a commonly known public part, and schemes achieving perfect blindness. We propose new variants of blind signatures, such as signer-friendly partially blind signatures, where the public part can be chosen by the signer without prior agreement, 3-party blind signatures, as well as blind signatures on multiple aggregated messages provided by independent sources. We also extend Waters signatures to non-binary alphabets by proving a new result on the underlying hash function.
A new blind signature for electronic commerce
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.
A New Partially Blind Signature Based on Factoring and Discrete Logarithms
Journal of Mathematics and Statistics, 2008
Partially blind signatures played an important role in many electronic commerce applications. Many existing partially blind signature scheme based on a single hard problem but not secure. In this study, we propose a secure partially blind signature scheme based on factoring and discrete logarithms and show that the proposed scheme satisfies the partial blindness, randomization, unlinkability and unforgeability properties. We also analyse the computation cost of the proposed scheme.
Identity-Based Blind Signature Scheme with Message Recovery
International Journal of Electrical and Computer Engineering (IJECE), 2017
Blind signature allows a user to obtain a signature on a message without revealing anything about the message to the signer. Blind signatures play an important role in many real world applications such as e-voting, e-cash system where anonymity is of great concern. Due to the rapid growth in popularity of both wireless communications and mobile devices, the design of secure schemes with low-bandwidth capability is an important research issue. In this paper, we present a new blind signature scheme with message recovery in the ID-based setting using bilinear pairings over elliptic curves. The proposed scheme is unforgeable with the assumption that the Computational Diffie-Hellman problem is hard. We compare our scheme with the related schemes in terms of computational and communicational point of view.
Fair Blind Signatures
Lecture Notes in Computer Science, 1995
A blind signature scheme is a protocol for obtaining a signature from a signer such that the signer's view of the protocol cannot be linked to the resulting message-signature pair. Blind signature schemes are used in anonymous digital payment systems. Since the existing proposals of blind signature schemes provide perfect unlinkability, such payment systems could be misused by criminals, e.g. to safely obtain a ransom or to launder money. In this paper, a new type of blind signature schemes called fair blind signature schemes is proposed. Such schemes have the additional property that a trusted entity can deliver information allowing the signer to link his view of the protocol and the message-signature pair. T w o types of fair blind signature schemes are distinguished and several realizations are presented.
Security Analysis of Proxy Blind Signature Scheme Based on Factoring and 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.
Related topics
Related papers
Implementation of an Efficient Blind Signature Scheme
International Journal of Innovation, Management and Technology, 2014
New Proxy Blind Multi Signature based on Integer-Factorization and Discrete-Logarithm Problems
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
Blind Digital Signatures: Theory and Applications
2023
Blind digital signature schemes allow for digital documents to be signed and verified without revealing the contents of the document to the signer. This paper provides a brief introduction to blind digital signatures and surveys several of their uses in data privacy applications, including e-voting, anonymous e-cash, and e-healthcare. For concreteness, RSA-based signatures are considered in some detail.
New Blind Muti-signature Schemes based on ECDLP
International Journal of Electrical and Computer Engineering (IJECE)
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.
BLIND SIGNATURE SCHEME BASED ON DISCRETE LOGARITHM PROBLEM
Электромагнитные волны и электронные системы 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 .
A New Proxy Blind Signature Scheme based on ECDLP
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
An Efficient Scheme for Sensitive Message Transmission using Blind Signcryption
Arxiv preprint cs/0504095, 2005
An Efficient Pairing-Free Identity Based Proxy Blind Signature Scheme with Message Recovery
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
VARIANTS OF BLIND SIGNATURES -A PRACTICAL AUTHENTICATION SCHEME
Blind signature is a variant of digital signature which helps the user to obtain a signature without giving any information about the message to the signer and the signer cannot tell which session of the signing protocol corresponds to which message. Blind signatures may seem to be a myth; it is a practical reality due to its wide applications in real life like e-coin and e-voting. This paper focuses on the study of variants of blind signatures with its eminent real world applications. It also discuses about future research scope of blind signatures.
Cryptanalysis of Blind Signature Schemes
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].
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.