An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation

By Jan Camenisch, Anna Lysyanskaya. 2001

1,445 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

The Economics of Personal Data and the Economics of Privacy (2010, background): “…2004), or electronic voting (Benaloh, 1987); but it is also possible to have credential systems that provide authentication without identification (Camenisch and Lysyanskaya, 2001), share personal preferences while protecting privacy (Adar and Huberamn, 2001), leverage the power of recommender…”
Privacy-Preserving Solutions for Blockchain: Review and Challenges (2019, methodology): “attributes using, for instance, Anonymous Credential Systems [39] such as Idemix [27], which employs ZKPs to reveal the minimal amount of information to the verifier (usually a service provider), even without disclosing the attribute value itself.”
Anonymous credentials light (2013, methodology): “Anonymous credentials, envisioned by David Chaum [17], and ﬁrst fully realized by Camenisch and Lysyanskaya [13], have proved to be a centrally important building block in privacy-minded identity management systems currently under development [43, 35, 16].”
Distributed Differentially Private Averaging with Improved Utility and Robustness to Malicious Parties (2020, background): “[19] Jan Camenisch and Anna Lysyanskaya.”
Engineering Privacy by Design (2011, background): “This is possible thanks to advanced cryptographic protocols [5, 6, 8], which are able to simultaneously satisfy requirements that seem intuitively incompatible.”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, background): “Examples of protocols that can be automatically generated by our compiler include [3,4,5,6,7,8,9,10,13,14,15,16].”
Zerocoin: Anonymous Distributed E-Cash from Bitcoin (2013, background): “, the use of anonymous credentials [40]) might allow users to maintain their anonymity while demonstrating compliance with reporting requirements.”
Decentralizing Attribute-Based Encryption (2011, neutral): “credential systems [19].”
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (2009, background): “Moreover, our schemes are “circular secure” [15], that is, they remain secure even in the presence of key “cycles” or even “cliques,” where any user’s secret key may be encrypted under any user’s public key.”