ID-Based Blind Signature and Ring Signature from Pairings

Zhang, Fangguo; Kim, Kwangjo

doi:10.1007/3-540-36178-2_33

Cited by 374 publications

(259 citation statements)

References 27 publications

Supporting

Mentioning

259

Contrasting

Order By: Relevance

“…Until now, most of the work focused on proving properties of ring signatures [41] or on the anonymity and unlinkability of the signature generation process [28].…”

Section: Related Workmentioning

confidence: 99%

Self-organized Anonymous Authentication in Mobile Ad Hoc Networks

Freudiger

Raya

Hubaux

2009

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. Pervasive communications bring along new privacy challenges, fueled by the capability of mobile devices to communicate with, and thus "sniff on", each other directly. We design a new mechanism that aims at achieving location privacy in these forthcoming mobile networks, whereby mobile nodes collect the pseudonyms of the nodes they encounter to generate their own privacy cloaks. Thus, privacy emerges from the mobile network and users gain control over the disclosure of their locations. We call this new paradigm self-organized location privacy. In this work, we focus on the problem of self-organized anonymous authentication that is a necessary prerequisite for location privacy. We investigate, using graph theory, the optimality of different cloak constructions and evaluate with simulations the achievable anonymity in various network topologies. We show that peer-to-peer wireless communications and mobility help in the establishment of self-organized anonymous authentication in mobile networks.

show abstract

“…Until now, most of the work focused on proving properties of ring signatures [41] or on the anonymity and unlinkability of the signature generation process [28].…”

Section: Related Workmentioning

confidence: 99%

Self-organized Anonymous Authentication in Mobile Ad Hoc Networks

Freudiger

Raya

Hubaux

2009

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

show abstract

“…We summarize some concepts of bilinear pairings using similar notations used by Zhang and Kim [23] which was used to design ID-based blind signature and ring signature based on pairings. Let G 1 and G 2 be additive and multiplicative groups of the same prime order q, respectively.…”

Section: Bilinear Pairingsmentioning

confidence: 99%

Yet Another Forward Secure Signature from Bilinear Pairings

Kim

2006

Information Security and Cryptology - ICISC 2005

Self Cite

View full text Add to dashboard Cite

Abstract. In this work, we have proposed yet another forward secure signature based on bilinear pairings. Our forward secure signature requires the general security parameters only independent to the total number of time periods. The scheme can perform key evolving for unlimited time periods while maintaining sizes of keys and signature fixed. In addition, the signing algorithm is very efficient with the simple verification algorithm. We also provide a formal definition along with a detailed security proof of our signature scheme under the assumption of Computational Diffie-Hellman problem.

show abstract

“…It protects the anonymity of a signer since the verifier knows that the signature comes from a member of a ring, but doesn't know exactly who the signer is. The first ID-based ring signature scheme was proposed by Zhang and Kim in [29].…”

Section: Introductionmentioning

confidence: 99%

Analysis and improvement of authenticatable ring signcryption scheme

Shirase

Takagi

2008

J. Shanghai Jiaotong Univ. (Sci.)

View full text Add to dashboard Cite

Abstract. Ring signcryption is an anonymous signcryption which allows a user to anonymously signcrypt a message on behalf of a set of users including himself. In an ordinary ring signcryption scheme, even if a user of the ring generates a signcryption, he also cannot prove that the signcryption was produced by himself. In 2008, Zhang, Yang, Zhu, and Zhang solve the problem by introducing an identity-based authenticatable ring signcryption scheme (denoted as the ZYZZ scheme). In the ZYZZ scheme, the actual signcrypter can prove that the ciphertext is generated by himself, and the others cannot authenticate it. However, in this paper, we show that the ZYZZ scheme is not secure against chosen plaintext attacks. Furthermore, we propose an improved scheme that remedies the weakness of the ZYZZ scheme. The improved scheme has shorter ciphertext size than the ZYZZ scheme. We then prove that the improved scheme satisfies confidentiality, unforgeability, anonymity and authenticatability.

show abstract

ID-Based Blind Signature and Ring Signature from Pairings

Cited by 374 publications

References 27 publications

Self-organized Anonymous Authentication in Mobile Ad Hoc Networks

Self-organized Anonymous Authentication in Mobile Ad Hoc Networks

Yet Another Forward Secure Signature from Bilinear Pairings

Analysis and improvement of authenticatable ring signcryption scheme

Contact Info

Product

Resources

About