Efficient Identity Based Signature Schemes Based on Pairings

By Florian Hess. ACM Symposium on Applied Computing, 2002

1,031 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Geometry and Topology, Information Systems

View Paper: https://www.semanticscholar.org/paper/7386b60781328eedd8e0d61592c3963152a95e69

How researchers see this paper

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

In Artificial Intelligence

In Geometry and Topology

In Information Systems

Citations in the corpus

Charm: a framework for rapidly prototyping cryptosystems (2013, neutral): “Hess [50] Identity-based signature Pairing ROM 31”
Identity-Based Signcryption (2002, background): “Since then the ideas of [7] have been used to design several other identity-based schemes [9, 15, 16, 22].”
jPBC: Java pairing based cryptography (2011, methodology): “Moreover identity-based signature [16], [17], [18] identity-based identification [19], [20], [21], identity-based authenticated key agreement [22] schemes have been constructed using bilinear maps.”
An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks (2010, methodology): “Using the techniques in [38], computation efficiency can be achieved by precomputing certain pairing operations and leaving a minimal number of pairings on-the-fly at the verification phase.”
A new identity based signcryption scheme from pairings (2003, methodology): “This signature may be viewed as a variant of Hess’s identity based signature ([ 14 ]).”
Multi-signatures in the plain public-Key model and a general forking lemma (2006, methodology): “In particular, one can obtain efficient multi-signature schemes based on discrete logarithms from [36], based on RSA from [19], based on factoring from [16, 15, 33, 37], and based on pairings from [23].”
Location-based compromise-tolerant security mechanisms for wireless sensor networks (2006, methodology): “As noted in [33], the pairing evaluation by far takes the most running time of a filtering operation.”
Constructing Elliptic Curves with Prescribed Embedding Degrees (2002, background): “An important open problem in pairing-based cryptography [5,6, 12 ,14,22,23,27,29] is to build curves containing a subgroup with embedding degree k that is at once big enough to prevent the Frey-R¨ uck attack, but small enough that the Tate pairing is efficiently computable, which in turn means that ”
Certificateless Public Key Cryptography (2003, positive): “We will describe a certificateless public-key signature (CL-PKS) scheme that is based on a provably secure ID-PKC signature scheme of [23].”
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (2005, methodology): “This efficiency gain is obtained at the expense of letting the security rely on a stronger assumption than other provably secure pairing based IBS [12,15,24].”
Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography) (2003, methodology): “These include various IB signature schemes [22, 16, 8], key agreement [25], a 2-level hierarchical IB encryption [17], and a general hierarchical IB encryption that can also be used to produce signatures [15].”
Securing wireless sensor networks: a survey (2008, positive): “The other is to use an identitybased signature scheme [96] to authenticate external users.”
ID-Based Blind Signature and Ring Signature from Pairings (2002, methodology): “When n = 1; our ID-based ring signature reduces to the ID-based signature scheme proposed by F. Hess [ 11 ] (Let P1 = Ppub in Hess scheme).”
Secret handshakes from pairing-based key agreements (2003, background): “Pairing-based cryptography is finding an ever-expanding field of applications, ranging from identity-based encryption [6], to signature schemes [21, 7], to key agreements [27].”
Security Proofs for Identity-Based Identification and Signature Schemes (2008, methodology): “Many recent papers propose pairing-based IBS schemes [16,28,37,41,48] (the schemes independently published by [16] and [48] are actually equivalent).”