The Eta Pairing Revisited

By Florian Hess, Nigel P. Smart, Frederik Vercauteren. IEEE Transactions on Information Theory, 2006

474 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/67819f3fc19acf536fe18beab457485a6a84c7e0

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

Optimal Pairings (2010, methodology): “Since then a large number of papers [2], [3], [7], [13], [15]–[17], [20], [21], [26]–[29] have incrementally improved efficiency, interspersed with the occasional jumps caused by fundamentally new approaches.”
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments (2012, methodology): “For κ = 128 , the current recommendation is to use an optimal (asymmetric) Ate pairing [18] over a subclass of Barreto-Naehrig curves [2].”
Faster Explicit Formulas for Computing Pairings over Ordinary Curves (2011, methodology): “It admits several optimal derivations [8] of different variants of the Ate pairing [15] such as Rate [16], Optimal Ate [8] and χ-ate [17].”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, background): “Recent advances in the area of bilinear pairings have produced new and more efficient variants of the Tate pairing, known as " Eta " [2] and " Ate " [27].”
A Taxonomy of Pairing-Friendly Elliptic Curves (2010, methodology): “The most common pairings used in applications are the Tate and Weil pairings on elliptic curves over finite fields; other proposed pairings include the Eta pairing [8], the Ate pairing [42], and their generalizations [41].”
Identity-based key agreement protocols from pairings (2017, methodology): “Thus we are assuming that a Tate pairing is used, as opposed to an Ate-pairing [16].”
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 (2008, methodology): “Pairings such as the Weil pairing (other proposed pairings include the Tate pairing, the Eta pairing [2], or the Ate pairing [8]) are used in many cryptographic applications such as identity based encryption [4], one-round 3-party key agreement protocols [9], and short signature schemes [3].”
Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014, background): “, the Tate pairing [45,46], the Eta pairing [24], and the Ate pairing [61].”
New Software Speed Records for Cryptographic Pairings (2010, methodology): “have been proposed like the eta, ate and twisted ate pairings [7, 25], the R-ate [26] and optimal ate pairings [34] (see also [6]), often increasing the computational efficiency over that of their predecessors.”
NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks (2008, methodology): “Here we have implemented the Ate pairing on a non-supersinglar curve over GF (p) as described in [54] with parameters k = 4, p a 256-bit prime, and a fixed point P .”