| Presentation | 2012-07-20 Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System Nasima BEGUM, Toru NAKANISHI, Nobuo FUNABIKI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. In the systems, the user can prove the relations on his/her attributes certified by the certificate. Previously, a pairing-based anonymous credential system with constant-size proofs in the number of attributes of the user has been proposed. This system supports the proofs of the inner product relations on attributes, and thus can handle any CNF (or DNF) formula on attributes. However, in this system, the proof generation needs exponentiations depending on the number of the literals in OR relations. In this paper, we propose a pairing-based anonymous credential system with the constant-size proofs for CNF formulas, where the proof generation needs only multiplications depending on the number of literals, and thus it is more efficient. The key of our construction is to use an extended accumulator, by which we can verify that multiple attributes are included in multiple sets, all at once. This leads to the verification of CNF formulas on attributes. Since the accumulator is mainly calculated by multiplications, we achieve the better computational costs. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | anonymity / anonymous credentials / attributes / CNF formulas / pairings |
| Paper # | ISEC2012-38,SITE2012-34,ICSS2012-40,EMM2012-30 |
| Date of Issue |
| Conference Information | |
| Committee | ICSS |
|---|---|
| Conference Date | 2012/7/12(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information and Communication System Security (ICSS) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System |
| Sub Title (in English) | |
| Keyword(1) | anonymity |
| Keyword(2) | anonymous credentials |
| Keyword(3) | attributes |
| Keyword(4) | CNF formulas |
| Keyword(5) | pairings |
| 1st Author's Name | Nasima BEGUM |
| 1st Author's Affiliation | Graduate School of Natural Science and Technology, Okayama University() |
| 2nd Author's Name | Toru NAKANISHI |
| 2nd Author's Affiliation | Graduate School of Natural Science and Technology, Okayama University |
| 3rd Author's Name | Nobuo FUNABIKI |
| 3rd Author's Affiliation | Graduate School of Natural Science and Technology, Okayama University |
| Date | 2012-07-20 |
| Paper # | ISEC2012-38,SITE2012-34,ICSS2012-40,EMM2012-30 |
| Volume (vol) | vol.112 |
| Number (no) | 128 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |