Faster Explicit Formulas for Computing Pairings over Ordinary Curves-Reference-Cited by-同舟云学术

Faster Explicit Formulas for Computing Pairings over Ordinary Curves

Published:2011 Issue: Volume: Page:48-68
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2011
language:
Short-container-title:

Author:

Aranha Diego F.,Karabina Koray,Longa Patrick,Gebotys Catherine H.,López Julio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_5.pdf

Reference34 articles.

1. Lecture Notes in Computer Science;D. Boneh,2001

2. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems Based on Pairing over Elliptic Curve. In: The 2001 Symposium on Cryptography and Information Security. IEICE, Oiso (2001) (in Japanese)

3. Lecture Notes in Computer Science;J. Groth,2008

4. Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. Journal of Cryptology 17(4), 263–276 (2004)

5. Hankerson, D., Menezes, A., Scott, M.: Identity-Based Cryptography, ch. 12, pp. 188–206. IOS Press, Amsterdam (2008)

Cited by 104 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Policy-Based Remote User Authentication From Multi-Biometrics;The Computer Journal;2023-10-19

2. Novel area-efficient and flexible architectures for optimal Ate pairing on FPGA;The Journal of Supercomputing;2023-08-18

3. High-Assurance Field Inversion for Curve-Based Cryptography;2023 IEEE 36th Computer Security Foundations Symposium (CSF);2023-07

4. High-Performance Implementation of the Identity-Based Signature Scheme in IEEE P1363 on GPU;ACM Transactions on Embedded Computing Systems;2023-01-24

5. Pairings in Rank-1 Constraint Systems;Applied Cryptography and Network Security;2023