Pairing-based identification schemes

TL;DR

This paper introduces four new pairing-based identification schemes that improve upon existing methods in terms of efficiency and security, supported by formal security proofs under specific assumptions.

Contribution

The paper presents four novel pairing-based identification schemes that are more secure and/or efficient than prior schemes, with formal security proofs.

Findings

All four schemes are proven secure under certain assumptions.

Each scheme demonstrates improved efficiency or security over existing methods.

The schemes are practical for real-world identification applications.

Abstract

We propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based identification scheme.