### 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 u_{1} Φ_{1} and u_{2} Φ_{2} if and only if u_{1} +u_{2} Φ. 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 | |

Publication status | Published - 2013 |

Event | 2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013 - Tokyo, Japan Duration: Oct 1 2013 → Oct 4 2013 |

### Other

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

Country | Japan |

City | Tokyo |

Period | 10/1/13 → 10/4/13 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013*(pp. 530-533). [6664912] https://doi.org/10.1109/GCCE.2013.6664912