Developing Efficient Blinded Attribute Certificates on Smart Cards via Pairings

نویسندگان

  • Lejla Batina
  • Jaap-Henk Hoepman
  • Bart Jacobs
  • Wojciech Mostowski
  • Pim Vullers
چکیده

This paper describes an elementary protocol to prove possession of anonymous credentials together with its implementation on smart cards. The protocol uses self-blindable attribute certificates represented as points on an elliptic curve (which are stored on the card). These certificates are verified on the reader-side via a bilinear pairing. Java Card smart cards offer only very limited access to the cryptographic coprocessor. It thus requires some ingenuity to get the protocol running with reasonable speed. We realise protocol runs with on-card computation times in the order of 1.5 seconds. It should be possible to further reduce this time with extended access to the cryptographic coprocessor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy and Security Issues in e-T icketing O ptim isation of Smart Card-based Attribute-proving

This short note concentrates on an optimisation of the attribute-proving protocol by Batina et al. [1], and provides the improved performance figures. The protocol relies on elliptic curve cryptography with bilinear pairings. These pairings provide signatures that are stable under multiplication with a blinding factor. In this way multiple proofs are unlinkable, and thus provides a privacy-frie...

متن کامل

Power Analysis Attacks and Countermeasures on η T Pairing over Binary Fields

ETRI Journal, Volume 30, Number 1, February 2008 Since many efficient algorithms for implementing pairings have been proposed such as ηT pairing and the Ate pairing, pairings could be used in constraint devices such as smart cards. However, the secure implementation of pairings has not been thoroughly investigated. In this paper, we investigate the security of ηT pairing over binary fields in t...

متن کامل

Efficient Delegation of Pairing Computation

Pairing computation requires a lot of efforts for portable small devices such as smart cards. It was first considered concretely by Chevallier-Mames et al. that the cards delegate computation of pairings to a powerful device. In this paper, we propose more efficient protocols than those of Chevallier-Mames et al. in two cases, and provide two new variants that would be useful in real applications.

متن کامل

A New Secure Mutual Authentication Scheme with Smart Cards Using Bilinear Pairings

Mutual authentication is an important security property for providing secure remote communication in client-server environment. Up to now, various remote user authentication schemes with smart card using bilinear pairings were proposed by different researchers. Unfortunately, most previously proposed authentication schemes do not provide mutual authentication and session key agreement. This pap...

متن کامل

Zero-knowledge Group Identification and Hidden Group Signature for Smart Cards Using Bilinear Pairings

In this paper, we propose a new blind group identification protocol and a hidden group signature protocol as its application. These protocols involve many provers and one verifier such that (1) the statement of all the provers are proved simultaneously, (2) and also all the provers using computationally limited devices (e.g. smart cards) have no need of computing the bilinear pairings, (3) but ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010