WEKO3
-
RootNode
アイテム
A Pairing-Based Anonymous Credential System with Efficient Attribute Proofs
https://ipsj.ixsq.nii.ac.jp/records/95628
https://ipsj.ixsq.nii.ac.jp/records/95628b36a23c9-94b9-4b0d-a807-b26d609de683
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2012 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | JInfP(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2012-07-15 | |||||||
タイトル | ||||||||
タイトル | A Pairing-Based Anonymous Credential System with Efficient Attribute Proofs | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | A Pairing-Based Anonymous Credential System with Efficient Attribute Proofs | |||||||
言語 | ||||||||
言語 | eng | |||||||
キーワード | ||||||||
主題Scheme | Other | |||||||
主題 | [Regular Paper (Recommended Paper)] anonymity, anonymous credentials, attributes, pairings, accumulators | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
資源タイプ | journal article | |||||||
著者所属 | ||||||||
Electronic Engineering Polytechnic Institute of Surabaya (EEPIS) | ||||||||
著者所属 | ||||||||
Department of Communication Network Engineering, Okayama University | ||||||||
著者所属 | ||||||||
Department of Communication Network Engineering, Okayama University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Electronic Engineering Polytechnic Institute of Surabaya (EEPIS) | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Communication Network Engineering, Okayama University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Communication Network Engineering, Okayama University | ||||||||
著者名 |
Amang, Sudarsono
Toru, Nakanishi
Nobuo, Funabiki
× Amang, Sudarsono Toru, Nakanishi Nobuo, Funabiki
|
|||||||
著者名(英) |
Amang, Sudarsono
Toru, Nakanishi
Nobuo, Funabiki
× Amang, Sudarsono Toru, Nakanishi Nobuo, Funabiki
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | To enhance user privacy, anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. The typical application is the privacy-enhancing electronic ID (eID). Although a previously proposed system achieves the constant complexity in the number of finite-set attributes of the user, it requires the use of RSA. In this paper, we propose a pairing-based anonymous credential system excluding RSA that achieves the constant complexity. The key idea of our proposal is the adoption of a pairing-based accumulator that outputs a constant-size value from a large set of input values. Using zero-knowledge proofs of pairing-based certificates and accumulators, any AND and OR relation can be proved with the constant complexity in the number of finite-set attributes. We implement the proposed system using the fast pairing library, compare the efficiency with the conventional systems, and show the practicality in a mobile eID application. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | To enhance user privacy, anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. The typical application is the privacy-enhancing electronic ID (eID). Although a previously proposed system achieves the constant complexity in the number of finite-set attributes of the user, it requires the use of RSA. In this paper, we propose a pairing-based anonymous credential system excluding RSA that achieves the constant complexity. The key idea of our proposal is the adoption of a pairing-based accumulator that outputs a constant-size value from a large set of input values. Using zero-knowledge proofs of pairing-based certificates and accumulators, any AND and OR relation can be proved with the constant complexity in the number of finite-set attributes. We implement the proposed system using the fast pairing library, compare the efficiency with the conventional systems, and show the practicality in a mobile eID application. | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AA00700121 | |||||||
書誌情報 |
Journal of information processing 巻 20, 号 3, p. 774-784, 発行日 2012-07-15 |
|||||||
ISSN | ||||||||
収録物識別子タイプ | ISSN | |||||||
収録物識別子 | 1882-6652 | |||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |