[Resource Topic] 2023/1181: A Relational Credential System from $q$-SDH-based Graph Signatures

Welcome to the resource topic for 2023/1181

A Relational Credential System from q-SDH-based Graph Signatures

Authors: Syh-Yuan Tan, Ioannis Sfyrakis, Thomas Gross


An attribute-based credential system enables users to prove possession of a credential and statements over certified attributes to verifiers in zero-knowledge while maintaining anonymity and unlinkability. In a relational anonymous credential system, users can further prove their relationship to other entities in their social graph, such as position in an organizational hierarchy or friends-of-friends status in an online social network graph, while protecting their own privacy and that of other users involved in the social graph. While traditional anonymous credential schemes make no provisions for privacy-preserving relationship predicates, a relational credential system is more usable, because it can facilitate relationship-based access control with a wide range of predicates and offers strong privacy guarantees for relationship proofs.
We propose the first relational credential scheme, based on a new q-SDH graph signature scheme and an efficient zero-knowledge proof system for graph predicates. We rigorously prove the security for the proposed scheme and provide a benchmark using Facebook social graphs.

ePrint: https://eprint.iacr.org/2023/1181

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .