The following pages link to (Q3543476):
Displaying 11 items.
- Multi-recastable e-bidding game with dual-blindness (Q462743) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Point Decomposition Problem in Binary Elliptic Curves (Q2806768) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- An efficient certificateless multi-receiver threshold decryption scheme (Q5223832) (← links)
- (Q6081719) (← links)
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
