In an anonymous credential system, when a credential has been shown for verification,
none can identify the owner of the credential and link the relationship between
any two credentials. The unlinkability is the crucial feature for any anonymous credential
system. In 2002, Jan Camenisch and Anna Lysyanskaya proposed a signature
scheme (CL signature) which allows users to demonstrate their credentials without
revealing their identity information. However, CL signature is compounded of a
lot of zero-knowledge proof technologies which cause inefficiency for CL signatures.
Such heavy computation requirements may limit the scope which CL signatures can
be applied to. In this thesis, we propose a new blind signature scheme based on
ElGamal signatures and design an anonymous verification procedure which is more
efficient than the CL signature scheme. Finally, we also implement our proposed
protocols.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0901110-021132 |
| Date | 01 September 2010 |
| Creators | Huang, Ren-Shang |
| Contributors | Chung-Huang Yang, Wen-Shenq Juang, Chun-I Fan, D. J. Guan |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901110-021132 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.002 seconds