Volume 4 - Issue 1
Privacy-Preserving Predicate Proof of Attributes with CL-Anonymous Credential
- Nan Guo
Northeastern University, Shenyang, China
guonan@mail.neu.edu.cn
- Jia Wang
Northeastern University, Shenyang, China
wang 4027@126.com
- Tianhan Gao
Northeastern University, Shenyang, China
gaoth@mail.neu.edu.cn
- Kangbin Yim
Soonchunhyang University, Asan, Republic of Korea
yim@sch.ac.kr
Keywords: anonymous credential, attributes proof, predicate proof
Abstract
The anonymous credential system allows users to convince relying parties the possession of a credential
released by an issuer. To adhere to the minimal information disclose principle, the anonymous
credential facilitates predicate proofs of attributes without revealing the values. In this paper, we
extend the pairing-based CL-anonymous credential system and present a series of attributes proof
protocols. They enable users to prove to relying parties the AND and OR relations over multiple attributes,
as well as equality to a given value and lying into a given interval over some single attribute.