An Efficient Signature Scheme from Bilinear Pairings and Its Applications

By Fangguo Zhang, Reihaneh Safavi-Naini, Willy Susilo. International Conference on Theory and Practice of Public Key Cryptography, 2004

564 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Short Signatures Without Random Oracles (2004, unknown): “[ZSNS04].”
An Efficient Conditional Privacy-Preserving Authentication Scheme for Vehicular Sensor Networks Without Pairings (2016, background): “This special MapToPoint function is inefficient and probabilistic [27]; while there is a lot of discussion regarding how to construct such a hash algorithm, there is no efficient deterministic polynomial time based algorithm proposed yet.”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, background): “[48], with a different reduction: in the random oracle model, security of this full domain hash scheme can be proven under Mitsunari’s et al.”
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (2005, background): “The scheme can be thought of as an identity-based extension of a digital signature discussed in two independent papers [9, 38].”
Improved proxy re-encryption schemes with applications to secure distributed storage (2006, background): “There is evidence that the computational Bilinear Inverse Diffie-Hellman problem is hard [39], but this decisional version has not been studied enough.”