The search functionality is under construction.

The search functionality is under construction.

To enhance the user's privacy in electronic ID, anonymous credential systems have been researched. In the anonymous credential system, a trusted issuing organization first issues a certificate certifying the user's attributes to a user. Then, in addition to the possession of the certificate, the user can anonymously prove only the necessary attributes. Previously, an anonymous credential system was proposed, where CNF (Conjunctive Normal Form) formulas on attributes can be proved. The advantage is that the attribute proof in the authentication has the constant size for the number of attributes that the user owns and the size of the proved formula. Thus, various expressive logical relations on attributes can be efficiently verified. However, the previous system has a limitation: The proved CNF formulas cannot include any negation. Therefore, in this paper, we propose an anonymous credential system with constant-size attribute proofs such that the user can prove CNF formulas with negations. For the proposed system, we extend the previous accumulator for the limited CNF formulas to verify CNF formulas with negations.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.12 pp.1381-1392

- Publication Date
- 2020/12/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.2020TAP0003

- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)

- Category
- Cryptography and Information Security

Ryo OKISHIMA

Department of Information Engineering, Hiroshima University

Toru NAKANISHI

Department of Information Engineering, Hiroshima University

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Ryo OKISHIMA, Toru NAKANISHI, "An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 12, pp. 1381-1392, December 2020, doi: 10.1587/transfun.2020TAP0003.

Abstract: To enhance the user's privacy in electronic ID, anonymous credential systems have been researched. In the anonymous credential system, a trusted issuing organization first issues a certificate certifying the user's attributes to a user. Then, in addition to the possession of the certificate, the user can anonymously prove only the necessary attributes. Previously, an anonymous credential system was proposed, where CNF (Conjunctive Normal Form) formulas on attributes can be proved. The advantage is that the attribute proof in the authentication has the constant size for the number of attributes that the user owns and the size of the proved formula. Thus, various expressive logical relations on attributes can be efficiently verified. However, the previous system has a limitation: The proved CNF formulas cannot include any negation. Therefore, in this paper, we propose an anonymous credential system with constant-size attribute proofs such that the user can prove CNF formulas with negations. For the proposed system, we extend the previous accumulator for the limited CNF formulas to verify CNF formulas with negations.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020TAP0003/_p

Copy

@ARTICLE{e103-a_12_1381,

author={Ryo OKISHIMA, Toru NAKANISHI, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations},

year={2020},

volume={E103-A},

number={12},

pages={1381-1392},

abstract={To enhance the user's privacy in electronic ID, anonymous credential systems have been researched. In the anonymous credential system, a trusted issuing organization first issues a certificate certifying the user's attributes to a user. Then, in addition to the possession of the certificate, the user can anonymously prove only the necessary attributes. Previously, an anonymous credential system was proposed, where CNF (Conjunctive Normal Form) formulas on attributes can be proved. The advantage is that the attribute proof in the authentication has the constant size for the number of attributes that the user owns and the size of the proved formula. Thus, various expressive logical relations on attributes can be efficiently verified. However, the previous system has a limitation: The proved CNF formulas cannot include any negation. Therefore, in this paper, we propose an anonymous credential system with constant-size attribute proofs such that the user can prove CNF formulas with negations. For the proposed system, we extend the previous accumulator for the limited CNF formulas to verify CNF formulas with negations.},

keywords={},

doi={10.1587/transfun.2020TAP0003},

ISSN={1745-1337},

month={December},}

Copy

TY - JOUR

TI - An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1381

EP - 1392

AU - Ryo OKISHIMA

AU - Toru NAKANISHI

PY - 2020

DO - 10.1587/transfun.2020TAP0003

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E103-A

IS - 12

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - December 2020

AB - To enhance the user's privacy in electronic ID, anonymous credential systems have been researched. In the anonymous credential system, a trusted issuing organization first issues a certificate certifying the user's attributes to a user. Then, in addition to the possession of the certificate, the user can anonymously prove only the necessary attributes. Previously, an anonymous credential system was proposed, where CNF (Conjunctive Normal Form) formulas on attributes can be proved. The advantage is that the attribute proof in the authentication has the constant size for the number of attributes that the user owns and the size of the proved formula. Thus, various expressive logical relations on attributes can be efficiently verified. However, the previous system has a limitation: The proved CNF formulas cannot include any negation. Therefore, in this paper, we propose an anonymous credential system with constant-size attribute proofs such that the user can prove CNF formulas with negations. For the proposed system, we extend the previous accumulator for the limited CNF formulas to verify CNF formulas with negations.

ER -