Toggle Main Menu Toggle Search

Open Access padlockePrints

A Pairing-Based Anonymous Credential System with Efficient Attribute Encoding

Lookup NU author(s): Dr Syh Yuan Tan, Dr Thomas Gross

Downloads


Licence

This is the final published version of a report that has been published in its final definitive form by School of Computing, Newcastle University, 2019.

For re-use rights please refer to the publisher's terms and conditions.


Abstract

We propose new multi-show anonymous attribute-based credential system that is provably secure in the standard model under the $q$-SDH assumption. The corresponding proof system incorporates efficient show proofs for logical statements \textsf{AND}, \textsf{OR} and \textsf{NOT}. Each statement requires only a constant number of bilinear pairing operations by the verifier and none by the prover. The system is based on the pairing-based Camenisch-Lysyanskaya signature scheme and offers a novel efficient attribute encoding method which is of independent interest.


Publication metadata

Author(s): Tan SY, Gross T

Publication type: Report

Publication status: Published

Series Title: School of Computing Technical Report Series

Year: 2019

Online publication date: 16/06/2019

Acceptance date: 16/01/2019

Report Number: 1527

Institution: School of Computing, Newcastle University

Place Published: Newcastle upon Tyne


Share