A Signature Scheme with Efficient Protocols

Camenisch, Jan; Lysyanskaya, Anna

doi:10.1007/3-540-36413-7_20

Cited by 474 publications

(524 citation statements)

References 31 publications

Supporting

Mentioning

503

Contrasting

Order By: Relevance

“…In Idemix, a credential is a Camenisch-Lysyanskaya [11] signature (A, e, v) on the block of messages consisting of the user's private key sk U and the attributes a 1 , . .…”

Section: Showing Protocol For Idemixmentioning

confidence: 99%

Fast Revocation of Attribute-Based Credentials for Both Users and Verifiers

Lueks¹,

Alpár²,

Hoepman³

et al. 2015

ICT Systems Security and Privacy Protection

View full text Add to dashboard Cite

Abstract. Attribute-based credentials allow a user to prove properties about herself anonymously. Revoking such credentials, which requires singling them out, is hard because it is at odds with anonymity. All revocation schemes proposed to date either sacrifice anonymity altogether, require the parties to be online, or put high load on the user or the verifier. As a result, these schemes are either too complicated for low-powered devices like smart cards or they do not scale. We propose a new revocation scheme that has a very low computational cost for users and verifiers, and does not require users to process updates. We trade only a limited, but well-defined, amount of anonymity to make the first practical revocation scheme that is efficient at large scales and fast enough for smart cards.

show abstract

“…In Idemix, a credential is a Camenisch-Lysyanskaya [11] signature (A, e, v) on the block of messages consisting of the user's private key sk U and the attributes a 1 , . .…”

Section: Showing Protocol For Idemixmentioning

confidence: 99%

Fast Revocation of Attribute-Based Credentials for Both Users and Verifiers

Lueks¹,

Alpár²,

Hoepman³

et al. 2015

ICT Systems Security and Privacy Protection

View full text Add to dashboard Cite

show abstract

“…The CLS [5] is a simple signature scheme with efficient protocols based on the strong RSA assumption. The following description is done in the context of our scheme.…”

Section: Camenisch Lysyanskaya Signature Scheme (Cls )mentioning

confidence: 99%

“…Signature on a committed value and PoK of this signature [5]. Signature generation is a protocol from [5, Fig.…”

Section: Camenisch Lysyanskaya Signature Scheme (Cls )mentioning

confidence: 99%

“…. , x k ) by introducing k bases a i [5]. Also, the pair of protocols above can be extended to support multiple messages, and selective message disclosure.…”

Section: Camenisch Lysyanskaya Signature Scheme (Cls )mentioning

confidence: 99%

“…add id i to DB; C sqi+1 ← C sqiâ ; The execution of the SigOnCommit protocol, in both the issue and redeem procedures, can be simulated towards A as described in the proof of [5,Lemma 6.1], where the actual signature computation is outsourced to the corresponding signature oracle.…”

Section: Proof (Sketch)mentioning

confidence: 99%

See 2 more Smart Citations

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

Chen

Escalante

Löhr

et al. 2007

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract.A multi-coupon (MC ) represents a collection of k coupons that a user can redeem to a vendor in exchange for some goods or services. Nguyen (FC 2006), deepening the ideas of Chen et al. (FC 2005), introduced an unforgeable privacy-protecting MC system with constant complexity for issuing and redemption of MCs, that discourages sharing of coupons through a property called weak unsplittability, where sharing of a single coupon implies sharing of the whole multi-coupon (all-ornothing sharing). Both schemes still lack some features required by many applications in practice, and also stronger forms of unsplittability are desirable. In this paper, we propose a new security model for MC systems with stronger definitions, followed by a concrete realization where single coupons within a MC may represent different goods or services, have independent validity periods, and must be redeemed sequentially ensuring a stronger version of unsplittability compared to all-or-nothing sharing. The complexity of the proposed scheme is linear in k for the generation of multi-coupons and constant for each redeemed single coupon.

show abstract

Privacy Protection with Group Signatures

Delgrossi

Tao

2012

Vehicle Safety Communications

View full text Add to dashboard Cite

A Signature Scheme with Efficient Protocols

Cited by 474 publications

References 31 publications

Fast Revocation of Attribute-Based Credentials for Both Users and Verifiers

Fast Revocation of Attribute-Based Credentials for Both Users and Verifiers

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

Privacy Protection with Group Signatures

Contact Info

Product

Resources

About