Pairing-Based Cryptography at High Security Levels

By Neal Koblitz, Alfred J. Menezes. IMA Conference on Cryptography and Coding, 2005

348 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.

Performance evaluation of Attribute-Based Encryption: Toward data privacy in the IoT (2014, background): “Because ABE is built on top of pairing-based cryptography, its security strength is determined by the underlying pairingbased cryptographic algorithm, which in turn is determined by the bit-length of the parameters [10], [11].”
A Taxonomy of Pairing-Friendly Elliptic Curves (2010, background): “Example 6.24 (The Koblitz-Menezes family for k = 1) .”
Efficient and robust pseudonymous authentication in VANET (2007, methodology): “As implementations of group signatures and the chosen GS were not available to us, we calculated the number of 32-bit word multiplications required for GS signing and verifying, extracting the relevant data from [14] and [22].”
The Eta Pairing Revisited (2006, methodology): “In computing the cost we only count, again following [19] and [14], the cost of the doubling part of Miller’s algorithm.”
Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006, methodology): “For a more refined analysis see Koblitz and Menezes [19].”