The ring signature allows a signer to leak secrets anonymously, without the risk of identity escrow. At the same time, the ring signature provides great flexibility: No group manager, no special setup, and the dynamics of group choice. The ring signature is, however, vulnerable to malicious or irresponsible signers in some applications, because of its anonymity. In this paper, we propose a trac...

A ring signature (RS) scheme enables a group member to sign messages on behalf of its without revealing the definite signer identify, but this also leads abuse anonymity by malicious signers, which can be prevented traceable signatures (TRS). Up until that point, have been secure based difficult problem number-theoretic (discrete logarithms or RSA), since advent quantum computers, traditional m...

As the next-generation power grid system, smart can realize balance of supply and demand help in communication security privacy protection. However, real-time consumption data collection might expose users’ information, such as their living habits economic conditions. In addition, during process transmission, it may lead to inconsistency between user side storage side. Blockchain provides tampe...

We propose a simple, general, and unified framework for constructing unique ring signaturesthat simplify and capture the spirit of linkable ring signatures. The framework, which can beefficiently instantiated in the random oracle and the standard model, is obtained by generalizingthe Bellare-Goldwasser “PRF made public” paradigm. Security of the first instantiation can betightly...

In this paper, we introduce an efficient anonymous authentication protocol in Vehicular Ad-hoc Networks (VANETs) [5] to resolve the issue on anonymous authentication for communication between roadside units and vehicles. Our proposed protocol cannot only guarantee privacy, anonymity, and other basic cryptographic requirements but also provide traceability of illegal users. Our proposed protocol...

The new signature scheme, t ra i tor traceable signature scheme is presented, which allows the signer to convince any arbiter of the recipient's infringement, if the recipient distributes illegally the signature which he got. We use the techniques of a proof of knowledge of discrete logarithm[l][2], identification of double spender in an off-line electronic cash[3][4], and a signcryption scheme...

We propose a short traceable signature scheme based on bilinear pairings. Traceable signatures, introduced by Kiayias, Tsiounis and Yung (KTY), support an extended set of fairness mechanisms (mechanisms for anonymity management and revocation) when compared with the traditional group signatures. Designing short signatures based on the power of pairing has been a current activity of cryptographi...

We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constructing an identitybased (ID-based) ring signature scheme with constant-size signatures and its interactive counterpart, and providing membership revocation to group signature, traceable signature and identity escrow sc...

An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted third party, named arbitrator, which involves in the protocol if it is necessary. But there is a security problem when a...