Fixed argument pairings

Authors:
Craig Costello;Douglas Stebila
Affiliations:
Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia
Venue:
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Year:
2010

Citing 34
Cited 2

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Supersingular Curves in Cryptography

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Hierarchical ID-Based Cryptography

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Efficient Implementation of Pairing-Based Cryptosystems

Journal of Cryptology
Short Signatures from the Weil Pairing

Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
Direct chosen ciphertext security from identity-based techniques

Proceedings of the 12th ACM conference on Computer and communications security
Attribute-based encryption for fine-grained access control of encrypted data

Proceedings of the 13th ACM conference on Computer and communications security
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
Pairing Lattices

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Faster Pairings on Special Weierstrass Curves

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Fast Hashing to G2 on Pairing-Friendly Curves

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
A Taxonomy of Pairing-Friendly Elliptic Curves

Journal of Cryptology
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Optimised versions of the ate and twisted ate pairings

Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
On compressible pairings and their computation

AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Optimal pairings

IEEE Transactions on Information Theory
Delaying mismatched field multiplications in pairing computations

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Implementing cryptographic pairings on smartcards

CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
A new two-party identity-based authenticated key agreement

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Faster pairing computations on curves with high-degree twists

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Avoiding full extension field arithmetic in pairing computations

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
High-speed parallel software implementation of the ηT pairing

CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Pairing-Based cryptography at high security levels

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
The Eta Pairing Revisited

IEEE Transactions on Information Theory
Implementing cryptographic pairings

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Implementing cryptographic pairings over barreto-naehrig curves

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Affiliation-hiding authentication with minimal bandwidth consumption

WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
On efficient pairings on elliptic curves over extension fields

Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In these situations, the runtime of Miller's algorithm can be significantly reduced by storing precomputed values that depend on the fixed argument, prior to the input or existence of the second argument. In light of recent developments in pairing computation, we show that the computation of the Miller loop can be sped up by up to 37% if precomputation is employed, with our method being up to 19.5% faster than the previous precomputation techniques.