Access control using pairing based cryptography

  • Authors:
  • Nigel P. Smart

  • Affiliations:
  • Dept. Computer Science, University of Bristol, Bristol, United Kingdom

  • Venue:
  • CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem. The concrete schemes that we get are the most efficient provable discrete-log type signature schemes to date.