The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Untuk meningkatkan privasi pengguna dalam ID elektronik, sistem kelayakan tanpa nama telah dikaji. Dalam sistem bukti kelayakan tanpa nama, organisasi pengeluar yang dipercayai mula-mula mengeluarkan sijil yang memperakui atribut pengguna kepada pengguna. Kemudian, sebagai tambahan kepada pemilikan sijil, pengguna boleh membuktikan secara tanpa nama hanya atribut yang diperlukan. Sebelum ini, sistem kelayakan tanpa nama telah dicadangkan, di mana formula CNF (Conjunctive Normal Form) pada atribut boleh dibuktikan. Kelebihannya ialah bukti atribut dalam pengesahan mempunyai saiz tetap untuk bilangan atribut yang dimiliki pengguna dan saiz formula terbukti. Oleh itu, pelbagai hubungan logik ekspresif pada atribut boleh disahkan dengan cekap. Walau bagaimanapun, sistem sebelumnya mempunyai had: Formula CNF yang terbukti tidak boleh memasukkan sebarang penolakan. Oleh itu, dalam kertas kerja ini, kami mencadangkan sistem bukti kelayakan tanpa nama dengan bukti atribut saiz tetap supaya pengguna boleh membuktikan formula CNF dengan penolakan. Untuk sistem yang dicadangkan, kami melanjutkan penumpuk sebelumnya untuk formula CNF terhad untuk mengesahkan formula CNF dengan penolakan.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -