Restricted Identification Scheme and Diffie-Hellman Linking Problem

Kutyłowski, Mirosław; Krzywiecki, Łukasz; Kubiak, Przemysław; Koza, Michał

doi:10.1007/978-3-642-32298-3_15

“…Domain-specific pseudonyms [5,20,22] only slightly improve the situation: instead of being globally linkable, different uses are only linkable by the same verifier, but not across different verifiers. We believe this still weakens the unlinkability too much.…”

Section: Related Workmentioning

confidence: 99%

Fast revocation of attribute-based credentials for both users and verifiers

Lueks

¹

,

Alpár

²

,

Hoepman

³

et al. 2017

Computers & Security

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

“…The protocols of the German identity card and (some of) the eIDAS extensions have been analyzed in a series of works [7,11,15,10,5,6,13,8,12]. In fact, supporting the protocols by security arguments in form of cryptographic proofs has been a key point in the marketing strategy.…”

Section: Related Workmentioning

confidence: 99%

Securing Transactions with the eIDAS Protocols

Morgner

¹

,

Bastian

²

,

Fischlin

³

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…Domain-specific pseudonyms [5,15,16] only slightly improve the situation: instead of being globally linkable, different uses are only linkable by the same verifier, but not across different verifiers. We believe this still weakens the unlinkability too much.…”

Section: Related Workmentioning

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

9

0

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

Restricted Identification Scheme and Diffie-Hellman Linking Problem

Cited by 8 publications

References 9 publications

Fast revocation of attribute-based credentials for both users and verifiers

Fast revocation of attribute-based credentials for both users and verifiers

Securing Transactions with the eIDAS Protocols

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

Contact Info

Product

Resources

About