ID-based Signatures from Pairings on Elliptic Curves

By Kenneth G. Paterson. IACR Cryptology ePrint Archive, 2002

472 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/2d123397dacd79f468c9638c68cb46c598192686

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 Information Systems

Citations in the corpus

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ück attack, but small enough that the Tate pairing is efficiently computable, which in turn means th”
ID-Based Blind Signature and Ring Signature from Pairings (2002, methodology): “Examples are Boneh-Franklin’s ID-based encryption scheme [4], Smart’s ID-based authentication key agreement protocol [26], and several ID-based signatures schemes [6][11][20][23], etc.”
Implementing the Tate Pairing (2002, methodology): “The Weil and Tate pairings have recently been used to construct cryptosystems, such as the identity-based key exchange and signature schemes of Sakai, Ohgishi and Kasahara [14], the tripartite DiÆe-Hellman protocol of Joux [9], the escrow El Gamal system of Verheul [17], the identity-based encryptio”
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.”
A Taxonomy of Pairing-Friendly Elliptic Curves (2010, background): “In a flurry of research results, many new and novel protocols have been suggested, including one-round three-way key exchange [44], identity-based encryption [12,75], identity-based signatures [19,70], and short signature schemes [13].”
Efficient Algorithms for Pairing-Based Cryptosystems (2002, unknown): “– Identity-based signature schemes [8,22,24].”
Efficient Identity-Based Signatures Secure in the Standard Model (2006, background): “Since then, a large number of papers have been published in this area (see [Bar] for a list of some of these), including several containing direct constructions of identity-based signature (IBS) schemes [ Pat02 ,Hes02,CC03,Yi03,BLMQ05].”
Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography) (2003, methodology): “The following queries are allowed: Signature/encryption queries in which the adversary submits a mes- sage and two distinct identities, and obtains a ciphertext containing the message signed in the name of the first identity and encrypted for the second identity; Decryption queries in which the adve”
An Identity-Based Signature from Gap Diffie-Hellman Groups (2003, background): “Paterson’s scheme [Pat02] was proposed with a brief security arguments but no rigorous proof.”
Security Proofs for Identity-Based Identification and Signature Schemes (2008, background): “The scheme of [37] does not seem to be related to any convertible SI scheme, leaving its security an open problem.”
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].”
Certificateless Public Key Cryptography (2003, unknown): “There now exist identity-based key exchange protocols (interactive [31] as well as non-interactive [33]), signature schemes [10, 23, 26], hierarchical schemes [20] and a host of other primitives.”