Blind Signature Research Articles

Quantum blind signature scheme for supply chain financial

Quantum blind signature scheme for supply chain financial

A Novel e-Cash Payment System with Divisibility Based on Proxy Blind Signature in Web of Things

A Novel e-Cash Payment System with Divisibility Based on Proxy Blind Signature in Web of Things

Quantum multi-proxy strong blind signature based on block blind coding

Quantum multi-proxy strong blind signature based on block blind coding

RESAT: A Utility-Aware Incentive Mechanism-Based Distributed Spatial Cloaking

Distributed spatial cloaking (DSC) enables users to enjoy precise location-based service (LBS) with location privacy preserving. An incentive mechanism is necessary to encourage users to cooperate. However, due to the inappropriate design of incentive mechanisms, the existing works cause low user benefits and fail to encourage users, ruining the expected incentive effect. Moreover, introducing a third party to manage users’ information also causes the existing works to disclose users’ privacy and be unpractical. To address these issues, we propose a utility-aware incentive mechanism-based distributed spatial cloaking (RESAT). By the idea of utility theory and optimization theory, RESAT devises basic and extended incentive mechanisms. The two mechanisms for assuming that all users are honest and that malicious users provide unreasonable locations. RESAT proposes an incentive mechanism-based cloaking cooperation without a third party, incorporating the developed mechanisms based on the blind signature. Theoretical analysis indicates that RESAT achieves incentive compatibility and is secure. Extensive experiments on the real data set show that compared with the existing works, RESAT enables 1 time more users to cooperate at best while eliminating the malicious behaviors that provide unreasonable locations. The required DSC construction time delay is limited.

Efficient and secure e‐voting scheme using elliptic curve cryptography

AbstractVoting allows the people to elect their representative and express their preferences. In modern day democracy, voting is one fundamental and most important tool for election. To strengthen this process, efforts must be made to achieve a confirmable and transparent voting system. Naturally, the veracity of the election process is of ultimate importance for the honor of the democracy itself. The online voting or e‐voting system is a cost‐effective procedure, which saves a lot of money and time spent for organizing the election. However, security, integrity of data and privacy of the voter are the increasing concerns in this context. In this paper, we have done a thorough literature survey of the various latest schemes in this context and found that the schemes prone to several security and privacy threats. Moreover, a major issue with all these schemes is that they are inefficient in terms of computation and communication overheads. With this motivation, we present a novel and efficient e‐voting scheme to tackle the security and privacy concerns. The proposed scheme is designed using the concept of blind signature, anonymous channel and trust worthy entities where elliptic curve cryptography (ECC) works as a backbone. The proposed scheme is formally evaluated using well known AVISPA simulation tool, which simulates the attack model using CL‐AtSe as well as OFMC backend according to Dolev‐Yao threat model. In both the cases, all the possible security threats are being nullified by the proposed scheme and results in safe communication. Also, the scheme is analyzed against all the possible attacks that jeopardize the integrity of the existing voting systems. Moreover, the proposed scheme is also compared with other prevailing schemes in terms of computation and communication overheads and found more efficient.

Pairing-free certificateless blind signature scheme for smart grid

The smart grid is an emerging power system that can realize the information exchange between users and power companies in two-way communication and adjust power companies’ power supply according to the real-time power requests from smart meters on the users’ side. However, since malicious attackers can eavesdrop on two-way communication to collect and transmit information, they may leak users’ information. Therefore, this paper proposes a new certificateless blind signature (CLBS) scheme with batch verification function and improves a power request system model for the smart grid to protect users’ privacy. In addition, the proposed CLBS scheme simplifies the certificate management process in the traditional public key cryptosystem and eliminates the hidden key escrow in the identity-based public key cryptosystem. The unforgeability of the scheme is proved through the random oracle model, and the scheme’s security can be reduced to the intractability of the elliptic curve discrete logarithm problem (ECDLP). The analysis results show that our scheme does not use the time-consuming bilinear pairing operation, and has obvious advantages in computing performance compared with the existing signature schemes.

Adopting EVS as Solution to Nigeria Election using Novel Proxy, Oblivious and Blind Signature

Adopting EVS as Solution to Nigeria Election using Novel Proxy, Oblivious and Blind Signature

A Distributed Model for Privacy Preserving V2I Communication with Strong Unframeability and Efficient Revocation

Although Vehicle to Infrastructure (V2I) communications greatly improve the efficiency of early warning systems for car safety, communication privacy is an important concern. Although solutions exist in the literature for privacy preserving VANET communications, they usually require high trust assumptions for a single authority. In this paper we propose a distributed trust model for privacy preserving V2I communications. Trust is distributed among a certification authority that issues the vehicles’ credentials, and a signing authority that anonymously authenticates V2I messages in a zero knowledge manner. Anonymity is based on bilinear pairings and partially blind signatures. In addition, our system supports enhanced conditional privacy since both authorities and the relevant RSU need to collaborate to trace a message back to a vehicle, while efficient certificateless revocation is supported. Moreover, our scheme provides strong unframeability for honest vehicles. Even if all the entities collude, it is not possible to frame a honest vehicle, by tracing a forged message back to an honest vehicle. The proposed scheme concurrently achieves conditional privacy and strong unframeabilty for vehicles, without assuming a fully trusted authority. Our evaluation results show that the system allows RSUs to efficiently handle multiple messages per second, which suffices for real world implementations.

A New Lattice-Based Blind Ring Signature for Completely Anonymous Blockchain Transaction Systems

Blockchain technology has been widely applied in numerous industries with its decentralization, verifiability, distributivity, and immutability. However, the identity privacy security of blockchain users is facing serious threats because of the openness of traditional blockchain transaction information. Moreover, numerous traditional cryptographic algorithms used by blockchain transaction networks are difficult to attack quantum computing. In this paper, we propose a new lattice-based blind ring signature scheme in allusion to completely anonymous blockchain transaction systems. There into, the blind ring signature can implement the complete anonymity of user identity privacy in blockchain transactions. Meanwhile, lattice cryptography can availably resist quantum computing attacks. Firstly, the proposed signature scheme has strong computational security based on the small integer solution (SIS) problem and a high sampling success rate by utilizing the techniques of rejection sampling from bimodal Gaussian distribution. Secondly, the proposed signature scheme can satisfy the correctness and security under the random oracle model, including anonymity, blindness, and one-more unforgeability. Thirdly, we construct a blockchain transaction system based on the proposed blind ring signature algorithm, which realizes the completely anonymous and antiquantum computing security of the blockchain users’ identity privacy. Finally, the performance evaluation results show that our proposed blind ring signature scheme has lower latency, smaller key size, and signature size than other similar schemes.

AI-Driven Blind Signature Classification for IoT Connectivity: A Deep Learning Approach

Non-orthogonal multiple access (NOMA) promises to fulfill the fast-growing connectivities in future Internet of Things (IoT) using abundant multiple-access signatures. While explicitly notifying the utilized NOMA signatures causes large signaling cost, blind signature classification naturally becomes a low-cost option. To accomplish signature classification for NOMA, we study both likelihood- and feature-based methods. A likelihood-based method is firstly proposed and showed to be optimal in the asymptotic limit of the observations, despite high computational complexity. While feature-based classification methods promise low complexity, efficient features are non-trivial to be manually designed. To this end, we resort to artificial intelligence (AI) for deep learning-based automatic feature extraction. Specifically, our proposed deep neural network for signature classification, namely DeepClassifier, establishes on the insights gained from the likelihood-based method, which contains two stages to respectively deal with a single observation and aggregate the classification results of an observation sequence. The first stage utilizes an iterative structure where each layer employs a memory-extended network to explicitly exploit the knowledge of signature pool. The second stage incorporates the straight-through channels within a deep recurrent structure to avoid information loss of previous observations. Experiments show that DeepClassifier approaches the optimal likelihood-based method with a reduction of 90% complexity.

A New Secure Crowdfunding Transaction Scheme Based on Blockchain

Online crowdfunding, an innovative model based on “[Formula: see text]”, is a hot spot for financing via Internet. Crowdfunding based on blockchain is an emerging economic phenomenon and becomes one of the most advanced risk financing strategies. However, crowdfunding transactions face security threats due to identity leaks, quantum attacks and the untraceable nature of blind signatures, which facilitate criminal activity. Different from the previous works, which ignored the importance of traceability, in this paper, we establish a blockchain-empowered secure crowdfunding architecture and propose an anti-quantum partially blind signature algorithm based on the verifiable identity of both sides. Specially, for one thing, the private key decided by user identity is generated by lattice-based sample matrix, and the privacy of user identity can be ensured and traced by the rejection sampling theorem. For another thing, we design an improved krill herd algorithm (IKHA) to increase the credit factor of fundraisers for dealing with project investment issues. The simulation evaluates the correctness and effectiveness of our theoretical analyses. Compared with the current popular schemes, the proposed IKH algorithm has a higher convergence speed and can optimize investment efficiency.

Multiple Blind Signature for e-Voting and e-Cash

Abstract In this paper, we propose a new cryptographic primitive, called multiple blind signature (MBS), which is designed based on the integration of both normal blind signature scheme and dual signature. The major difference between a normal blind signature and an MBS is that using a normal blind signature, only one message, $m$, can be verified, but using an MBS, any subset, ${M}^{\prime }$, of multiple messages in a set, $M$, where ${M}^{\prime}{\subseteq} M$, can be verified. With this additional property, we will show that MBS is especially suitable for e-voting and e-cash applications. In other words, we classify these processes in two applications into two phases, on-line and off-line phases. One unique property of this design is that most time-consuming computation and interaction can be performed in advance in off-line phase. There is no cost of computation and interaction in the online phase.

Lafora Disease and Alpha-Synucleinopathy in Two Adult Free-Ranging Moose (Alces alces) Presenting with Signs of Blindness and Circling.

Simple SummaryReports of behavioral signs, such as blindness and circling in free-ranging moose from different parts of the world, have spurred comprehensive pathological investigation to find the causes of the disease that have clinical relevance. In this case study, brains collected from two adult free-ranging moose (Alces alces) cows that were seemingly blind and found walking in circles were examined by light and electron microscopy with further ancillary testing. Here, we report for the first time Lafora disease and alpha-synucleinopathy in two wild free-ranging moose cows who presented with abnormal behavior and blindness, with similar neuronal polyglucosan body (PGB) accumulations identified in humans and other animals. Microscopic analysis of the hippocampus of brain revealed inclusion bodies resembling PGBs (Lafora disease) in the neurons with ultrastructural findings of aggregates of branching filaments, consistent with polyglucosan bodies. Furthermore, α-synuclein immunopositivity was noted in the hippocampus, with accumulations of small granules ultrastructurally distinct from PGBs and morphologically compatible with alpha-synucleinopathy (Lewy body). The apparent blindness found in these moose could be related to an injury associated with secondary bacterial invasion; however, an accumulation of neurotoxicants (PGBs and α-synucleins) in retinal ganglion cells could also be the cause. Lafora disease and alpha-synucleinopathy were considered in the differential diagnosis of the young adult moose who presented with signs of blindness and behavioral signs such as circling.Lafora disease is an autosomal recessive glycogen-storage disorder resulting from an accumulation of toxic polyglucosan bodies (PGBs) in the central nervous system, which causes behavioral and neurologic symptoms in humans and other animals. In this case study, brains collected from two young adult free-ranging moose (Alces alces) cows that were seemingly blind and found walking in circles were examined by light and electron microscopy. Microscopic analysis of the hippocampus of the brain revealed inclusion bodies resembling PGBs in the neuronal perikaryon, neuronal processes, and neuropil. These round inclusions measuring up to 30 microns in diameter were predominantly confined to the hippocampus region of the brain in both animals. The inclusions tested α-synuclein-negative by immunohistochemistry, α-synuclein-positive with PAS, GMS, and Bielschowsky’s staining; and diastase-resistant with central basophilic cores and faintly radiating peripheral lines. Ultrastructural examination of the affected areas of the hippocampus showed non-membrane-bound aggregates of asymmetrically branching filaments that bifurcated regularly, consistent with PGBs in both animals. Additionally, α-synuclein immunopositivity was noted in the different regions of the hippocampus with accumulations of small granules ultrastructurally distinct from PGBs and morphologically compatible with alpha-synucleinopathy (Lewy body). The apparent blindness found in these moose could be related to an injury associated with secondary bacterial invasion; however, an accumulation of neurotoxicants (PGBs and α-synuclein) in retinal ganglions cells could also be the cause. This is the first report demonstrating Lafora disease with concurrent alpha-synucleinopathy (Lewy body neuropathy) in a non-domesticated animal.

Decentralization of E voting based on Blind Signature and Smart Contract

Traditional voting systems like ballot voting or voting using EVMs (electronic voting machines) basically rely on paper and other human resources during the voting phase, which is time consuming as well as costly. The elections generally have a central system, where an organization looks after the election and manages it. The problem here is that the election is handled by a single organization that has full control. In this work-in-progress paper, we suggest a decentralized application based on blockchain technology and smart contracts that supports e-voting systems. To implement distributed electronic voting systems we propose using a blockchain technology. The paper proposes a unique electronic voting system backed by blockchain that addresses restrictions in existing systems and recommends the favoured blockchain frameworks for building a decentralized e-voting web application. The E-voting system is secure, transparent, protects the privacy of the voters and also, does not allow duplicate votes.

A quantum partially blind signature scheme without entanglement

In a quantum partially blind signature (QPBS) scheme, the contradiction between anonymity and controllability of completely blind signature (BS) schemes was better solved by adding common negotiated public information between the signer and the requester (the message holder). After reviewing the proposed scheme, we give an analysis about it and then propose a novel QPBS scheme without entanglement. The security without preconditions of this signature scheme is ensured by the secure quantum key distribution (QKD) protocol and quantum one-time pad (QOTP). Furthermore, in the process of security analysis, it proves that our scheme satisfies the foundational attribution of partially blind signature (PBS). Moreover, the scheme can solve the problem we put forward so as to allow it to have a wider application in the future.

RBSmix: A Regulatable Privacy-Preserving Method for Cryptocurrency

Public chains represented by Bitcoin and Ethereum do not require users to use their real names, and transaction data are open to the whole network. Analysed based on this, researchers have achieved the deanonymization of blockchain transactions to a certain extent. Based on the existing blockchain transaction privacy protection scheme, the true link relationship between the transaction sender and receiver is hidden, which brings difficulties to regulation. In this paper, we propose a cryptocurrency mixing service RBSmix, which allows users to reestablish their financial privacy in Bitcoin and related cryptocurrencies. RBSmix, through blind signature to prevent attackers from linking input and output addresses, by the threshold secret sharing algorithm, encryption technology, and a regulation team, combined with the idea of voting, tracks the source of funds for illegal addresses. Experiments show that the scheme scales to large numbers of users and can provide users with better privacy protection.

Image encryption scheme based on blind signature and an improved Lorenz system

In this paper, a new improved Lorenz system (ImproLS) is designed with a better behavior due to a larger positive Lyapunov exponent. Then, an asymmetric image encryption scheme is presented based on blind signature and the ImproLS. First, the sender uses the public key from the receiver to produce the cipher keys in conjunction with the Rivest–Shamir–Adleman (RSA) algorithm. Then, a new mathematical model is established to convert both the plain keys and the cipher keys to generate the initial values for ImproLS. After doing preprocess to the secret plain image, its statistical characteristics is changed greatly. Then, by employing permutation and diffusion operations, the cipher image can be obtained and sent to the receiver and the signer. Second, the signer encrypts the digital signature image using Arnold transform in conjunction with the RSA algorithm, and applies the discrete wavelet transform (DWT) to the cipher image. The scrambled signature image is then embedded into the wavelet domain of cipher image blindly. Then, the cipher image containing signature is sent to the receiver for authentication. Third, the receiver uses the private key to check the signature and recover the cipher image. After comparing the decrypted images from both the sender and the signer, the receiver can judge the source of the secret plain image. Experimental results show that the information entropy is high and closer to the theoretical value. In addition, both unsigned and signed cipher images can effectively resist salt and pepper attack, and clipping attack.

A Privacy-Aware Electricity Consumption Data Collection Model Based on Group Blind Signature

Blockchain gives a new method for distributed data ledgering. The smart grid obtains efficient two-way data transmission and information control. It effectively monitors and regulates the grid by collecting real-time electricity consumption data of users. However, online data collection brings privacy leakage. To solve the problem of privacy leakage in the electricity data collection in the smart grid, a privacy-aware electricity data collection model is proposed. Firstly, we propose a new group blind signature scheme by introducing the blind feature into the identity-based encryption method. Secondly, by applying the proposed group blind signature scheme to the electricity data collection process, we propose a privacy-aware electricity data collection model. The proposed model ensures the conditional anonymity and traceability of user identity and the privacy protection and unforgeability of electricity consumption data.

High fidelity quantum blind dual-signature protocols

This work proposes two kinds of fault tolerant quantum blind dual-signature (QBDS) protocols with photon quartets, which are robust against the collective-dephasing noise and collective-rotation noise, respectively. In the protocols, the initial information needs to be signed by the message owner in addition to the signer, which will be well suitable for application in some E-payment and E-government systems that require the message owner to provide authentication information. Both QBDS protocols are constructed with logical qubits which are immune to the collective noise, thereby the protocols can provide higher communication fidelity with respect to the existing quantum signature protocols. Furthermore, the protocols had been proved to be secure against some individual eavesdropping attacks. Meanwhile, the protocols satisfy the characteristics of quantum blind signature (QBS) protocols such as unforgeability, undeniability and blindness.

Investigation of E-voting system using face recognition using convolutional neural network (CNN)

An Election is a method of selection of individuals to hold the public office in democracy. Ballot is basically a piece of paper that is used to cast vote during election. In ballot paper voting system each voter uses a ballot paper which is not shared and basically it is a paper printed with the name and symbols of the candidates. The Electronic Voting Machine is basically a memory recorder which records the vote casted by the voters. In this paper, main advantages of E-voting systems for country is highlighted. For constructing E-voting systems, every countries need to do great attention to Verification and Validation requirements. In this research, E-voting scheme with face recognition using deep learning technique is proposed. The process of casting vote is accomplished by blockchain technology and blind signature mechanism. The main objective of the proposed scheme is to explore the positive effects of security and safety in online voting system.