| dc.contributor | 資科系 | |
| dc.creator (作者) | 曾一凡 | |
| dc.creator (作者) | Tseng, Yi-Fan | |
| dc.creator (作者) | Wu, Chien-Nan | |
| dc.creator (作者) | Fan, Chun-I | |
| dc.creator (作者) | Huang, Jheng-Jia | |
| dc.creator (作者) | Kikuchi, Hiroaki | |
| dc.date (日期) | 2018-07 | |
| dc.date.accessioned | 2-Sep-2020 09:14:43 (UTC+8) | - |
| dc.date.available | 2-Sep-2020 09:14:43 (UTC+8) | - |
| dc.date.issued (上傳時間) | 2-Sep-2020 09:14:43 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/131406 | - |
| dc.description.abstract (摘要) | This article describes how after the concept of anonymous credential systems was introduced in 1985, a number of similar systems have been proposed. However, these systems use zero-knowledge protocols to authenticate users, resulting in inefficient authentication during the stage of proving credential possession. To overcome this drawback, this article presents a signature scheme that uses partially blind signatures and chameleon hash functions such that both the prover and verifier achieve efficient authentication. In addition to providing a computational cost comparison table showing that the proposed signature scheme achieves a more efficient credential possession proving compared to other schemes, concrete security proofs are provided under a random oracle model to demonstrate that the proposed scheme satisfies the properties of anonymous credentials. | |
| dc.format.extent | 110 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | International Journal of Software Innovation, Vol.6, No.3, pp.18-35 | |
| dc.title (題名) | Probably Secure Efficient Anonymous Credential Scheme | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.4018/IJSI.2018070102 | |
| dc.doi.uri (DOI) | https://doi.org/10.4018/IJSI.2018070102 | |
