A Pairing-Based Anonymous Credential System with Efficient Attribute Proofs

• Item type: Journal(1)
• 公開日: 2012-06-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
• キーワード / 主題: [一般論文] 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
• 論文抄録 / 内容記述タイプ: 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.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online); DOI http://dx.doi.org/10.2197/ipsjjip.20.774; ------------------------------
• 論文抄録(英) / 内容記述タイプ: 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.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online); DOI http://dx.doi.org/10.2197/ipsjjip.20.774; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 53, 号 6, 発行日 2012-06-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764