On computable isomorphisms in efficient asymmetric pairing-based systems

Authors:
N. P. Smart;F. Vercauteren
Affiliations:
Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, UK;Department of Electrical Engineering, University of Leuven, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 2
Cited 9

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Group signatures with verifier-local revocation

Proceedings of the 11th ACM conference on Computer and communications security

Pairings for cryptographers

Discrete Applied Mathematics
Verifiably Encrypted Signatures from RSA without NIZKs

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Biometric identity based signature revisited

EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Increased resilience in threshold cryptography: sharing a secret with devices that cannot store shares

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Non-interactive distributed encryption: a new primitive for revocable privacy

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Variants of waters' dual system primitives using asymmetric pairings

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
One-Move convertible nominative signature in the standard model

ProvSec'12 Proceedings of the 6th international conference on Provable Security
Practical hybrid hierarchical identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption

International Journal of Applied Cryptography

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we examine the hard problems underlying asymmetric pairings, their precise relationships and how they affect a number of existing protocols. Furthermore, we present a new model for the elliptic curve groups used in asymmetric pairings, which allows both an efficient pairing and an efficiently computable isomorphism.