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 proceedingConference 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 Φ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.

Original languageEnglish
Title of host publication2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013
Pages530-533
Number of pages4
DOIs
Publication statusPublished - 2013
Event2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013 - Tokyo, Japan
Duration: Oct 1 2013Oct 4 2013

Other

Other2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013
CountryJapan
CityTokyo
Period10/1/1310/4/13

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

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 (pp. 530-533). [6664912] https://doi.org/10.1109/GCCE.2013.6664912