Privacy-Preserving Predicate Proof of Attributes with
CL-Anonymous Credential

Nan Guo¹⁺, Jia Wang¹, Tianhan Gao¹, and Kangbin Yim²

¹Northeastern University, Shenyang, China
guonan@mail.neu.edu.cn, wang 4027@126.com, gaoth@mail.neu.edu.cn

²Soonchunhyang University, Asan, Republic of Korea

yim@sch.ac.kr

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.

Keywords: anonymous credential, attributes proof, predicate proof

+: Corresponding author: Nan Guo

3-11, Wenhua Road, Heping District, Shenyang, Liaoning Province, China, 110006, Tel: +86-15040150871

Journal of Internet Services and Information Security (JISIS), 4(1): 37-46, February  2014 [pdf]