CryptoDB
Analyzing Unlinkability of Some Group Signatures
Authors: | |
---|---|
Download: | |
Abstract: | Miyaji et.al proposed a fully functional(i.e., satisfying unforgeability, exculpability,anonymity, traceability, unlinkability, and revocability.) group signature over only known-order groups, that is based only on Discrete logarithm related assumptions, specifically, multiple DLP they proposed in the same paper [MU04]. In this paper, we point out their scheme and an improved scheme [ZZW05] do not have unlinkability. |
BibTeX
@misc{eprint-2005-12514, title={Analyzing Unlinkability of Some Group Signatures}, booktitle={IACR Eprint archive}, keywords={Digital Signature, Group Signature.}, url={http://eprint.iacr.org/2005/178}, note={ zhousujing@is.iscas.ac.cn 13034 received 14 Jun 2005, last revised 8 Sep 2005}, author={Zhou Sujing and Dongdai Lin}, year=2005 }