Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs

Nasima Begum; Toru Nakanishi; Nobuo Funabiki

doi:10.1109/GCCE.2013.6664912

Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs

Nasima Begum, Toru Nakanishi, Nobuo Funabiki

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

To enhance the user privacy at authentications, an anonymous credential system has been designed to allow a user to anonymously convince a verifier of the possession of a certificate issued by the issuing authority. In this system, a user can prove relations on his/her attributes embedded into the certificate. Previously, we have proposed an anonymous credential system with constant-size proofs and faster proof generations for CNF formulas than the existing system. In the system, in the verification, some value should be included in some set Φ. Unfortunately, this system has a problem of requiring long public parameters that is proportional to the size of the set Φ. In this paper, we propose an extension to reduce the public key by separating this set Φ into two sets Φ₁ and Φ₂ with logarithmic sizes such that u₁ Φ₁ and u₂ Φ₂ if and only if u₁ +u₂ Φ. Furthermore, we evaluate the efficiency based on the implementation.

Original language	English
Title of host publication	2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013
Pages	530-533
Number of pages	4
DOIs	https://doi.org/10.1109/GCCE.2013.6664912
Publication status	Published - Dec 1 2013
Event	2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013 - Tokyo, Japan Duration: Oct 1 2013 → Oct 4 2013

Publication series

Name	2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013

Other

Other	2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013
Country	Japan
City	Tokyo
Period	10/1/13 → 10/4/13

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/GCCE.2013.6664912

Fingerprint Dive into the research topics of 'Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs'. Together they form a unique fingerprint.

Cite this

Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs. / Begum, Nasima; Nakanishi, Toru; Funabiki, Nobuo.

2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013. 2013. p. 530-533 6664912 (2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Begum, N, Nakanishi, T & Funabiki, N 2013, Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs. in 2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013., 6664912, 2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013, pp. 530-533, 2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013, Tokyo, Japan, 10/1/13. https://doi.org/10.1109/GCCE.2013.6664912

@inproceedings{a9dd3d78e6c14b26904287dae4a1721c,

title = "Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs",

abstract = "To enhance the user privacy at authentications, an anonymous credential system has been designed to allow a user to anonymously convince a verifier of the possession of a certificate issued by the issuing authority. In this system, a user can prove relations on his/her attributes embedded into the certificate. Previously, we have proposed an anonymous credential system with constant-size proofs and faster proof generations for CNF formulas than the existing system. In the system, in the verification, some value should be included in some set Φ. Unfortunately, this system has a problem of requiring long public parameters that is proportional to the size of the set Φ. In this paper, we propose an extension to reduce the public key by separating this set Φ into two sets Φ1 and Φ2 with logarithmic sizes such that u1 Φ1 and u2 Φ2 if and only if u1 +u2 Φ. Furthermore, we evaluate the efficiency based on the implementation.",

author = "Nasima Begum and Toru Nakanishi and Nobuo Funabiki",

year = "2013",

month = dec,

day = "1",

doi = "10.1109/GCCE.2013.6664912",

language = "English",

isbn = "9781479908929",

series = "2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013",

pages = "530--533",

booktitle = "2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013",

note = "2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013 ; Conference date: 01-10-2013 Through 04-10-2013",

}

TY - GEN

T1 - Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs

AU - Begum, Nasima

AU - Nakanishi, Toru

AU - Funabiki, Nobuo

PY - 2013/12/1

Y1 - 2013/12/1

N2 - To enhance the user privacy at authentications, an anonymous credential system has been designed to allow a user to anonymously convince a verifier of the possession of a certificate issued by the issuing authority. In this system, a user can prove relations on his/her attributes embedded into the certificate. Previously, we have proposed an anonymous credential system with constant-size proofs and faster proof generations for CNF formulas than the existing system. In the system, in the verification, some value should be included in some set Φ. Unfortunately, this system has a problem of requiring long public parameters that is proportional to the size of the set Φ. In this paper, we propose an extension to reduce the public key by separating this set Φ into two sets Φ1 and Φ2 with logarithmic sizes such that u1 Φ1 and u2 Φ2 if and only if u1 +u2 Φ. Furthermore, we evaluate the efficiency based on the implementation.

AB - To enhance the user privacy at authentications, an anonymous credential system has been designed to allow a user to anonymously convince a verifier of the possession of a certificate issued by the issuing authority. In this system, a user can prove relations on his/her attributes embedded into the certificate. Previously, we have proposed an anonymous credential system with constant-size proofs and faster proof generations for CNF formulas than the existing system. In the system, in the verification, some value should be included in some set Φ. Unfortunately, this system has a problem of requiring long public parameters that is proportional to the size of the set Φ. In this paper, we propose an extension to reduce the public key by separating this set Φ into two sets Φ1 and Φ2 with logarithmic sizes such that u1 Φ1 and u2 Φ2 if and only if u1 +u2 Φ. Furthermore, we evaluate the efficiency based on the implementation.

UR - http://www.scopus.com/inward/record.url?scp=84892638394&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892638394&partnerID=8YFLogxK

U2 - 10.1109/GCCE.2013.6664912

DO - 10.1109/GCCE.2013.6664912

M3 - Conference contribution

AN - SCOPUS:84892638394

SN - 9781479908929

T3 - 2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013

SP - 530

EP - 533

BT - 2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013

T2 - 2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013

Y2 - 1 October 2013 through 4 October 2013

ER -