Blind Signature Scheme Research Articles

Identity-Based Partially Blind Signature Scheme: Cryptanalysis and Construction

Blind signature is a special type of digital signature, the signer cannot see the specific content signed. However, blindness may cause users to abuse their rights. Partial blind signature allows the signer to embed pre-negotiated public information in the blind signature without losing blindness, which can prevent users from abusing their rights. Islam et al. presented an identity-based partial blind signature scheme and claimed that it is provable secure. However, in this paper we proved that the scheme is vulnerable against the tampering attacks with public information. We then proposed a new identity-based partial blind signature scheme, showed the security proofs under the assumption that the elliptic curve discrete logarithm problem (ECDLP) is difficult. The new scheme does not use pairing operations and enjoys less computation cost.

Secure Identity-Based Blind Signature Scheme for Online Transactions

Today, more and more business activities are done through online transactions. How to protect the personal privacy of customers in online transactions has become an urgent issue. Blind signature (BS) is suitable for online transactions because it can hide the specific content of the signed message. The security proofs of most BS schemes are given in the random oracle model (ROM). As we all know, the cryptographic scheme that is proven to be secure in ROM may be insecure in practical applications. In this paper, we fist study the security requirements for identity-based BS (IBBS) scheme, then design a concrete IBBS scheme and show the security proofs in the standard model. Finally, we compare the proposed scheme with the other two BS schemes. Requiring only three pairing operations, the proposed scheme is much efficient and is suitable for online transactions.

An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems

Blockchain technology has a tendency to make revolutionary changes for all walks of life with its public, distributed, decentration and unforgeable characteristics. However, with the rapid development of the quantum computer, many extant cryptographic algorithms applied in blockchain-enabled systems are vulnerable to the quantum attacks. In this paper, an anti-quantum blind signature scheme based on the lattice assumption has been proposed. As lattice cryptography is the main candidate algorithm in post-quantum cryptosystems and the blind signature scheme is widely used in e-cash and voting for creating untraceable payment system, which are more suitable for privacy preserving in blockchain-enabled systems. In the proposed scheme, the bimodal Gaussian distribution, Reject sampling and other technologies have been used to improve the security and efficiency. Then, the proposed blind signature can satisfy the properties of blindness and one-more unforgeability, and it also can prove to be safe in the random oracle model. Moreover, the efficiency analysis and comparison results show that the proposed scheme is more efficient than the similar literatures and has a more stabilized signature size than other cryptosystems.

Quantum Blind Signature Scheme Based on Quantum Walk

Quantum walks have been widely used in quantum computing and quantum simulation, and can be applied for quantum teleportation. In this paper, a quantum blind signature scheme with quantum walk-based teleportation is proposed. The sender Alice encodes the message into quantum states and divides the encrypted information into two qubit strings. Alice teleports them separately to the signer Charlie and the verifier Bob by quantum walks. Charlie accepts Alice’s request and uses Pauli operation to generate the quantum blind signatures, then sends the signatures to Bob. Bob measures two quantum messages in hands to complete verification of Charlie’s signature. In this protocol, the messages to be signed are ingeniously blinded and prepared in single particle states, the teleportation of particle states is achieved by quantum walks. Security analysis shows that the scheme can not only resist the repudiation of the signer and denial of the verifier, but also detect the forgery of the attacker, which can be widely applied in e-commerce or e-payment system.

An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

A Secure End-to-End Verifiable Internet-Voting System Using Identity-Based Blind Signature

The end-to-end (E2E) verification enables a voter to check if his ballot is recorded as he intended and the public to check if the system has correctly counted all of the recorded ballots. The Internet voting systems based on the principle of E2E verifiability have many challenges; the most important is its security. Several E2E voting systems have been discussed in the last decade in terms of analyzing the e-voting system and formalizing its security requirements. This article presents an E2E verifiable internet voting system that provides mobility to a voter and allows him to cast his vote secretly in public computer with the benefit of early voting. The proposed system aims to support the election process universally by using the voter's unique identification and biometric features. We propose a new identity-based blind signature scheme that ensures the voter's anonymity. We adopt the Boneh–Lynn–Shacham short signature scheme that ensures the vote privacy with the least ballot size. The system provides a digital witness to a voter that enables him to check whether his vote is recorded as he meant and the public to check if all the recorded ballots are counted correctly. The privacy of the proposed system is achieved under the well-known elliptic curve discrete logarithm and gap Diffie–Hellman assumptions.

A Quantum Proxy Blind Signature Scheme Based on Superdense Coding

In this paper, we show a new quantum proxy blind signature scheme based on single particle superdense coding. We only need perform unitary operator on single qubit to blind 2-bit classical information. The scheme also satisfies the properties of blindness, unforgeability and undeniability. It has a wide application to e-payment, e-voting, e-government, and etc.

A New Efficient Blind Quantum Signature Scheme Based on Entanglement Swapping

According to the principle of quantum entanglement swapping of GHZ states, this paper put forward a blind signature scheme based on quantum entanglement. Without performing any unitary operation, all participants just need to do Bell measurements on new entangled particles emerging from entanglement swapping of GHZ states to complete blind signature and verification. It is not difficult to prove that the proposed scheme processes the features of nonforgeability, non-disavowal and blindness. Furthermore, compared to some other blind signature schemes on entangled states, our scheme is more efficient because except a few decoy particles, only 2 GHZ states are required for signing each 3 bits in the message.

An Efficient and Provably Secure Certificateless Blind Signature Scheme for Flying Ad-Hoc Network Based on Multi-Access Edge Computing

Unmanned aerial vehicles (UAVs), when interconnected in a multi-hop ad-hoc fashion, or as a flying ad-hoc network (FANET), can efficiently accomplish mission-critical tasks. However, UAVs usually suffer from the issues of shorter lifespan and limited computational resources. Therefore, the existing security approaches, being fragile, are not capable of countering the attacks, whether known or unknown. Such a security lapse can result in a debilitated FANET system. In order to cope up with such attacks, various efficient signature schemes have been proposed. Unfortunately, none of the solutions work effectively because of incurred computational and communication costs. We aimed to resolve such issues by proposing a blind signature scheme in a certificateless setting. The scheme does not require public-key certificates, nor does it suffer from the key escrow problem. Moreover, the data that are aggregated from the platform that monitors the UAVs might be too huge to be processed by the same UAVs engaged in the monitoring task. Due to being latency-sensitive, it demands high computational capability. Luckily, the envisioned fifth generation (5G) mobile communication introduces multi-access edge computing (MEC) in its architecture. MEC, when incorporated in a UAV environment, in our proposed model, divides the workload between UAVs and the on-board microcomputer. Thus, our proposed model extends FANET to the 5G mobile network and enables a secure communication between UAVs and the base station (BS).

Security Analysis of Particular Quantum Proxy Blind Signature Against the Forgery Attack

As an important topic of quantum cryptography, quantum proxy blind signature has attracted more and more attentions in recent years. However, with our analysis, it can be seen that there exists a common security loophole in two particular quantum proxy blind signature schemes, i.e., the receiver can forge a valid signature without being caught by others. In order to show that, the detailed attack strategy and the potential improved ideas are proposed in this paper.

A Multivariate Blind Ring Signature Scheme

Abstract Blind signatures are an important and useful tool in designing digital cash schemes and electronic voting protocols. Ring signatures on the other hand provide the anonymity of the signer within the ring of users. In order to fit to some real-life applications, it is useful to combine both protocols to create a blind ring signature scheme, which utilizes all of their features. In this paper, we propose, for the first time, a post-quantum blind ring signature scheme. Our scheme is constructed based on multivariate public key cryptography, which is one of the main candidates for post-quantum cryptography.

Identity based blind signature scheme over NTRU lattices

Blind signatures are very crucial and important part of digital signatures. Zhu et al. proposed an identity based blind signature scheme based on NTRU (nth degree Truncated polynomials Ring Unit) lattices. They claimed that their scheme is secure in the random oracle model. In this paper, we underlined a security flaw in that scheme and proposed an alternative identity based blind signature scheme over NTRU lattices.

Leakage‐resilient lattice‐based partially blind signatures

Blind signature schemes (BSS) play a pivotal role in privacy-oriented cryptography. However, with BSS, the signed message remains unintelligible to the signer, giving them no guarantee that the blinded message he signed actually contained valid information. Partially BSS (PBSS) were introduced to address precisely this problem. In this study, the authors present the first leakage-resilient, lattice-based PBSS in the literature. The proposed construction is provably secure in the random oracle model and offers quasi-linear complexity w.r.t. key/signature sizes and signing speed. In addition, it offers statistical partial blindness and its unforgeability is based on the computational hardness of worst-case ideal lattice problems for approximation factors in O ~ ( n 4 ) in dimension n. The proposed scheme benefits from the subexponential hardness of ideal lattice problems and remains secure even if a ( 1 − o ( 1 ) ) fraction of the signer's secret key leaks to an adversary via arbitrary side-channels. Several extensions of the security model, such as honest-user unforgeability and selective failure blindness, are also considered and concrete parameters for instantiation are proposed.

A practical group blind signature scheme for privacy protection in smart grid

The leakage of privacy is one of the key factors to restrict the development of smart grid. Currently, research works of protecting privacy in smart grid mainly focused on two aspects: (1) data aggregation based on the mathematical model and algorithm and (2) user anonymous authentication. However, data aggregation is at cost of obtaining fine-grained electricity consumption information to protect privacy. Anonymous authentication cannot identify the malicious user in previous studies. Hence, in this work, we propose a group blind signature scheme in smart grid to accomplish conditional anonymity. Furthermore, the integrity of consumption data can be verified by homomorphic encryption (HE) which can decrease the communication overhead between control center and smart meter remarkably. From the security analysis and experiment simulation, the results show that our scheme is safe and efficient.

Blind multi-signature scheme based on factoring and discrete logarithm problem

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.

Lockmix: a secure and privacy-preserving mix service for Bitcoin anonymity

Bitcoin has attracted considerable attention from governments, banks, as well as researchers. However, Bitcoin is not a completely anonymous system. All transaction information in the Bitcoin system is published on the network and can be used to reveal the identity of the user by transaction correlation analysis. In this paper, a secure and privacy-preserving mix service for Bitcoin anonymity, Lockmix, is proposed. Lockmix introduces mix servers to provide a mix service for the user by using blind signature and multi-signature schemes to prevent attackers from linking the input address with the output address. Lockmix provides anonymity, scalability, accountability, Bitcoin compatibility and anti-theft. Lockmix has been implemented on a Bitcoin test network, and experiments show that our solution is efficient.

Password-based Selective Linkable Convertible Ring Blind Signature

Ring signature has become an important way of privacy protection because of its anonymity and the spontaneity of ring members. It has been widely used in the field of information security. Password-based alternative linkable convertible ring blind signature scheme combines the advantages of strong anonymity of ring signature and blindness of blind signature to signature message, and adds the optional linkable and convertible characteristics, which makes it more secure than other schemes, and can also transform ring signature into ordinary signature in special occasions. At the same time, under the random oracle model, the scheme satisfies the unforgeability under the adaptive selection message attack. Performance analysis shows that the scheme has high operating efficiency.

PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System

PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System

A Quantum Blind Signature Scheme Based on Block Encryption and Quantum Fourier Transfer

Motivated by the block encryption and quantum Fourier transfer, a quantum blind signature scheme is proposed. Alice encodes the original message into three pairs of hybrid entangled states, which are distributed among three parties of communication. The measurement result of entangled pairs serves as the blind message of Alice and signature of Charlie, the verifier Bob recovers the message and verifies the signature. The information is delivered after being encoded into multi-dimensional quantum states and encrypted by quantum Fourier transforms. The analysis shows that the scheme is non-forgery, non-repudiation and blindness. In addition, the proposed scheme is more efficient against the universal and selective forgery attacks.

A Novel Quantum Broadcasting Multiple Blind Signature Scheme Based on Multi-Particle Partial Entanglement

Recently, a quantum broadcasting multiple blind signature scheme has been proposed by using GHZ entanglement, which is claimed to have foreseeable application in E-bank system. However, its security is promised by the utilized hash function. In this paper, we have designed a novel quantum broadcasting multiple blind signature scheme by utilizing a three-particle partial entanglement state. In existed quantum broadcasting multiple blind signature schemes, the collector Charlie has to verify the individual signatures before aggregating them into a multi-signature. In this new scheme, Charlie is only acting as a signature collector. Specifically, Charlie only needs to collect all the individual signatures and aggregating them into a multi-signature, which indicates that Charlie has no need to verify the individual signature any more. All the verification are executed by the receiver Bob himself. Meanwhile, the signature is generated by quantum entanglement swapping rather than using hash function, which make its security is only based on quantum physics. It is showed that multi-particle partially entangled state can be efficiently used as a resource in quantum information processing with perfect performance.