Self-Blindable Credential Certificates from the Weil Pairing

Verheul, Eric R.

doi:10.1007/3-540-45682-1_31

Cited by 93 publications

(55 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, [7] described a short signature scheme based on the Weil and Tate pairings. Other applications include [17,34]. All of these applications consider elliptic curves defined over fields of characteristic 2 and 3.…”

Section: Introductionmentioning

confidence: 99%

Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications

Bertoni

Guajardo

Kumar

et al. 2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Recently, there has been a lot of interest on cryptographic applications based on fields GF (p m ), for p > 2. This contribution presents GF (p m ) multipliers architectures, where p is odd. We present designs which trade area for performance based on the number of coefficients that the multiplier processes at one time. Families of irreducible polynomials are introduced to reduce the complexity of the modulo reduction operation and, thus, improved the efficiency of the multiplier. We, then, specialize to fields GF (3 m ) and provide the first cubing architecture presented in the literature. We synthesize our architectures for the special case of GF (3 97 ) on the XCV1000-8-FG1156 and XC2VP20-7-FF1156 FPGAs and provide area/performance numbers and comparisons to previous GF (3 m ) and GF (2 m ) implementations. Finally, we provide tables of irreducible polynomials over GF (3) of degree m with 2 ≤ m ≤ 255.

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications

Bertoni

Guajardo

Kumar

et al. 2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Self-blindable credentials, introduced by Verheul [13], are credentials that the user modifies each time before he shows it to a verifier, in such a way that it remains valid, and such that multiple transactions cannot be linked to each other. We define this notion as follows.…”

Section: Definitionsmentioning

confidence: 99%

“…This is called blinding, and credential schemes that use this technique are called self-blindable credential schemes. The first example of such a scheme was given by Verheul in the same paper that defines the notion of self-blindability [13]. The advantage of blinding credentials in such a way is that it is easy for the user (blinding is usually cheap) and for the verifier (verifying a blinded signature is generally not much different from verifying an ordinary signature).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Linkability and Malleability in Self-blindable Credentials

Hoepman

Lueks

Ringers

2015

Information Security Theory and Practice

View full text Add to dashboard Cite

Abstract. Self-blindable credential schemes allow users to anonymously prove ownership of credentials. This is achieved by randomizing the credential before each showing in such a way that it still remains valid. As a result, each time a different version of the same credential is presented. A number of such schemes have been proposed, but unfortunately many of them are broken, in the sense that they are linkable (i.e., failing to protect the privacy of the user), or malleable (i.e., they allow users to create new credentials using one or more valid credentials given to them). In this paper we prove a general theorem that relates linkability and malleability in self-blindable credential schemes, and that can test whether a scheme is linkable or malleable. After that we apply the theorem to a number of self-blindable credential schemes to show that they suffer from one or both of these issues.

show abstract

“…Do we want such a society? There are modern, more advanced cryptographic protocols (see e.g [1,11]) that allow anonymous, attribute-based access control. However, they require non-trivial computational resources and advanced, very fast smart cards.…”

Section: What Went Wrong: Smart Cards In Public Transportmentioning

confidence: 99%

Architecture Is Politics: Security and Privacy Issues in Transport and Beyond

Jacobs

2010

Data Protection in a Profiled World

View full text Add to dashboard Cite

Abstract. This paper discusses the political relevance of ICT-architecture through a review of recent developments in the Netherlands, involving the bumpy introduction of a national smart card for public transport and the plans for electronic traffic pricing based on actual road usage of individual cars. One of the underlying themes is the centralised or decentralised storage of privacy-sensitive data, where centralised informational control supports centralised societal control.

show abstract

Self-Blindable Credential Certificates from the Weil Pairing

Cited by 93 publications

References 23 publications

Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications

Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications

On Linkability and Malleability in Self-blindable Credentials

Architecture Is Politics: Security and Privacy Issues in Transport and Beyond

Contact Info

Product

Resources

About