Accumulator for Monotone Formulas and its Application to Anonymous Credential System

• Item type: Journal(1)
• 公開日: 2017-12-15
• タイトル: Accumulator for Monotone Formulas and its Application to Anonymous Credential System
• タイトル / 言語: en
• タイトル: Accumulator for Monotone Formulas and its Application to Anonymous Credential System
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [一般論文] anonymity, anonymous credentials, accumulator, CNF formulas, monotone formulas
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Information Engineering, Hiroshima University
• 著者所属: Department of Information Engineering, Hiroshima University
• 著者所属: Department of Computer Science and Engineering, University of Asia Pacific
• 著者所属: Department of Communication Network Engineering, Okayama University
• 著者所属(英): en
• 著者所属(英): Department of Information Engineering, Hiroshima University
• 著者所属(英): en
• 著者所属(英): Department of Information Engineering, Hiroshima University
• 著者所属(英): en
• 著者所属(英): Department of Computer Science and Engineering, University of Asia Pacific
• 著者所属(英): en
• 著者所属(英): Department of Communication Network Engineering, Okayama University
• 著者名: Shahidatul, Sadiah; Toru, Nakanishi; Nasima, Begum; Nobuo, Funabiki
• 著者名(英): Shahidatul, Sadiah; Toru, Nakanishi; Nasima, Begum; Nobuo, Funabiki
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, a system to prove AND and OR relations simultaneously by CNF formulas was proposed. To achieve a constant-size proof of the formula, this system adopts an accumulator that compresses multiple attributes into a single value. However, this system has a problem: the proof generation requires a large amount of computational time in the case of lots of OR literals in the formula. Therefore, we convert the attribute relation from the CNF formula to a monotone formula to decrease the number of OR literals. The monotone formula is a logic formula that contains any combination of AND and OR relations. In this paper, we propose an extended accumulator to prove the monotone formula, and apply it to the anonymous credential system. Our approach to prove the monotone formula is that the tag assignment in the accumulator is extended to be adapted to the tree expressing the monotone formula. Using this type of formula, the number of public parameters multiplied in the accumulator is decreased, which greatly impacts the reduction of authentication time.; ------------------------------; 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.25(2017) (online); DOI http://dx.doi.org/10.2197/ipsjjip.25.949; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, a system to prove AND and OR relations simultaneously by CNF formulas was proposed. To achieve a constant-size proof of the formula, this system adopts an accumulator that compresses multiple attributes into a single value. However, this system has a problem: the proof generation requires a large amount of computational time in the case of lots of OR literals in the formula. Therefore, we convert the attribute relation from the CNF formula to a monotone formula to decrease the number of OR literals. The monotone formula is a logic formula that contains any combination of AND and OR relations. In this paper, we propose an extended accumulator to prove the monotone formula, and apply it to the anonymous credential system. Our approach to prove the monotone formula is that the tag assignment in the accumulator is extended to be adapted to the tree expressing the monotone formula. Using this type of formula, the number of public parameters multiplied in the accumulator is decreased, which greatly impacts the reduction of authentication time.; ------------------------------; 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.25(2017) (online); DOI http://dx.doi.org/10.2197/ipsjjip.25.949; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 58, 号 12, 発行日 2017-12-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764