Signature Schemes and Anonymous Credentials from Bilinear Maps

By Jan Camenisch, Anna Lysyanskaya. Annual International Cryptology Conference, 2004

1,099 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/8c2052d2b8cd21501332f2bd3ad3e419e016f50b

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

In Computational Theory and Mathematics

In Geometry and Topology

Citations in the corpus

Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures (2006, methodology): “It is hard to design group signatures and most schemes [17,16,3,14,2,13,31,15,10,26,32] use the random oracle model in the security proof.”
Charm: a framework for rapidly prototyping cryptosystems (2013, background): “Advances in lattices and pairings have driven new paradigms for securely processing and protecting sensitive information such as identity-based encryption [17,19,27,57,76] and attribute-based encryption [14,58,69,77], and privacy-preserving schemes such as ring signatures [22,36], group signatures [”
PUDA - Privacy and Unforgeability for Data Aggregation (2015, methodology): “Our new assumption named hereafter LEOM is a variant of the LRSW assumption [16] which is proven secure in the generic model [18] and used in the construction of the CL signatures [5].”
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, background): “It is described in [ 33 ] and has been proven secure under the n-SDH assumption [34,35].”
ANONIZE: A Large-Scale Anonymous Survey System (2014, positive): “NIZKs we use rely on intuitions similar to those used in constructions of anonymous credentials (most closely related to [11] and the electronic cash/token extensions in [25], [12]), but we have different goals and rely on different complexity assumptions.”
Compact E-Cash (2005, methodology): “By making additional assumptions based on bilinear maps, we can use alternative schemes by Camenisch and Lysyanskaya [15] and Boneh, Boyen and Shacham [5], yielding shorter signatures in practice.”
Constant-Size Dynamic k-TAA (2006, methodology): “Examples include CL signature, CL+ signature [9, 11].”
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008, neutral): “Nevertheless, we state our assumptions explicitly and highlight that they are non-interactive (in contrast to, e.g., the LRSW assumption [ 14 ]) and of flxed size (in contrast to, e.g., the q-SDH assumption [6]).”
Brave new world: privacy risks for mobile users (2014, background): “While the underlying cryptographic blocks may already exist [18], before such a drastic change can be deployed, basic research is required in demonstrating the scalability and economic viability of a “minimum-information” infrastructure.”
Ring Signatures: Stronger Definitions, and Constructions without Random Oracles (2006, methodology): “We thank Giuseppe Ateniese for referring us to [5,7], and Javier Herranz for informing us about [17].”
A privacy threat analysis framework: supporting the elicitation and fulfillment of privacy requirements (2011, background): “Anonymous credentials (single show [53], multishow [54]) 9 9”
Structure-Preserving Signatures and Commitments to Group Elements (2010, methodology): “Most previous constructions, [CS97, ACJT00, BBS04, CL04 , BSZ05, BW06, BW07, Gro06] among others, could be viewed as unsatisfactory in some aspect: relying on the randomoracle model, satisfying weaker security definitions, or not being efficient.”
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation (2005, methodology): “For instance, our technique also applies directly to distribute non-interactively the recent signature scheme by Camenisch and Lysyanskaya [12].”
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash (2010, methodology): “As such, we have used our language to develop a cryptographic library, Cashlib, that provides an interface for using ecash and fair exchange protocols without requiring expert knowledge from the programmer.”