A Signature Scheme with Efficient Protocols

By Jan Camenisch, Anna Lysyanskaya. International Conference on Security and Cryptography for Networks, 2002

807 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/764e89025d68eda8010732285add5a4296f4e0ae

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 Information Systems

Citations in the corpus

Short Randomizable Signatures (2016, background): “In 2004, Camenisch and Lysyanskaya proposed a new pairing-based signature scheme [CL04] whose ﬂexibility has allowed it to be used in several applications, such as group signatures [BCN + 10], direct anonymous attestations [CPS10,BFG + 13], aggregate signatures [LLY13] or E-cash systems [CPST15].”
Floating Car Data from Smartphones : What Google and Waze Know About You and How Hackers Can Control Traffic (2013, methodology): “In the last section of the protocol, D and P run the CL protocol [6].”
Universally Composable Security with Global Setup (2007, methodology): “For example, we can use any “signature scheme with efficient protocols”, such as the one of [16] based on strong RSA.”
Traceable Signatures (2004, background): “We remark that a variant of this problem and of the theorem below has been proposed and proved in a recent work of Camenisch and Lysyanskaya [10] (without the sphere constraints).”
A capability-based security approach to manage access control in the Internet of Things (2013, methodology): “The specific Zero Knowledge Proof technique can vary from case to case (the FP7 IoT@Work project does not address privacy or anonymity issues being a project focused on the enacting manufacturing environments with IoT); as an example a possible technique could be for Bob to use a Mixminion anonymous”
How to win the clonewars: efficient periodic n-times anonymous authentication (2006, background): “This step can be efficiently realized using the CL protocols [16, 17] in such a way that I learns nothing about skU or s.”
Enhanced Privacy ID from Bilinear Pairing for Hardware Authentication and Attestation (2010, background): “In our scheme, each platform chooses a unique membership key f. As in anonymous credential schemes [17, 19 ], group signature schemes [8, 9], or DAA schemes [13, 14], the issuer in our scheme computes a signature on f. That is, the issuer computes a BBS+ signature (A, x, y). The value f is the plat”
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, methodology): “employ special signature protocols, called CL signatures [39], for issuing private certificates to users.”
Privacy and accountability for location-based aggregate statistics (2011, methodology): “Client picks a random number s and obtains a blind signature from Server on s denoted sig(s) (using the scheme in [10]).”
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (2009, background): “in the form of a signature, or an unlinkable credential [6], on the commitments to these values.”
Compact E-Cash (2005, methodology): “Camenisch and Lysyanskaya [14] came up with a secure signature scheme with two protocols: (1) An efficient protocol between a user and a signer with”
Constant-Size Dynamic k-TAA (2006, methodology): “Examples include CL signature, CL+ signature [9, 11].”
Efficient Protocols for Set Membership and Range Proofs (2008, background): “Camenisch and Lysyanskaya have given an implementation of such an accumulator and a protocol that a committed value is indeed contained in the accumulator based on the strong RSA assumption[6].”