@inproceedings{belenkiy2008randomizable,
author = {Belenkiy, Mira and Camenisch, Jan and Chase, Melissa and Kohlweiss, Markulf and Lysyanskaya, Anna and Shacham, Hovav},
title = {Randomizable Proofs and Delegatable Anonymous Credentials},
booktitle = {CRYPTO 2009},
year = {2008},
month = {January},
abstract = {We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other users, and prove possession of a credential L levels away from a given authority. The size of the proof (and time to compute it) is O(Lk), where k is the security parameter. The only other construction of delegatable anonymous credentials (Chase and Lysyanskaya, Crypto 2006) relies on general non-interactive proofs for NP-complete languages of size k ¿(2 L ). We revise the entire approach to constructing anonymous credentials and identify randomizable zero-knowledge proof of knowledge systems as the key building block. We formally define the notion of randomizable non-interactive zero-knowledge proofs, and give the first instance of controlled rerandomization of non-interactive zero-knowledge proofs by a third-party. Our construction uses Groth-Sahai proofs (Eurocrypt 2008).},
url = {http://approjects.co.za/?big=en-us/research/publication/randomizable-proofs-and-delegatable-anonymous-credentials-2/},
pages = {108-125},
edition = {CRYPTO 2009},
}