Efficient Pairing Computation
Efficient Pairing Computation is a computational method in identity-based cryptography that belongs to the class of pairing-based cryptographic techniques and is distinguished by its optimization of bilinear pairing operations to minimize computational cost and latency while maintaining cryptographic security.
93
Publications
4.2K
Citations
195
Authors
103
Institutions
Publications per year
2017–2026
7
Parents
93
The Weil Pairing, and Its Efficient Calculation
Victor S. Miller · Journal of Cryptology · 2004 · 585 citations · Full text
Fréderik Vercauteren · IEEE Transactions on Information Theory · 2010 · 332 citations · Full text
An efficient certificateless aggregate signature with constant pairing computations
Hu Xiong, Zhi Guan, Zhong Chen et al. · Information Sciences · 2012 · 164 citations
1–5 of 93
195
8
h-index
Royal Holloway University of London, United Kingdom
5 publications · 587 citations
5
h-index
5
h-index
5
h-index
5
h-index
1–5 of 195
103
Dublin City University
Dublin, Ireland
10 h-index
17 publications
1.5K citations

University College Cork
Cork, Ireland
6 h-index
20 publications
324 citations
KU Leuven
Leuven, Belgium
5 h-index
8 publications
588 citations

Sun Yat-sen University
Guangzhou, China
5 h-index
9 publications
146 citations

Royal Holloway University of London
Egham, United Kingdom
5 h-index
5 publications
587 citations

University of Bristol
Bristol, United Kingdom
4 h-index
9 publications
444 citations
Microsoft (United States)
Redmond, United States
3 h-index
4 publications
194 citations
Future University Hakodate
Hakodate, Japan
3 h-index
5 publications
133 citations
1–8 of 103
Repository · 15 publications · 406 citations
12
h-index
4 publications · 84 citations
4
h-index
3 publications · 496 citations
3
h-index
3 publications · 226 citations
3
h-index
3 publications · 545 citations
3
h-index
1–5